java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/ntdrivers-simplified/cdaudio_simpl1.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-07 12:57:30,829 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-07 12:57:30,831 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-07 12:57:30,843 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-07 12:57:30,844 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-07 12:57:30,845 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-07 12:57:30,846 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-07 12:57:30,848 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-07 12:57:30,850 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-07 12:57:30,851 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-07 12:57:30,852 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-07 12:57:30,853 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-07 12:57:30,853 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-07 12:57:30,854 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-07 12:57:30,855 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-07 12:57:30,857 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-07 12:57:30,857 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-07 12:57:30,858 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-07 12:57:30,860 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-07 12:57:30,865 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-07 12:57:30,867 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-07 12:57:30,871 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-07 12:57:30,872 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-07 12:57:30,874 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-07 12:57:30,877 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-07 12:57:30,877 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-07 12:57:30,878 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-07 12:57:30,879 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-07 12:57:30,879 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-07 12:57:30,880 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-07 12:57:30,880 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-07 12:57:30,881 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-07 12:57:30,882 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-07 12:57:30,882 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-07 12:57:30,883 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-07 12:57:30,884 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-07 12:57:30,884 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-07 12:57:30,884 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-07 12:57:30,885 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-07 12:57:30,886 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-07 12:57:30,886 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-07 12:57:30,887 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-07 12:57:30,901 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-07 12:57:30,902 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-07 12:57:30,903 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-07 12:57:30,903 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-07 12:57:30,903 INFO L138 SettingsManager]: * Use SBE=true [2019-09-07 12:57:30,904 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-07 12:57:30,904 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-07 12:57:30,904 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-07 12:57:30,904 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-07 12:57:30,904 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-07 12:57:30,905 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-07 12:57:30,905 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-07 12:57:30,905 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-07 12:57:30,905 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-07 12:57:30,905 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-07 12:57:30,906 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-07 12:57:30,906 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-07 12:57:30,906 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-07 12:57:30,906 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-07 12:57:30,907 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-07 12:57:30,907 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-07 12:57:30,907 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 12:57:30,907 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-07 12:57:30,907 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-07 12:57:30,908 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-07 12:57:30,908 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-07 12:57:30,908 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-07 12:57:30,908 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-07 12:57:30,908 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-07 12:57:30,940 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-07 12:57:30,951 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-07 12:57:30,955 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-07 12:57:30,956 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-07 12:57:30,957 INFO L275 PluginConnector]: CDTParser initialized [2019-09-07 12:57:30,958 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ntdrivers-simplified/cdaudio_simpl1.cil-2.c [2019-09-07 12:57:31,013 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67b8a86db/ae75b114acd34db9a992c1fb8bedaf28/FLAG8e467fba8 [2019-09-07 12:57:31,662 INFO L306 CDTParser]: Found 1 translation units. [2019-09-07 12:57:31,663 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers-simplified/cdaudio_simpl1.cil-2.c [2019-09-07 12:57:31,694 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67b8a86db/ae75b114acd34db9a992c1fb8bedaf28/FLAG8e467fba8 [2019-09-07 12:57:31,912 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67b8a86db/ae75b114acd34db9a992c1fb8bedaf28 [2019-09-07 12:57:31,926 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-07 12:57:31,928 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-07 12:57:31,932 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-07 12:57:31,932 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-07 12:57:31,936 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-07 12:57:31,937 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 12:57:31" (1/1) ... [2019-09-07 12:57:31,940 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b410655 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 12:57:31, skipping insertion in model container [2019-09-07 12:57:31,941 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 12:57:31" (1/1) ... [2019-09-07 12:57:31,948 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-07 12:57:32,033 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-07 12:57:32,559 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 12:57:32,575 INFO L188 MainTranslator]: Completed pre-run [2019-09-07 12:57:32,773 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 12:57:32,801 INFO L192 MainTranslator]: Completed translation [2019-09-07 12:57:32,802 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 12:57:32 WrapperNode [2019-09-07 12:57:32,802 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-07 12:57:32,803 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-07 12:57:32,803 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-07 12:57:32,803 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-07 12:57:32,817 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 12:57:32" (1/1) ... [2019-09-07 12:57:32,818 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 12:57:32" (1/1) ... [2019-09-07 12:57:32,839 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 12:57:32" (1/1) ... [2019-09-07 12:57:32,840 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 12:57:32" (1/1) ... [2019-09-07 12:57:32,904 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 12:57:32" (1/1) ... [2019-09-07 12:57:32,930 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 12:57:32" (1/1) ... [2019-09-07 12:57:32,936 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 12:57:32" (1/1) ... [2019-09-07 12:57:32,947 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-07 12:57:32,948 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-07 12:57:32,948 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-07 12:57:32,948 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-07 12:57:32,949 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 12:57:32" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-09-07 12:57:33,014 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-07 12:57:33,014 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-07 12:57:33,014 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2019-09-07 12:57:33,014 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2019-09-07 12:57:33,015 INFO L138 BoogieDeclarations]: Found implementation of procedure SendSrbSynchronous [2019-09-07 12:57:33,015 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioSignalCompletion [2019-09-07 12:57:33,015 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioStartDevice [2019-09-07 12:57:33,015 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioPnp [2019-09-07 12:57:33,015 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioDeviceControl [2019-09-07 12:57:33,016 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioSendToNextDriver [2019-09-07 12:57:33,016 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioIsPlayActive [2019-09-07 12:57:33,016 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudio535DeviceControl [2019-09-07 12:57:33,016 INFO L138 BoogieDeclarations]: Found implementation of procedure AG_SetStatusAndReturn [2019-09-07 12:57:33,016 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudio435DeviceControl [2019-09-07 12:57:33,017 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioAtapiDeviceControl [2019-09-07 12:57:33,017 INFO L138 BoogieDeclarations]: Found implementation of procedure HpCdrProcessLastSession [2019-09-07 12:57:33,017 INFO L138 BoogieDeclarations]: Found implementation of procedure HPCdrCompletion [2019-09-07 12:57:33,017 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioHPCdrDeviceControl [2019-09-07 12:57:33,017 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioForwardIrpSynchronous [2019-09-07 12:57:33,018 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioUnload [2019-09-07 12:57:33,018 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioPower [2019-09-07 12:57:33,018 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2019-09-07 12:57:33,018 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-07 12:57:33,018 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2019-09-07 12:57:33,019 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2019-09-07 12:57:33,019 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2019-09-07 12:57:33,019 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2019-09-07 12:57:33,019 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2019-09-07 12:57:33,019 INFO L138 BoogieDeclarations]: Found implementation of procedure PoCallDriver [2019-09-07 12:57:33,020 INFO L138 BoogieDeclarations]: Found implementation of procedure ZwClose [2019-09-07 12:57:33,020 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-07 12:57:33,020 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-07 12:57:33,021 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-07 12:57:33,021 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-09-07 12:57:33,021 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-09-07 12:57:33,022 INFO L130 BoogieDeclarations]: Found specification of procedure SendSrbSynchronous [2019-09-07 12:57:33,022 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioSignalCompletion [2019-09-07 12:57:33,022 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioStartDevice [2019-09-07 12:57:33,022 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioPnp [2019-09-07 12:57:33,023 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioDeviceControl [2019-09-07 12:57:33,023 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioSendToNextDriver [2019-09-07 12:57:33,023 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioIsPlayActive [2019-09-07 12:57:33,023 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudio535DeviceControl [2019-09-07 12:57:33,023 INFO L130 BoogieDeclarations]: Found specification of procedure AG_SetStatusAndReturn [2019-09-07 12:57:33,024 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudio435DeviceControl [2019-09-07 12:57:33,024 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioAtapiDeviceControl [2019-09-07 12:57:33,024 INFO L130 BoogieDeclarations]: Found specification of procedure HPCdrCompletion [2019-09-07 12:57:33,024 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioHPCdrDeviceControl [2019-09-07 12:57:33,024 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioForwardIrpSynchronous [2019-09-07 12:57:33,024 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioPower [2019-09-07 12:57:33,024 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2019-09-07 12:57:33,025 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2019-09-07 12:57:33,025 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2019-09-07 12:57:33,025 INFO L130 BoogieDeclarations]: Found specification of procedure PoCallDriver [2019-09-07 12:57:33,025 INFO L130 BoogieDeclarations]: Found specification of procedure ZwClose [2019-09-07 12:57:33,025 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2019-09-07 12:57:33,025 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2019-09-07 12:57:33,026 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2019-09-07 12:57:33,027 INFO L130 BoogieDeclarations]: Found specification of procedure HpCdrProcessLastSession [2019-09-07 12:57:33,027 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioUnload [2019-09-07 12:57:33,027 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2019-09-07 12:57:33,027 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-07 12:57:33,028 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2019-09-07 12:57:33,028 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-07 12:57:33,028 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-07 12:57:33,577 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-07 12:57:33,701 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume !false; [2019-09-07 12:57:33,701 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##14: assume false; [2019-09-07 12:57:33,713 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-07 12:57:33,772 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume !false; [2019-09-07 12:57:33,772 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##17: assume false; [2019-09-07 12:57:33,800 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-07 12:57:33,831 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2019-09-07 12:57:33,831 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2019-09-07 12:57:33,933 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-07 12:57:33,977 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint L304: #res := 0; [2019-09-07 12:57:33,978 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##6: assume !false; [2019-09-07 12:57:33,978 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##5: assume false; [2019-09-07 12:57:33,984 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-07 12:57:34,205 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##21: assume false; [2019-09-07 12:57:34,205 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##22: assume !false; [2019-09-07 12:57:34,206 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-07 12:57:34,235 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##21: assume !false; [2019-09-07 12:57:34,236 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##20: assume false; [2019-09-07 12:57:34,269 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-07 12:57:34,291 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##10: assume !false; [2019-09-07 12:57:34,292 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##9: assume false; [2019-09-07 12:57:34,296 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-07 12:57:34,503 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##26: assume !false; [2019-09-07 12:57:34,504 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##25: assume false; [2019-09-07 12:57:34,518 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-07 12:57:34,524 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-09-07 12:57:34,525 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-09-07 12:57:34,539 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-07 12:57:34,539 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-07 12:57:34,541 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 12:57:34 BoogieIcfgContainer [2019-09-07 12:57:34,541 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-07 12:57:34,542 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-07 12:57:34,542 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-07 12:57:34,545 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-07 12:57:34,546 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.09 12:57:31" (1/3) ... [2019-09-07 12:57:34,546 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7144cf97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 12:57:34, skipping insertion in model container [2019-09-07 12:57:34,547 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 12:57:32" (2/3) ... [2019-09-07 12:57:34,547 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7144cf97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 12:57:34, skipping insertion in model container [2019-09-07 12:57:34,547 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 12:57:34" (3/3) ... [2019-09-07 12:57:34,549 INFO L109 eAbstractionObserver]: Analyzing ICFG cdaudio_simpl1.cil-2.c [2019-09-07 12:57:34,560 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-07 12:57:34,569 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-07 12:57:34,586 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-07 12:57:34,621 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-07 12:57:34,621 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-07 12:57:34,622 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-07 12:57:34,622 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-07 12:57:34,622 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-07 12:57:34,622 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-07 12:57:34,622 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-07 12:57:34,622 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-07 12:57:34,622 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-07 12:57:34,654 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states. [2019-09-07 12:57:34,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-07 12:57:34,661 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:57:34,662 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:57:34,664 INFO L418 AbstractCegarLoop]: === Iteration 1 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:57:34,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:57:34,670 INFO L82 PathProgramCache]: Analyzing trace with hash 1001295975, now seen corresponding path program 1 times [2019-09-07 12:57:34,672 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:57:34,673 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:57:34,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:57:34,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 12:57:34,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:57:34,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:57:34,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 12:57:34,918 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 12:57:34,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 12:57:34,923 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 12:57:34,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 12:57:34,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 12:57:34,941 INFO L87 Difference]: Start difference. First operand 515 states. Second operand 3 states. [2019-09-07 12:57:35,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:57:35,165 INFO L93 Difference]: Finished difference Result 887 states and 1373 transitions. [2019-09-07 12:57:35,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 12:57:35,167 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-09-07 12:57:35,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:57:35,187 INFO L225 Difference]: With dead ends: 887 [2019-09-07 12:57:35,187 INFO L226 Difference]: Without dead ends: 507 [2019-09-07 12:57:35,196 INFO L628 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 [2019-09-07 12:57:35,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2019-09-07 12:57:35,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 507. [2019-09-07 12:57:35,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 507 states. [2019-09-07 12:57:35,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 737 transitions. [2019-09-07 12:57:35,313 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 737 transitions. Word has length 20 [2019-09-07 12:57:35,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:57:35,314 INFO L475 AbstractCegarLoop]: Abstraction has 507 states and 737 transitions. [2019-09-07 12:57:35,314 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 12:57:35,315 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 737 transitions. [2019-09-07 12:57:35,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-07 12:57:35,317 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:57:35,317 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:57:35,318 INFO L418 AbstractCegarLoop]: === Iteration 2 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:57:35,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:57:35,319 INFO L82 PathProgramCache]: Analyzing trace with hash 1234723898, now seen corresponding path program 1 times [2019-09-07 12:57:35,319 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:57:35,319 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:57:35,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:57:35,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 12:57:35,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:57:35,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:57:35,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 12:57:35,530 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 12:57:35,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 12:57:35,532 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 12:57:35,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 12:57:35,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 12:57:35,533 INFO L87 Difference]: Start difference. First operand 507 states and 737 transitions. Second operand 3 states. [2019-09-07 12:57:35,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:57:35,818 INFO L93 Difference]: Finished difference Result 789 states and 1117 transitions. [2019-09-07 12:57:35,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 12:57:35,818 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-09-07 12:57:35,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:57:35,833 INFO L225 Difference]: With dead ends: 789 [2019-09-07 12:57:35,834 INFO L226 Difference]: Without dead ends: 670 [2019-09-07 12:57:35,836 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 12:57:35,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2019-09-07 12:57:35,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 652. [2019-09-07 12:57:35,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 652 states. [2019-09-07 12:57:35,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 652 states and 931 transitions. [2019-09-07 12:57:35,912 INFO L78 Accepts]: Start accepts. Automaton has 652 states and 931 transitions. Word has length 25 [2019-09-07 12:57:35,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:57:35,912 INFO L475 AbstractCegarLoop]: Abstraction has 652 states and 931 transitions. [2019-09-07 12:57:35,912 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 12:57:35,912 INFO L276 IsEmpty]: Start isEmpty. Operand 652 states and 931 transitions. [2019-09-07 12:57:35,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-07 12:57:35,914 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:57:35,915 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:57:35,915 INFO L418 AbstractCegarLoop]: === Iteration 3 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:57:35,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:57:35,915 INFO L82 PathProgramCache]: Analyzing trace with hash 1338407833, now seen corresponding path program 1 times [2019-09-07 12:57:35,915 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:57:35,916 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:57:35,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:57:35,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 12:57:35,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:57:35,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:57:36,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 12:57:36,009 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 12:57:36,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 12:57:36,010 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 12:57:36,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 12:57:36,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 12:57:36,011 INFO L87 Difference]: Start difference. First operand 652 states and 931 transitions. Second operand 3 states. [2019-09-07 12:57:36,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:57:36,086 INFO L93 Difference]: Finished difference Result 995 states and 1378 transitions. [2019-09-07 12:57:36,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 12:57:36,087 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-09-07 12:57:36,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:57:36,094 INFO L225 Difference]: With dead ends: 995 [2019-09-07 12:57:36,094 INFO L226 Difference]: Without dead ends: 819 [2019-09-07 12:57:36,096 INFO L628 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 [2019-09-07 12:57:36,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2019-09-07 12:57:36,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 767. [2019-09-07 12:57:36,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 767 states. [2019-09-07 12:57:36,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 767 states to 767 states and 1091 transitions. [2019-09-07 12:57:36,166 INFO L78 Accepts]: Start accepts. Automaton has 767 states and 1091 transitions. Word has length 30 [2019-09-07 12:57:36,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:57:36,166 INFO L475 AbstractCegarLoop]: Abstraction has 767 states and 1091 transitions. [2019-09-07 12:57:36,166 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 12:57:36,167 INFO L276 IsEmpty]: Start isEmpty. Operand 767 states and 1091 transitions. [2019-09-07 12:57:36,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-09-07 12:57:36,176 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:57:36,176 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:57:36,176 INFO L418 AbstractCegarLoop]: === Iteration 4 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:57:36,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:57:36,177 INFO L82 PathProgramCache]: Analyzing trace with hash 817062638, now seen corresponding path program 1 times [2019-09-07 12:57:36,177 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:57:36,177 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:57:36,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:57:36,179 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 12:57:36,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:57:36,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:57:36,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 12:57:36,260 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 12:57:36,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 12:57:36,261 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 12:57:36,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 12:57:36,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 12:57:36,262 INFO L87 Difference]: Start difference. First operand 767 states and 1091 transitions. Second operand 3 states. [2019-09-07 12:57:36,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:57:36,469 INFO L93 Difference]: Finished difference Result 1424 states and 2092 transitions. [2019-09-07 12:57:36,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 12:57:36,469 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-09-07 12:57:36,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:57:36,479 INFO L225 Difference]: With dead ends: 1424 [2019-09-07 12:57:36,479 INFO L226 Difference]: Without dead ends: 1160 [2019-09-07 12:57:36,481 INFO L628 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 [2019-09-07 12:57:36,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1160 states. [2019-09-07 12:57:36,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1160 to 899. [2019-09-07 12:57:36,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 899 states. [2019-09-07 12:57:36,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 899 states to 899 states and 1323 transitions. [2019-09-07 12:57:36,588 INFO L78 Accepts]: Start accepts. Automaton has 899 states and 1323 transitions. Word has length 31 [2019-09-07 12:57:36,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:57:36,588 INFO L475 AbstractCegarLoop]: Abstraction has 899 states and 1323 transitions. [2019-09-07 12:57:36,588 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 12:57:36,589 INFO L276 IsEmpty]: Start isEmpty. Operand 899 states and 1323 transitions. [2019-09-07 12:57:36,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-09-07 12:57:36,591 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:57:36,591 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:57:36,591 INFO L418 AbstractCegarLoop]: === Iteration 5 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:57:36,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:57:36,595 INFO L82 PathProgramCache]: Analyzing trace with hash -679253739, now seen corresponding path program 1 times [2019-09-07 12:57:36,595 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:57:36,595 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:57:36,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:57:36,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 12:57:36,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:57:36,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:57:36,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 12:57:36,711 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 12:57:36,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 12:57:36,711 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 12:57:36,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 12:57:36,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 12:57:36,712 INFO L87 Difference]: Start difference. First operand 899 states and 1323 transitions. Second operand 5 states. [2019-09-07 12:57:37,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:57:37,596 INFO L93 Difference]: Finished difference Result 1562 states and 2305 transitions. [2019-09-07 12:57:37,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-07 12:57:37,596 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2019-09-07 12:57:37,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:57:37,602 INFO L225 Difference]: With dead ends: 1562 [2019-09-07 12:57:37,603 INFO L226 Difference]: Without dead ends: 984 [2019-09-07 12:57:37,605 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-07 12:57:37,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 984 states. [2019-09-07 12:57:37,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 984 to 887. [2019-09-07 12:57:37,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 887 states. [2019-09-07 12:57:37,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 887 states to 887 states and 1299 transitions. [2019-09-07 12:57:37,658 INFO L78 Accepts]: Start accepts. Automaton has 887 states and 1299 transitions. Word has length 32 [2019-09-07 12:57:37,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:57:37,658 INFO L475 AbstractCegarLoop]: Abstraction has 887 states and 1299 transitions. [2019-09-07 12:57:37,658 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 12:57:37,659 INFO L276 IsEmpty]: Start isEmpty. Operand 887 states and 1299 transitions. [2019-09-07 12:57:37,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-09-07 12:57:37,661 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:57:37,661 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:57:37,661 INFO L418 AbstractCegarLoop]: === Iteration 6 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:57:37,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:57:37,662 INFO L82 PathProgramCache]: Analyzing trace with hash 891535335, now seen corresponding path program 1 times [2019-09-07 12:57:37,662 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:57:37,662 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:57:37,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:57:37,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 12:57:37,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:57:37,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:57:37,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 12:57:37,718 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 12:57:37,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 12:57:37,718 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 12:57:37,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 12:57:37,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 12:57:37,719 INFO L87 Difference]: Start difference. First operand 887 states and 1299 transitions. Second operand 3 states. [2019-09-07 12:57:37,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:57:37,814 INFO L93 Difference]: Finished difference Result 890 states and 1301 transitions. [2019-09-07 12:57:37,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 12:57:37,815 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-09-07 12:57:37,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:57:37,821 INFO L225 Difference]: With dead ends: 890 [2019-09-07 12:57:37,821 INFO L226 Difference]: Without dead ends: 886 [2019-09-07 12:57:37,822 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 12:57:37,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 886 states. [2019-09-07 12:57:37,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 886 to 886. [2019-09-07 12:57:37,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 886 states. [2019-09-07 12:57:37,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 886 states to 886 states and 1296 transitions. [2019-09-07 12:57:37,879 INFO L78 Accepts]: Start accepts. Automaton has 886 states and 1296 transitions. Word has length 36 [2019-09-07 12:57:37,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:57:37,879 INFO L475 AbstractCegarLoop]: Abstraction has 886 states and 1296 transitions. [2019-09-07 12:57:37,879 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 12:57:37,879 INFO L276 IsEmpty]: Start isEmpty. Operand 886 states and 1296 transitions. [2019-09-07 12:57:37,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-09-07 12:57:37,881 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:57:37,881 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:57:37,883 INFO L418 AbstractCegarLoop]: === Iteration 7 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:57:37,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:57:37,884 INFO L82 PathProgramCache]: Analyzing trace with hash 975145180, now seen corresponding path program 1 times [2019-09-07 12:57:37,884 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:57:37,884 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:57:37,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:57:37,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 12:57:37,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:57:37,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:57:37,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 12:57:37,951 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 12:57:37,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 12:57:37,952 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 12:57:37,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 12:57:37,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 12:57:37,952 INFO L87 Difference]: Start difference. First operand 886 states and 1296 transitions. Second operand 3 states. [2019-09-07 12:57:38,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:57:38,015 INFO L93 Difference]: Finished difference Result 1274 states and 1815 transitions. [2019-09-07 12:57:38,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 12:57:38,015 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-09-07 12:57:38,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:57:38,025 INFO L225 Difference]: With dead ends: 1274 [2019-09-07 12:57:38,025 INFO L226 Difference]: Without dead ends: 1015 [2019-09-07 12:57:38,028 INFO L628 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 [2019-09-07 12:57:38,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1015 states. [2019-09-07 12:57:38,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1015 to 872. [2019-09-07 12:57:38,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 872 states. [2019-09-07 12:57:38,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1238 transitions. [2019-09-07 12:57:38,082 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1238 transitions. Word has length 39 [2019-09-07 12:57:38,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:57:38,083 INFO L475 AbstractCegarLoop]: Abstraction has 872 states and 1238 transitions. [2019-09-07 12:57:38,083 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 12:57:38,083 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1238 transitions. [2019-09-07 12:57:38,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-09-07 12:57:38,087 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:57:38,087 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:57:38,087 INFO L418 AbstractCegarLoop]: === Iteration 8 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:57:38,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:57:38,088 INFO L82 PathProgramCache]: Analyzing trace with hash 2137693992, now seen corresponding path program 1 times [2019-09-07 12:57:38,088 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:57:38,088 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:57:38,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:57:38,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 12:57:38,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:57:38,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:57:38,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 12:57:38,172 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 12:57:38,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 12:57:38,172 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 12:57:38,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 12:57:38,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 12:57:38,173 INFO L87 Difference]: Start difference. First operand 872 states and 1238 transitions. Second operand 3 states. [2019-09-07 12:57:38,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:57:38,230 INFO L93 Difference]: Finished difference Result 972 states and 1362 transitions. [2019-09-07 12:57:38,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 12:57:38,231 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-09-07 12:57:38,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:57:38,244 INFO L225 Difference]: With dead ends: 972 [2019-09-07 12:57:38,244 INFO L226 Difference]: Without dead ends: 954 [2019-09-07 12:57:38,245 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 12:57:38,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 954 states. [2019-09-07 12:57:38,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 954 to 892. [2019-09-07 12:57:38,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 892 states. [2019-09-07 12:57:38,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 892 states to 892 states and 1264 transitions. [2019-09-07 12:57:38,299 INFO L78 Accepts]: Start accepts. Automaton has 892 states and 1264 transitions. Word has length 40 [2019-09-07 12:57:38,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:57:38,301 INFO L475 AbstractCegarLoop]: Abstraction has 892 states and 1264 transitions. [2019-09-07 12:57:38,301 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 12:57:38,301 INFO L276 IsEmpty]: Start isEmpty. Operand 892 states and 1264 transitions. [2019-09-07 12:57:38,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-09-07 12:57:38,305 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:57:38,305 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:57:38,306 INFO L418 AbstractCegarLoop]: === Iteration 9 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:57:38,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:57:38,306 INFO L82 PathProgramCache]: Analyzing trace with hash -1915119306, now seen corresponding path program 1 times [2019-09-07 12:57:38,306 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:57:38,307 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:57:38,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:57:38,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 12:57:38,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:57:38,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:57:38,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 12:57:38,386 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 12:57:38,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 12:57:38,387 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 12:57:38,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 12:57:38,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 12:57:38,388 INFO L87 Difference]: Start difference. First operand 892 states and 1264 transitions. Second operand 3 states. [2019-09-07 12:57:38,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:57:38,448 INFO L93 Difference]: Finished difference Result 1167 states and 1639 transitions. [2019-09-07 12:57:38,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 12:57:38,449 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2019-09-07 12:57:38,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:57:38,456 INFO L225 Difference]: With dead ends: 1167 [2019-09-07 12:57:38,456 INFO L226 Difference]: Without dead ends: 925 [2019-09-07 12:57:38,486 INFO L628 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 [2019-09-07 12:57:38,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 925 states. [2019-09-07 12:57:38,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 925 to 892. [2019-09-07 12:57:38,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 892 states. [2019-09-07 12:57:38,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 892 states to 892 states and 1263 transitions. [2019-09-07 12:57:38,540 INFO L78 Accepts]: Start accepts. Automaton has 892 states and 1263 transitions. Word has length 46 [2019-09-07 12:57:38,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:57:38,541 INFO L475 AbstractCegarLoop]: Abstraction has 892 states and 1263 transitions. [2019-09-07 12:57:38,541 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 12:57:38,541 INFO L276 IsEmpty]: Start isEmpty. Operand 892 states and 1263 transitions. [2019-09-07 12:57:38,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-09-07 12:57:38,546 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:57:38,546 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:57:38,546 INFO L418 AbstractCegarLoop]: === Iteration 10 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:57:38,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:57:38,546 INFO L82 PathProgramCache]: Analyzing trace with hash 2102488102, now seen corresponding path program 1 times [2019-09-07 12:57:38,547 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:57:38,547 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:57:38,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:57:38,549 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 12:57:38,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:57:38,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:57:38,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 12:57:38,626 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 12:57:38,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 12:57:38,627 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 12:57:38,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 12:57:38,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-07 12:57:38,628 INFO L87 Difference]: Start difference. First operand 892 states and 1263 transitions. Second operand 4 states. [2019-09-07 12:57:39,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:57:39,003 INFO L93 Difference]: Finished difference Result 1014 states and 1409 transitions. [2019-09-07 12:57:39,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 12:57:39,004 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2019-09-07 12:57:39,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:57:39,009 INFO L225 Difference]: With dead ends: 1014 [2019-09-07 12:57:39,010 INFO L226 Difference]: Without dead ends: 785 [2019-09-07 12:57:39,011 INFO L628 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 [2019-09-07 12:57:39,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 785 states. [2019-09-07 12:57:39,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 785 to 751. [2019-09-07 12:57:39,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 751 states. [2019-09-07 12:57:39,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 751 states to 751 states and 1056 transitions. [2019-09-07 12:57:39,061 INFO L78 Accepts]: Start accepts. Automaton has 751 states and 1056 transitions. Word has length 47 [2019-09-07 12:57:39,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:57:39,061 INFO L475 AbstractCegarLoop]: Abstraction has 751 states and 1056 transitions. [2019-09-07 12:57:39,061 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 12:57:39,061 INFO L276 IsEmpty]: Start isEmpty. Operand 751 states and 1056 transitions. [2019-09-07 12:57:39,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-09-07 12:57:39,064 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:57:39,064 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:57:39,064 INFO L418 AbstractCegarLoop]: === Iteration 11 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:57:39,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:57:39,065 INFO L82 PathProgramCache]: Analyzing trace with hash -18672278, now seen corresponding path program 1 times [2019-09-07 12:57:39,065 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:57:39,065 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:57:39,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:57:39,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 12:57:39,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:57:39,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:57:39,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 12:57:39,115 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 12:57:39,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 12:57:39,115 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 12:57:39,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 12:57:39,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 12:57:39,116 INFO L87 Difference]: Start difference. First operand 751 states and 1056 transitions. Second operand 3 states. [2019-09-07 12:57:39,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:57:39,159 INFO L93 Difference]: Finished difference Result 871 states and 1204 transitions. [2019-09-07 12:57:39,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 12:57:39,159 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2019-09-07 12:57:39,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:57:39,164 INFO L225 Difference]: With dead ends: 871 [2019-09-07 12:57:39,164 INFO L226 Difference]: Without dead ends: 775 [2019-09-07 12:57:39,167 INFO L628 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 [2019-09-07 12:57:39,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 775 states. [2019-09-07 12:57:39,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 775 to 750. [2019-09-07 12:57:39,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 750 states. [2019-09-07 12:57:39,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 750 states to 750 states and 1051 transitions. [2019-09-07 12:57:39,208 INFO L78 Accepts]: Start accepts. Automaton has 750 states and 1051 transitions. Word has length 47 [2019-09-07 12:57:39,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:57:39,209 INFO L475 AbstractCegarLoop]: Abstraction has 750 states and 1051 transitions. [2019-09-07 12:57:39,209 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 12:57:39,209 INFO L276 IsEmpty]: Start isEmpty. Operand 750 states and 1051 transitions. [2019-09-07 12:57:39,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-09-07 12:57:39,212 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:57:39,212 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:57:39,212 INFO L418 AbstractCegarLoop]: === Iteration 12 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:57:39,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:57:39,212 INFO L82 PathProgramCache]: Analyzing trace with hash -753875003, now seen corresponding path program 1 times [2019-09-07 12:57:39,213 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:57:39,213 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:57:39,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:57:39,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 12:57:39,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:57:39,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:57:39,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 12:57:39,251 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 12:57:39,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 12:57:39,252 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 12:57:39,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 12:57:39,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 12:57:39,253 INFO L87 Difference]: Start difference. First operand 750 states and 1051 transitions. Second operand 3 states. [2019-09-07 12:57:39,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:57:39,399 INFO L93 Difference]: Finished difference Result 938 states and 1298 transitions. [2019-09-07 12:57:39,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 12:57:39,400 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2019-09-07 12:57:39,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:57:39,407 INFO L225 Difference]: With dead ends: 938 [2019-09-07 12:57:39,407 INFO L226 Difference]: Without dead ends: 928 [2019-09-07 12:57:39,409 INFO L628 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 [2019-09-07 12:57:39,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 928 states. [2019-09-07 12:57:39,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 928 to 825. [2019-09-07 12:57:39,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 825 states. [2019-09-07 12:57:39,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 825 states to 825 states and 1138 transitions. [2019-09-07 12:57:39,523 INFO L78 Accepts]: Start accepts. Automaton has 825 states and 1138 transitions. Word has length 48 [2019-09-07 12:57:39,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:57:39,523 INFO L475 AbstractCegarLoop]: Abstraction has 825 states and 1138 transitions. [2019-09-07 12:57:39,523 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 12:57:39,524 INFO L276 IsEmpty]: Start isEmpty. Operand 825 states and 1138 transitions. [2019-09-07 12:57:39,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-09-07 12:57:39,527 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:57:39,527 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:57:39,527 INFO L418 AbstractCegarLoop]: === Iteration 13 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:57:39,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:57:39,528 INFO L82 PathProgramCache]: Analyzing trace with hash -1451417877, now seen corresponding path program 1 times [2019-09-07 12:57:39,528 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:57:39,528 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:57:39,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:57:39,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 12:57:39,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:57:39,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:57:39,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 12:57:39,598 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 12:57:39,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-07 12:57:39,599 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-07 12:57:39,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-07 12:57:39,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-07 12:57:39,600 INFO L87 Difference]: Start difference. First operand 825 states and 1138 transitions. Second operand 8 states. [2019-09-07 12:57:39,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:57:39,767 INFO L93 Difference]: Finished difference Result 851 states and 1172 transitions. [2019-09-07 12:57:39,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-07 12:57:39,768 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 49 [2019-09-07 12:57:39,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:57:39,773 INFO L225 Difference]: With dead ends: 851 [2019-09-07 12:57:39,773 INFO L226 Difference]: Without dead ends: 847 [2019-09-07 12:57:39,774 INFO L628 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 [2019-09-07 12:57:39,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 847 states. [2019-09-07 12:57:39,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 847 to 844. [2019-09-07 12:57:39,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 844 states. [2019-09-07 12:57:39,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 844 states to 844 states and 1165 transitions. [2019-09-07 12:57:39,833 INFO L78 Accepts]: Start accepts. Automaton has 844 states and 1165 transitions. Word has length 49 [2019-09-07 12:57:39,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:57:39,834 INFO L475 AbstractCegarLoop]: Abstraction has 844 states and 1165 transitions. [2019-09-07 12:57:39,834 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-07 12:57:39,834 INFO L276 IsEmpty]: Start isEmpty. Operand 844 states and 1165 transitions. [2019-09-07 12:57:39,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-09-07 12:57:39,837 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:57:39,838 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:57:39,838 INFO L418 AbstractCegarLoop]: === Iteration 14 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:57:39,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:57:39,838 INFO L82 PathProgramCache]: Analyzing trace with hash -1451694707, now seen corresponding path program 1 times [2019-09-07 12:57:39,838 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:57:39,839 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:57:39,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:57:39,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 12:57:39,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:57:39,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:57:39,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 12:57:39,905 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 12:57:39,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-07 12:57:39,906 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-07 12:57:39,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-07 12:57:39,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-07 12:57:39,906 INFO L87 Difference]: Start difference. First operand 844 states and 1165 transitions. Second operand 8 states. [2019-09-07 12:57:40,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:57:40,032 INFO L93 Difference]: Finished difference Result 886 states and 1217 transitions. [2019-09-07 12:57:40,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-07 12:57:40,033 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 49 [2019-09-07 12:57:40,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:57:40,038 INFO L225 Difference]: With dead ends: 886 [2019-09-07 12:57:40,038 INFO L226 Difference]: Without dead ends: 865 [2019-09-07 12:57:40,040 INFO L628 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 [2019-09-07 12:57:40,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 865 states. [2019-09-07 12:57:40,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 865 to 864. [2019-09-07 12:57:40,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 864 states. [2019-09-07 12:57:40,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 864 states to 864 states and 1189 transitions. [2019-09-07 12:57:40,107 INFO L78 Accepts]: Start accepts. Automaton has 864 states and 1189 transitions. Word has length 49 [2019-09-07 12:57:40,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:57:40,107 INFO L475 AbstractCegarLoop]: Abstraction has 864 states and 1189 transitions. [2019-09-07 12:57:40,107 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-07 12:57:40,107 INFO L276 IsEmpty]: Start isEmpty. Operand 864 states and 1189 transitions. [2019-09-07 12:57:40,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-09-07 12:57:40,111 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:57:40,111 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:57:40,111 INFO L418 AbstractCegarLoop]: === Iteration 15 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:57:40,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:57:40,112 INFO L82 PathProgramCache]: Analyzing trace with hash 1035590368, now seen corresponding path program 1 times [2019-09-07 12:57:40,112 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:57:40,112 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:57:40,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:57:40,114 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 12:57:40,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:57:40,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:57:40,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 12:57:40,153 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 12:57:40,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 12:57:40,153 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 12:57:40,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 12:57:40,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 12:57:40,154 INFO L87 Difference]: Start difference. First operand 864 states and 1189 transitions. Second operand 3 states. [2019-09-07 12:57:40,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:57:40,273 INFO L93 Difference]: Finished difference Result 1081 states and 1472 transitions. [2019-09-07 12:57:40,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 12:57:40,273 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-09-07 12:57:40,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:57:40,279 INFO L225 Difference]: With dead ends: 1081 [2019-09-07 12:57:40,280 INFO L226 Difference]: Without dead ends: 1049 [2019-09-07 12:57:40,282 INFO L628 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 [2019-09-07 12:57:40,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1049 states. [2019-09-07 12:57:40,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1049 to 944. [2019-09-07 12:57:40,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 944 states. [2019-09-07 12:57:40,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 944 states to 944 states and 1281 transitions. [2019-09-07 12:57:40,341 INFO L78 Accepts]: Start accepts. Automaton has 944 states and 1281 transitions. Word has length 50 [2019-09-07 12:57:40,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:57:40,341 INFO L475 AbstractCegarLoop]: Abstraction has 944 states and 1281 transitions. [2019-09-07 12:57:40,341 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 12:57:40,342 INFO L276 IsEmpty]: Start isEmpty. Operand 944 states and 1281 transitions. [2019-09-07 12:57:40,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-09-07 12:57:40,345 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:57:40,345 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:57:40,346 INFO L418 AbstractCegarLoop]: === Iteration 16 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:57:40,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:57:40,346 INFO L82 PathProgramCache]: Analyzing trace with hash -1411925024, now seen corresponding path program 1 times [2019-09-07 12:57:40,346 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:57:40,347 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:57:40,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:57:40,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 12:57:40,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:57:40,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:57:40,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 12:57:40,398 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 12:57:40,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 12:57:40,399 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 12:57:40,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 12:57:40,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-07 12:57:40,400 INFO L87 Difference]: Start difference. First operand 944 states and 1281 transitions. Second operand 4 states. [2019-09-07 12:57:40,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:57:40,485 INFO L93 Difference]: Finished difference Result 966 states and 1303 transitions. [2019-09-07 12:57:40,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 12:57:40,485 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2019-09-07 12:57:40,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:57:40,492 INFO L225 Difference]: With dead ends: 966 [2019-09-07 12:57:40,492 INFO L226 Difference]: Without dead ends: 944 [2019-09-07 12:57:40,494 INFO L628 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 [2019-09-07 12:57:40,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 944 states. [2019-09-07 12:57:40,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 944 to 944. [2019-09-07 12:57:40,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 944 states. [2019-09-07 12:57:40,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 944 states to 944 states and 1280 transitions. [2019-09-07 12:57:40,627 INFO L78 Accepts]: Start accepts. Automaton has 944 states and 1280 transitions. Word has length 50 [2019-09-07 12:57:40,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:57:40,627 INFO L475 AbstractCegarLoop]: Abstraction has 944 states and 1280 transitions. [2019-09-07 12:57:40,627 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 12:57:40,627 INFO L276 IsEmpty]: Start isEmpty. Operand 944 states and 1280 transitions. [2019-09-07 12:57:40,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-09-07 12:57:40,631 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:57:40,631 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:57:40,631 INFO L418 AbstractCegarLoop]: === Iteration 17 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:57:40,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:57:40,632 INFO L82 PathProgramCache]: Analyzing trace with hash 888897566, now seen corresponding path program 1 times [2019-09-07 12:57:40,632 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:57:40,632 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:57:40,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:57:40,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 12:57:40,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:57:40,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:57:40,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 12:57:40,722 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 12:57:40,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-07 12:57:40,723 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-07 12:57:40,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-07 12:57:40,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-07 12:57:40,723 INFO L87 Difference]: Start difference. First operand 944 states and 1280 transitions. Second operand 7 states. [2019-09-07 12:57:41,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:57:41,856 INFO L93 Difference]: Finished difference Result 1110 states and 1554 transitions. [2019-09-07 12:57:41,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-07 12:57:41,857 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 50 [2019-09-07 12:57:41,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:57:41,864 INFO L225 Difference]: With dead ends: 1110 [2019-09-07 12:57:41,865 INFO L226 Difference]: Without dead ends: 1016 [2019-09-07 12:57:41,866 INFO L628 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 [2019-09-07 12:57:41,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1016 states. [2019-09-07 12:57:41,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1016 to 875. [2019-09-07 12:57:41,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 875 states. [2019-09-07 12:57:41,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 875 states to 875 states and 1181 transitions. [2019-09-07 12:57:41,930 INFO L78 Accepts]: Start accepts. Automaton has 875 states and 1181 transitions. Word has length 50 [2019-09-07 12:57:41,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:57:41,930 INFO L475 AbstractCegarLoop]: Abstraction has 875 states and 1181 transitions. [2019-09-07 12:57:41,930 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-07 12:57:41,930 INFO L276 IsEmpty]: Start isEmpty. Operand 875 states and 1181 transitions. [2019-09-07 12:57:41,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-09-07 12:57:41,933 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:57:41,933 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:57:41,934 INFO L418 AbstractCegarLoop]: === Iteration 18 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:57:41,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:57:41,934 INFO L82 PathProgramCache]: Analyzing trace with hash -200005759, now seen corresponding path program 1 times [2019-09-07 12:57:41,934 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:57:41,935 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:57:41,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:57:41,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 12:57:41,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:57:41,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:57:42,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 12:57:42,050 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 12:57:42,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 12:57:42,051 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 12:57:42,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 12:57:42,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 12:57:42,053 INFO L87 Difference]: Start difference. First operand 875 states and 1181 transitions. Second operand 5 states. [2019-09-07 12:57:42,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:57:42,782 INFO L93 Difference]: Finished difference Result 990 states and 1341 transitions. [2019-09-07 12:57:42,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-07 12:57:42,783 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2019-09-07 12:57:42,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:57:42,790 INFO L225 Difference]: With dead ends: 990 [2019-09-07 12:57:42,791 INFO L226 Difference]: Without dead ends: 980 [2019-09-07 12:57:42,792 INFO L628 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 [2019-09-07 12:57:42,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 980 states. [2019-09-07 12:57:42,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 980 to 875. [2019-09-07 12:57:42,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 875 states. [2019-09-07 12:57:42,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 875 states to 875 states and 1179 transitions. [2019-09-07 12:57:42,854 INFO L78 Accepts]: Start accepts. Automaton has 875 states and 1179 transitions. Word has length 50 [2019-09-07 12:57:42,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:57:42,855 INFO L475 AbstractCegarLoop]: Abstraction has 875 states and 1179 transitions. [2019-09-07 12:57:42,855 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 12:57:42,855 INFO L276 IsEmpty]: Start isEmpty. Operand 875 states and 1179 transitions. [2019-09-07 12:57:42,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-09-07 12:57:42,862 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:57:42,862 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:57:42,863 INFO L418 AbstractCegarLoop]: === Iteration 19 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:57:42,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:57:42,863 INFO L82 PathProgramCache]: Analyzing trace with hash -1728648689, now seen corresponding path program 1 times [2019-09-07 12:57:42,863 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:57:42,863 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:57:42,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:57:42,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 12:57:42,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:57:42,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:57:42,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 12:57:42,908 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 12:57:42,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 12:57:42,909 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 12:57:42,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 12:57:42,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 12:57:42,910 INFO L87 Difference]: Start difference. First operand 875 states and 1179 transitions. Second operand 3 states. [2019-09-07 12:57:42,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:57:42,998 INFO L93 Difference]: Finished difference Result 900 states and 1207 transitions. [2019-09-07 12:57:42,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 12:57:42,999 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-09-07 12:57:42,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:57:43,003 INFO L225 Difference]: With dead ends: 900 [2019-09-07 12:57:43,004 INFO L226 Difference]: Without dead ends: 895 [2019-09-07 12:57:43,005 INFO L628 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 [2019-09-07 12:57:43,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 895 states. [2019-09-07 12:57:43,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 895 to 891. [2019-09-07 12:57:43,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 891 states. [2019-09-07 12:57:43,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 891 states to 891 states and 1198 transitions. [2019-09-07 12:57:43,063 INFO L78 Accepts]: Start accepts. Automaton has 891 states and 1198 transitions. Word has length 52 [2019-09-07 12:57:43,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:57:43,063 INFO L475 AbstractCegarLoop]: Abstraction has 891 states and 1198 transitions. [2019-09-07 12:57:43,063 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 12:57:43,064 INFO L276 IsEmpty]: Start isEmpty. Operand 891 states and 1198 transitions. [2019-09-07 12:57:43,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-09-07 12:57:43,069 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:57:43,070 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:57:43,070 INFO L418 AbstractCegarLoop]: === Iteration 20 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:57:43,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:57:43,070 INFO L82 PathProgramCache]: Analyzing trace with hash 2025775123, now seen corresponding path program 1 times [2019-09-07 12:57:43,070 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:57:43,070 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:57:43,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:57:43,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 12:57:43,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:57:43,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:57:43,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 12:57:43,109 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 12:57:43,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 12:57:43,110 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 12:57:43,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 12:57:43,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 12:57:43,111 INFO L87 Difference]: Start difference. First operand 891 states and 1198 transitions. Second operand 3 states. [2019-09-07 12:57:43,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:57:43,197 INFO L93 Difference]: Finished difference Result 1104 states and 1482 transitions. [2019-09-07 12:57:43,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 12:57:43,197 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-09-07 12:57:43,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:57:43,202 INFO L225 Difference]: With dead ends: 1104 [2019-09-07 12:57:43,202 INFO L226 Difference]: Without dead ends: 863 [2019-09-07 12:57:43,204 INFO L628 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 [2019-09-07 12:57:43,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 863 states. [2019-09-07 12:57:43,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 863 to 863. [2019-09-07 12:57:43,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 863 states. [2019-09-07 12:57:43,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 863 states to 863 states and 1161 transitions. [2019-09-07 12:57:43,266 INFO L78 Accepts]: Start accepts. Automaton has 863 states and 1161 transitions. Word has length 54 [2019-09-07 12:57:43,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:57:43,267 INFO L475 AbstractCegarLoop]: Abstraction has 863 states and 1161 transitions. [2019-09-07 12:57:43,267 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 12:57:43,267 INFO L276 IsEmpty]: Start isEmpty. Operand 863 states and 1161 transitions. [2019-09-07 12:57:43,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-09-07 12:57:43,270 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:57:43,271 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:57:43,271 INFO L418 AbstractCegarLoop]: === Iteration 21 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:57:43,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:57:43,271 INFO L82 PathProgramCache]: Analyzing trace with hash 1757740470, now seen corresponding path program 1 times [2019-09-07 12:57:43,271 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:57:43,272 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:57:43,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:57:43,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 12:57:43,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:57:43,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:57:43,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 12:57:43,330 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 12:57:43,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 12:57:43,330 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 12:57:43,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 12:57:43,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 12:57:43,331 INFO L87 Difference]: Start difference. First operand 863 states and 1161 transitions. Second operand 5 states. [2019-09-07 12:57:44,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:57:44,004 INFO L93 Difference]: Finished difference Result 970 states and 1312 transitions. [2019-09-07 12:57:44,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-07 12:57:44,005 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2019-09-07 12:57:44,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:57:44,010 INFO L225 Difference]: With dead ends: 970 [2019-09-07 12:57:44,010 INFO L226 Difference]: Without dead ends: 949 [2019-09-07 12:57:44,011 INFO L628 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 [2019-09-07 12:57:44,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 949 states. [2019-09-07 12:57:44,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 949 to 850. [2019-09-07 12:57:44,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 850 states. [2019-09-07 12:57:44,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 850 states to 850 states and 1144 transitions. [2019-09-07 12:57:44,060 INFO L78 Accepts]: Start accepts. Automaton has 850 states and 1144 transitions. Word has length 51 [2019-09-07 12:57:44,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:57:44,060 INFO L475 AbstractCegarLoop]: Abstraction has 850 states and 1144 transitions. [2019-09-07 12:57:44,060 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 12:57:44,060 INFO L276 IsEmpty]: Start isEmpty. Operand 850 states and 1144 transitions. [2019-09-07 12:57:44,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-09-07 12:57:44,063 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:57:44,063 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:57:44,064 INFO L418 AbstractCegarLoop]: === Iteration 22 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:57:44,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:57:44,064 INFO L82 PathProgramCache]: Analyzing trace with hash -1604907901, now seen corresponding path program 1 times [2019-09-07 12:57:44,064 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:57:44,064 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:57:44,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:57:44,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 12:57:44,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:57:44,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:57:44,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 12:57:44,139 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 12:57:44,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 12:57:44,139 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 12:57:44,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 12:57:44,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-07 12:57:44,140 INFO L87 Difference]: Start difference. First operand 850 states and 1144 transitions. Second operand 4 states. [2019-09-07 12:57:44,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:57:44,326 INFO L93 Difference]: Finished difference Result 889 states and 1186 transitions. [2019-09-07 12:57:44,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 12:57:44,328 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2019-09-07 12:57:44,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:57:44,333 INFO L225 Difference]: With dead ends: 889 [2019-09-07 12:57:44,334 INFO L226 Difference]: Without dead ends: 857 [2019-09-07 12:57:44,335 INFO L628 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 [2019-09-07 12:57:44,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 857 states. [2019-09-07 12:57:44,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 857 to 852. [2019-09-07 12:57:44,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 852 states. [2019-09-07 12:57:44,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 852 states to 852 states and 1146 transitions. [2019-09-07 12:57:44,400 INFO L78 Accepts]: Start accepts. Automaton has 852 states and 1146 transitions. Word has length 53 [2019-09-07 12:57:44,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:57:44,401 INFO L475 AbstractCegarLoop]: Abstraction has 852 states and 1146 transitions. [2019-09-07 12:57:44,401 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 12:57:44,401 INFO L276 IsEmpty]: Start isEmpty. Operand 852 states and 1146 transitions. [2019-09-07 12:57:44,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-09-07 12:57:44,404 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:57:44,404 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:57:44,404 INFO L418 AbstractCegarLoop]: === Iteration 23 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:57:44,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:57:44,405 INFO L82 PathProgramCache]: Analyzing trace with hash -1542868287, now seen corresponding path program 1 times [2019-09-07 12:57:44,405 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:57:44,405 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:57:44,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:57:44,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 12:57:44,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:57:44,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:57:44,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 12:57:44,463 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 12:57:44,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 12:57:44,463 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 12:57:44,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 12:57:44,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 12:57:44,464 INFO L87 Difference]: Start difference. First operand 852 states and 1146 transitions. Second operand 5 states. [2019-09-07 12:57:44,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:57:44,995 INFO L93 Difference]: Finished difference Result 862 states and 1154 transitions. [2019-09-07 12:57:44,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-07 12:57:44,995 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2019-09-07 12:57:44,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:57:45,000 INFO L225 Difference]: With dead ends: 862 [2019-09-07 12:57:45,001 INFO L226 Difference]: Without dead ends: 856 [2019-09-07 12:57:45,001 INFO L628 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 [2019-09-07 12:57:45,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 856 states. [2019-09-07 12:57:45,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 856 to 852. [2019-09-07 12:57:45,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 852 states. [2019-09-07 12:57:45,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 852 states to 852 states and 1145 transitions. [2019-09-07 12:57:45,085 INFO L78 Accepts]: Start accepts. Automaton has 852 states and 1145 transitions. Word has length 53 [2019-09-07 12:57:45,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:57:45,085 INFO L475 AbstractCegarLoop]: Abstraction has 852 states and 1145 transitions. [2019-09-07 12:57:45,086 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 12:57:45,086 INFO L276 IsEmpty]: Start isEmpty. Operand 852 states and 1145 transitions. [2019-09-07 12:57:45,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-09-07 12:57:45,088 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:57:45,089 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:57:45,089 INFO L418 AbstractCegarLoop]: === Iteration 24 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:57:45,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:57:45,089 INFO L82 PathProgramCache]: Analyzing trace with hash -1530606906, now seen corresponding path program 1 times [2019-09-07 12:57:45,089 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:57:45,090 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:57:45,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:57:45,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 12:57:45,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:57:45,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:57:45,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 12:57:45,134 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 12:57:45,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 12:57:45,135 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 12:57:45,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 12:57:45,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 12:57:45,136 INFO L87 Difference]: Start difference. First operand 852 states and 1145 transitions. Second operand 5 states. [2019-09-07 12:57:45,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:57:45,671 INFO L93 Difference]: Finished difference Result 862 states and 1153 transitions. [2019-09-07 12:57:45,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-07 12:57:45,672 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2019-09-07 12:57:45,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:57:45,676 INFO L225 Difference]: With dead ends: 862 [2019-09-07 12:57:45,677 INFO L226 Difference]: Without dead ends: 826 [2019-09-07 12:57:45,678 INFO L628 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 [2019-09-07 12:57:45,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 826 states. [2019-09-07 12:57:45,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 826 to 820. [2019-09-07 12:57:45,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 820 states. [2019-09-07 12:57:45,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 820 states to 820 states and 1108 transitions. [2019-09-07 12:57:45,723 INFO L78 Accepts]: Start accepts. Automaton has 820 states and 1108 transitions. Word has length 52 [2019-09-07 12:57:45,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:57:45,723 INFO L475 AbstractCegarLoop]: Abstraction has 820 states and 1108 transitions. [2019-09-07 12:57:45,724 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 12:57:45,724 INFO L276 IsEmpty]: Start isEmpty. Operand 820 states and 1108 transitions. [2019-09-07 12:57:45,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-09-07 12:57:45,726 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:57:45,726 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:57:45,727 INFO L418 AbstractCegarLoop]: === Iteration 25 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:57:45,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:57:45,727 INFO L82 PathProgramCache]: Analyzing trace with hash 1041344956, now seen corresponding path program 1 times [2019-09-07 12:57:45,727 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:57:45,727 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:57:45,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:57:45,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 12:57:45,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:57:45,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:57:45,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 12:57:45,810 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 12:57:45,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-07 12:57:45,810 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 12:57:45,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 12:57:45,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-07 12:57:45,811 INFO L87 Difference]: Start difference. First operand 820 states and 1108 transitions. Second operand 9 states. [2019-09-07 12:57:47,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:57:47,649 INFO L93 Difference]: Finished difference Result 1131 states and 1562 transitions. [2019-09-07 12:57:47,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-07 12:57:47,650 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2019-09-07 12:57:47,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:57:47,658 INFO L225 Difference]: With dead ends: 1131 [2019-09-07 12:57:47,658 INFO L226 Difference]: Without dead ends: 1081 [2019-09-07 12:57:47,659 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2019-09-07 12:57:47,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1081 states. [2019-09-07 12:57:47,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1081 to 847. [2019-09-07 12:57:47,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 847 states. [2019-09-07 12:57:47,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 847 states to 847 states and 1151 transitions. [2019-09-07 12:57:47,734 INFO L78 Accepts]: Start accepts. Automaton has 847 states and 1151 transitions. Word has length 54 [2019-09-07 12:57:47,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:57:47,734 INFO L475 AbstractCegarLoop]: Abstraction has 847 states and 1151 transitions. [2019-09-07 12:57:47,734 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 12:57:47,735 INFO L276 IsEmpty]: Start isEmpty. Operand 847 states and 1151 transitions. [2019-09-07 12:57:47,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-07 12:57:47,738 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:57:47,738 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:57:47,739 INFO L418 AbstractCegarLoop]: === Iteration 26 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:57:47,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:57:47,739 INFO L82 PathProgramCache]: Analyzing trace with hash 1261798154, now seen corresponding path program 1 times [2019-09-07 12:57:47,740 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:57:47,740 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:57:47,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:57:47,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 12:57:47,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:57:47,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:57:47,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 12:57:47,842 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 12:57:47,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-07 12:57:47,843 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 12:57:47,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 12:57:47,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-07 12:57:47,843 INFO L87 Difference]: Start difference. First operand 847 states and 1151 transitions. Second operand 9 states. [2019-09-07 12:57:48,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:57:48,045 INFO L93 Difference]: Finished difference Result 874 states and 1181 transitions. [2019-09-07 12:57:48,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-07 12:57:48,045 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 55 [2019-09-07 12:57:48,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:57:48,050 INFO L225 Difference]: With dead ends: 874 [2019-09-07 12:57:48,050 INFO L226 Difference]: Without dead ends: 836 [2019-09-07 12:57:48,051 INFO L628 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 [2019-09-07 12:57:48,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 836 states. [2019-09-07 12:57:48,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 836 to 836. [2019-09-07 12:57:48,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 836 states. [2019-09-07 12:57:48,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 836 states to 836 states and 1125 transitions. [2019-09-07 12:57:48,099 INFO L78 Accepts]: Start accepts. Automaton has 836 states and 1125 transitions. Word has length 55 [2019-09-07 12:57:48,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:57:48,100 INFO L475 AbstractCegarLoop]: Abstraction has 836 states and 1125 transitions. [2019-09-07 12:57:48,100 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 12:57:48,100 INFO L276 IsEmpty]: Start isEmpty. Operand 836 states and 1125 transitions. [2019-09-07 12:57:48,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-07 12:57:48,103 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:57:48,103 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:57:48,103 INFO L418 AbstractCegarLoop]: === Iteration 27 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:57:48,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:57:48,103 INFO L82 PathProgramCache]: Analyzing trace with hash 41202246, now seen corresponding path program 1 times [2019-09-07 12:57:48,104 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:57:48,104 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:57:48,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:57:48,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 12:57:48,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:57:48,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:57:48,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 12:57:48,242 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 12:57:48,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-07 12:57:48,243 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-07 12:57:48,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-07 12:57:48,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-07 12:57:48,244 INFO L87 Difference]: Start difference. First operand 836 states and 1125 transitions. Second operand 10 states. [2019-09-07 12:57:48,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:57:48,527 INFO L93 Difference]: Finished difference Result 852 states and 1142 transitions. [2019-09-07 12:57:48,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-07 12:57:48,528 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 56 [2019-09-07 12:57:48,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:57:48,532 INFO L225 Difference]: With dead ends: 852 [2019-09-07 12:57:48,532 INFO L226 Difference]: Without dead ends: 834 [2019-09-07 12:57:48,533 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-09-07 12:57:48,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 834 states. [2019-09-07 12:57:48,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 834 to 834. [2019-09-07 12:57:48,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 834 states. [2019-09-07 12:57:48,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 834 states to 834 states and 1121 transitions. [2019-09-07 12:57:48,584 INFO L78 Accepts]: Start accepts. Automaton has 834 states and 1121 transitions. Word has length 56 [2019-09-07 12:57:48,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:57:48,584 INFO L475 AbstractCegarLoop]: Abstraction has 834 states and 1121 transitions. [2019-09-07 12:57:48,585 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-07 12:57:48,585 INFO L276 IsEmpty]: Start isEmpty. Operand 834 states and 1121 transitions. [2019-09-07 12:57:48,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-07 12:57:48,587 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:57:48,588 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:57:48,588 INFO L418 AbstractCegarLoop]: === Iteration 28 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:57:48,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:57:48,588 INFO L82 PathProgramCache]: Analyzing trace with hash 1300823154, now seen corresponding path program 1 times [2019-09-07 12:57:48,588 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:57:48,588 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:57:48,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:57:48,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 12:57:48,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:57:48,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:57:48,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 12:57:48,740 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 12:57:48,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-07 12:57:48,740 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-07 12:57:48,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-07 12:57:48,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-07 12:57:48,741 INFO L87 Difference]: Start difference. First operand 834 states and 1121 transitions. Second operand 10 states. [2019-09-07 12:57:48,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:57:48,980 INFO L93 Difference]: Finished difference Result 847 states and 1135 transitions. [2019-09-07 12:57:48,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-07 12:57:48,981 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 55 [2019-09-07 12:57:48,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:57:48,985 INFO L225 Difference]: With dead ends: 847 [2019-09-07 12:57:48,986 INFO L226 Difference]: Without dead ends: 829 [2019-09-07 12:57:48,986 INFO L628 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 [2019-09-07 12:57:48,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 829 states. [2019-09-07 12:57:49,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 829 to 829. [2019-09-07 12:57:49,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 829 states. [2019-09-07 12:57:49,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 829 states to 829 states and 1114 transitions. [2019-09-07 12:57:49,076 INFO L78 Accepts]: Start accepts. Automaton has 829 states and 1114 transitions. Word has length 55 [2019-09-07 12:57:49,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:57:49,076 INFO L475 AbstractCegarLoop]: Abstraction has 829 states and 1114 transitions. [2019-09-07 12:57:49,076 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-07 12:57:49,076 INFO L276 IsEmpty]: Start isEmpty. Operand 829 states and 1114 transitions. [2019-09-07 12:57:49,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-07 12:57:49,079 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:57:49,080 INFO L399 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] [2019-09-07 12:57:49,080 INFO L418 AbstractCegarLoop]: === Iteration 29 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:57:49,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:57:49,080 INFO L82 PathProgramCache]: Analyzing trace with hash -498198185, now seen corresponding path program 1 times [2019-09-07 12:57:49,081 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:57:49,081 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:57:49,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:57:49,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 12:57:49,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:57:49,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:57:49,135 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 12:57:49,135 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 12:57:49,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 12:57:49,136 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 12:57:49,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 12:57:49,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 12:57:49,137 INFO L87 Difference]: Start difference. First operand 829 states and 1114 transitions. Second operand 3 states. [2019-09-07 12:57:49,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:57:49,212 INFO L93 Difference]: Finished difference Result 1082 states and 1448 transitions. [2019-09-07 12:57:49,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 12:57:49,213 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2019-09-07 12:57:49,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:57:49,219 INFO L225 Difference]: With dead ends: 1082 [2019-09-07 12:57:49,219 INFO L226 Difference]: Without dead ends: 919 [2019-09-07 12:57:49,220 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 12:57:49,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 919 states. [2019-09-07 12:57:49,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 919 to 888. [2019-09-07 12:57:49,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 888 states. [2019-09-07 12:57:49,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 888 states to 888 states and 1190 transitions. [2019-09-07 12:57:49,288 INFO L78 Accepts]: Start accepts. Automaton has 888 states and 1190 transitions. Word has length 74 [2019-09-07 12:57:49,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:57:49,288 INFO L475 AbstractCegarLoop]: Abstraction has 888 states and 1190 transitions. [2019-09-07 12:57:49,288 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 12:57:49,288 INFO L276 IsEmpty]: Start isEmpty. Operand 888 states and 1190 transitions. [2019-09-07 12:57:49,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-07 12:57:49,291 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:57:49,291 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:57:49,292 INFO L418 AbstractCegarLoop]: === Iteration 30 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:57:49,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:57:49,292 INFO L82 PathProgramCache]: Analyzing trace with hash 907015974, now seen corresponding path program 1 times [2019-09-07 12:57:49,292 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:57:49,292 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:57:49,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:57:49,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 12:57:49,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:57:49,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:57:49,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 12:57:49,456 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 12:57:49,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-07 12:57:49,457 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-07 12:57:49,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-07 12:57:49,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-09-07 12:57:49,458 INFO L87 Difference]: Start difference. First operand 888 states and 1190 transitions. Second operand 11 states. [2019-09-07 12:57:49,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:57:49,724 INFO L93 Difference]: Finished difference Result 905 states and 1208 transitions. [2019-09-07 12:57:49,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-07 12:57:49,725 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 58 [2019-09-07 12:57:49,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:57:49,735 INFO L225 Difference]: With dead ends: 905 [2019-09-07 12:57:49,736 INFO L226 Difference]: Without dead ends: 885 [2019-09-07 12:57:49,737 INFO L628 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 [2019-09-07 12:57:49,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 885 states. [2019-09-07 12:57:49,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 885 to 885. [2019-09-07 12:57:49,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 885 states. [2019-09-07 12:57:49,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 885 states to 885 states and 1185 transitions. [2019-09-07 12:57:49,786 INFO L78 Accepts]: Start accepts. Automaton has 885 states and 1185 transitions. Word has length 58 [2019-09-07 12:57:49,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:57:49,786 INFO L475 AbstractCegarLoop]: Abstraction has 885 states and 1185 transitions. [2019-09-07 12:57:49,787 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-07 12:57:49,787 INFO L276 IsEmpty]: Start isEmpty. Operand 885 states and 1185 transitions. [2019-09-07 12:57:49,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-07 12:57:49,789 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:57:49,789 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:57:49,790 INFO L418 AbstractCegarLoop]: === Iteration 31 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:57:49,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:57:49,790 INFO L82 PathProgramCache]: Analyzing trace with hash -967621732, now seen corresponding path program 1 times [2019-09-07 12:57:49,790 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:57:49,791 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:57:49,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:57:49,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 12:57:49,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:57:49,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:57:49,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 12:57:49,926 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 12:57:49,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-07 12:57:49,926 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-07 12:57:49,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-07 12:57:49,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-09-07 12:57:49,927 INFO L87 Difference]: Start difference. First operand 885 states and 1185 transitions. Second operand 12 states. [2019-09-07 12:57:50,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:57:50,202 INFO L93 Difference]: Finished difference Result 911 states and 1213 transitions. [2019-09-07 12:57:50,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-07 12:57:50,203 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 62 [2019-09-07 12:57:50,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:57:50,207 INFO L225 Difference]: With dead ends: 911 [2019-09-07 12:57:50,207 INFO L226 Difference]: Without dead ends: 887 [2019-09-07 12:57:50,208 INFO L628 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 [2019-09-07 12:57:50,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 887 states. [2019-09-07 12:57:50,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 887 to 883. [2019-09-07 12:57:50,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 883 states. [2019-09-07 12:57:50,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 883 states to 883 states and 1181 transitions. [2019-09-07 12:57:50,258 INFO L78 Accepts]: Start accepts. Automaton has 883 states and 1181 transitions. Word has length 62 [2019-09-07 12:57:50,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:57:50,258 INFO L475 AbstractCegarLoop]: Abstraction has 883 states and 1181 transitions. [2019-09-07 12:57:50,258 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-07 12:57:50,258 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 1181 transitions. [2019-09-07 12:57:50,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-09-07 12:57:50,261 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:57:50,261 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:57:50,262 INFO L418 AbstractCegarLoop]: === Iteration 32 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:57:50,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:57:50,262 INFO L82 PathProgramCache]: Analyzing trace with hash 771734352, now seen corresponding path program 1 times [2019-09-07 12:57:50,262 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:57:50,262 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:57:50,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:57:50,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 12:57:50,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:57:50,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:57:50,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 12:57:50,390 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 12:57:50,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-07 12:57:50,390 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-07 12:57:50,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-07 12:57:50,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-09-07 12:57:50,391 INFO L87 Difference]: Start difference. First operand 883 states and 1181 transitions. Second operand 12 states. [2019-09-07 12:57:50,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:57:50,647 INFO L93 Difference]: Finished difference Result 909 states and 1209 transitions. [2019-09-07 12:57:50,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-07 12:57:50,648 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 59 [2019-09-07 12:57:50,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:57:50,651 INFO L225 Difference]: With dead ends: 909 [2019-09-07 12:57:50,652 INFO L226 Difference]: Without dead ends: 884 [2019-09-07 12:57:50,653 INFO L628 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 [2019-09-07 12:57:50,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 884 states. [2019-09-07 12:57:50,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 884 to 882. [2019-09-07 12:57:50,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 882 states. [2019-09-07 12:57:50,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 882 states to 882 states and 1170 transitions. [2019-09-07 12:57:50,704 INFO L78 Accepts]: Start accepts. Automaton has 882 states and 1170 transitions. Word has length 59 [2019-09-07 12:57:50,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:57:50,704 INFO L475 AbstractCegarLoop]: Abstraction has 882 states and 1170 transitions. [2019-09-07 12:57:50,704 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-07 12:57:50,704 INFO L276 IsEmpty]: Start isEmpty. Operand 882 states and 1170 transitions. [2019-09-07 12:57:50,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-09-07 12:57:50,707 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:57:50,707 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:57:50,707 INFO L418 AbstractCegarLoop]: === Iteration 33 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:57:50,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:57:50,707 INFO L82 PathProgramCache]: Analyzing trace with hash -2100252890, now seen corresponding path program 1 times [2019-09-07 12:57:50,707 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:57:50,708 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:57:50,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:57:50,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 12:57:50,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:57:50,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:57:50,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 12:57:50,759 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 12:57:50,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 12:57:50,760 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 12:57:50,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 12:57:50,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 12:57:50,760 INFO L87 Difference]: Start difference. First operand 882 states and 1170 transitions. Second operand 3 states. [2019-09-07 12:57:50,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:57:50,812 INFO L93 Difference]: Finished difference Result 916 states and 1204 transitions. [2019-09-07 12:57:50,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 12:57:50,813 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-09-07 12:57:50,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:57:50,817 INFO L225 Difference]: With dead ends: 916 [2019-09-07 12:57:50,817 INFO L226 Difference]: Without dead ends: 884 [2019-09-07 12:57:50,818 INFO L628 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 [2019-09-07 12:57:50,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 884 states. [2019-09-07 12:57:50,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 884 to 882. [2019-09-07 12:57:50,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 882 states. [2019-09-07 12:57:50,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 882 states to 882 states and 1169 transitions. [2019-09-07 12:57:50,919 INFO L78 Accepts]: Start accepts. Automaton has 882 states and 1169 transitions. Word has length 59 [2019-09-07 12:57:50,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:57:50,920 INFO L475 AbstractCegarLoop]: Abstraction has 882 states and 1169 transitions. [2019-09-07 12:57:50,920 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 12:57:50,920 INFO L276 IsEmpty]: Start isEmpty. Operand 882 states and 1169 transitions. [2019-09-07 12:57:50,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-09-07 12:57:50,923 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:57:50,923 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:57:50,924 INFO L418 AbstractCegarLoop]: === Iteration 34 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:57:50,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:57:50,924 INFO L82 PathProgramCache]: Analyzing trace with hash 1685241316, now seen corresponding path program 1 times [2019-09-07 12:57:50,924 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:57:50,924 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:57:50,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:57:50,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 12:57:50,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:57:50,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:57:51,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 12:57:51,001 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 12:57:51,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-07 12:57:51,001 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 12:57:51,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 12:57:51,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-07 12:57:51,002 INFO L87 Difference]: Start difference. First operand 882 states and 1169 transitions. Second operand 9 states. [2019-09-07 12:57:51,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:57:51,178 INFO L93 Difference]: Finished difference Result 904 states and 1192 transitions. [2019-09-07 12:57:51,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-07 12:57:51,179 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 59 [2019-09-07 12:57:51,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:57:51,182 INFO L225 Difference]: With dead ends: 904 [2019-09-07 12:57:51,182 INFO L226 Difference]: Without dead ends: 870 [2019-09-07 12:57:51,183 INFO L628 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 [2019-09-07 12:57:51,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 870 states. [2019-09-07 12:57:51,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 870 to 870. [2019-09-07 12:57:51,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 870 states. [2019-09-07 12:57:51,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 870 states to 870 states and 1149 transitions. [2019-09-07 12:57:51,228 INFO L78 Accepts]: Start accepts. Automaton has 870 states and 1149 transitions. Word has length 59 [2019-09-07 12:57:51,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:57:51,228 INFO L475 AbstractCegarLoop]: Abstraction has 870 states and 1149 transitions. [2019-09-07 12:57:51,228 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 12:57:51,228 INFO L276 IsEmpty]: Start isEmpty. Operand 870 states and 1149 transitions. [2019-09-07 12:57:51,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-07 12:57:51,231 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:57:51,231 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:57:51,231 INFO L418 AbstractCegarLoop]: === Iteration 35 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:57:51,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:57:51,231 INFO L82 PathProgramCache]: Analyzing trace with hash -1567210602, now seen corresponding path program 1 times [2019-09-07 12:57:51,232 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:57:51,232 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:57:51,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:57:51,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 12:57:51,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:57:51,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:57:51,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 12:57:51,267 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 12:57:51,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 12:57:51,267 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 12:57:51,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 12:57:51,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-07 12:57:51,268 INFO L87 Difference]: Start difference. First operand 870 states and 1149 transitions. Second operand 4 states. [2019-09-07 12:57:51,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:57:51,410 INFO L93 Difference]: Finished difference Result 1030 states and 1377 transitions. [2019-09-07 12:57:51,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 12:57:51,410 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2019-09-07 12:57:51,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:57:51,414 INFO L225 Difference]: With dead ends: 1030 [2019-09-07 12:57:51,414 INFO L226 Difference]: Without dead ends: 919 [2019-09-07 12:57:51,415 INFO L628 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 [2019-09-07 12:57:51,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 919 states. [2019-09-07 12:57:51,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 919 to 877. [2019-09-07 12:57:51,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 877 states. [2019-09-07 12:57:51,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 877 states to 877 states and 1165 transitions. [2019-09-07 12:57:51,462 INFO L78 Accepts]: Start accepts. Automaton has 877 states and 1165 transitions. Word has length 60 [2019-09-07 12:57:51,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:57:51,462 INFO L475 AbstractCegarLoop]: Abstraction has 877 states and 1165 transitions. [2019-09-07 12:57:51,462 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 12:57:51,463 INFO L276 IsEmpty]: Start isEmpty. Operand 877 states and 1165 transitions. [2019-09-07 12:57:51,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-07 12:57:51,466 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:57:51,466 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:57:51,466 INFO L418 AbstractCegarLoop]: === Iteration 36 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:57:51,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:57:51,466 INFO L82 PathProgramCache]: Analyzing trace with hash -1292450988, now seen corresponding path program 1 times [2019-09-07 12:57:51,467 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:57:51,467 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:57:51,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:57:51,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 12:57:51,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:57:51,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:57:51,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 12:57:51,560 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 12:57:51,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-07 12:57:51,560 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-07 12:57:51,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-07 12:57:51,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-09-07 12:57:51,561 INFO L87 Difference]: Start difference. First operand 877 states and 1165 transitions. Second operand 11 states. [2019-09-07 12:57:51,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:57:51,725 INFO L93 Difference]: Finished difference Result 946 states and 1258 transitions. [2019-09-07 12:57:51,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-07 12:57:51,726 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 60 [2019-09-07 12:57:51,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:57:51,729 INFO L225 Difference]: With dead ends: 946 [2019-09-07 12:57:51,730 INFO L226 Difference]: Without dead ends: 891 [2019-09-07 12:57:51,731 INFO L628 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 [2019-09-07 12:57:51,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 891 states. [2019-09-07 12:57:51,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 891 to 881. [2019-09-07 12:57:51,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 881 states. [2019-09-07 12:57:51,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 881 states to 881 states and 1183 transitions. [2019-09-07 12:57:51,798 INFO L78 Accepts]: Start accepts. Automaton has 881 states and 1183 transitions. Word has length 60 [2019-09-07 12:57:51,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:57:51,798 INFO L475 AbstractCegarLoop]: Abstraction has 881 states and 1183 transitions. [2019-09-07 12:57:51,798 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-07 12:57:51,798 INFO L276 IsEmpty]: Start isEmpty. Operand 881 states and 1183 transitions. [2019-09-07 12:57:51,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-07 12:57:51,802 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:57:51,802 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:57:51,802 INFO L418 AbstractCegarLoop]: === Iteration 37 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:57:51,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:57:51,802 INFO L82 PathProgramCache]: Analyzing trace with hash -1213114951, now seen corresponding path program 1 times [2019-09-07 12:57:51,803 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:57:51,803 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:57:51,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:57:51,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 12:57:51,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:57:51,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:57:51,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 12:57:51,879 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 12:57:51,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-07 12:57:51,880 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 12:57:51,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 12:57:51,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-07 12:57:51,881 INFO L87 Difference]: Start difference. First operand 881 states and 1183 transitions. Second operand 9 states. [2019-09-07 12:57:52,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:57:52,045 INFO L93 Difference]: Finished difference Result 912 states and 1220 transitions. [2019-09-07 12:57:52,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-07 12:57:52,045 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 60 [2019-09-07 12:57:52,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:57:52,049 INFO L225 Difference]: With dead ends: 912 [2019-09-07 12:57:52,049 INFO L226 Difference]: Without dead ends: 873 [2019-09-07 12:57:52,050 INFO L628 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 [2019-09-07 12:57:52,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2019-09-07 12:57:52,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 873. [2019-09-07 12:57:52,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 873 states. [2019-09-07 12:57:52,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1167 transitions. [2019-09-07 12:57:52,095 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1167 transitions. Word has length 60 [2019-09-07 12:57:52,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:57:52,096 INFO L475 AbstractCegarLoop]: Abstraction has 873 states and 1167 transitions. [2019-09-07 12:57:52,096 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 12:57:52,096 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1167 transitions. [2019-09-07 12:57:52,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-07 12:57:52,099 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:57:52,099 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:57:52,100 INFO L418 AbstractCegarLoop]: === Iteration 38 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:57:52,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:57:52,100 INFO L82 PathProgramCache]: Analyzing trace with hash -850493366, now seen corresponding path program 1 times [2019-09-07 12:57:52,100 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:57:52,100 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:57:52,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:57:52,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 12:57:52,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:57:52,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:57:52,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 12:57:52,239 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 12:57:52,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-07 12:57:52,239 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-07 12:57:52,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-07 12:57:52,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-09-07 12:57:52,240 INFO L87 Difference]: Start difference. First operand 873 states and 1167 transitions. Second operand 13 states. [2019-09-07 12:57:52,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:57:52,539 INFO L93 Difference]: Finished difference Result 890 states and 1185 transitions. [2019-09-07 12:57:52,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-07 12:57:52,540 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 63 [2019-09-07 12:57:52,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:57:52,543 INFO L225 Difference]: With dead ends: 890 [2019-09-07 12:57:52,544 INFO L226 Difference]: Without dead ends: 868 [2019-09-07 12:57:52,545 INFO L628 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 [2019-09-07 12:57:52,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 868 states. [2019-09-07 12:57:52,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 868 to 868. [2019-09-07 12:57:52,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 868 states. [2019-09-07 12:57:52,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 868 states to 868 states and 1160 transitions. [2019-09-07 12:57:52,589 INFO L78 Accepts]: Start accepts. Automaton has 868 states and 1160 transitions. Word has length 63 [2019-09-07 12:57:52,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:57:52,590 INFO L475 AbstractCegarLoop]: Abstraction has 868 states and 1160 transitions. [2019-09-07 12:57:52,590 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-07 12:57:52,590 INFO L276 IsEmpty]: Start isEmpty. Operand 868 states and 1160 transitions. [2019-09-07 12:57:52,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-07 12:57:52,593 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:57:52,594 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:57:52,594 INFO L418 AbstractCegarLoop]: === Iteration 39 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:57:52,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:57:52,594 INFO L82 PathProgramCache]: Analyzing trace with hash -200520490, now seen corresponding path program 1 times [2019-09-07 12:57:52,594 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:57:52,594 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:57:52,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:57:52,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 12:57:52,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:57:52,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:57:52,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 12:57:52,813 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 12:57:52,813 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-07 12:57:52,813 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-07 12:57:52,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-07 12:57:52,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-09-07 12:57:52,815 INFO L87 Difference]: Start difference. First operand 868 states and 1160 transitions. Second operand 13 states. [2019-09-07 12:57:53,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:57:53,111 INFO L93 Difference]: Finished difference Result 885 states and 1178 transitions. [2019-09-07 12:57:53,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-07 12:57:53,111 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 62 [2019-09-07 12:57:53,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:57:53,116 INFO L225 Difference]: With dead ends: 885 [2019-09-07 12:57:53,116 INFO L226 Difference]: Without dead ends: 863 [2019-09-07 12:57:53,117 INFO L628 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 [2019-09-07 12:57:53,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 863 states. [2019-09-07 12:57:53,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 863 to 863. [2019-09-07 12:57:53,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 863 states. [2019-09-07 12:57:53,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 863 states to 863 states and 1153 transitions. [2019-09-07 12:57:53,160 INFO L78 Accepts]: Start accepts. Automaton has 863 states and 1153 transitions. Word has length 62 [2019-09-07 12:57:53,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:57:53,160 INFO L475 AbstractCegarLoop]: Abstraction has 863 states and 1153 transitions. [2019-09-07 12:57:53,161 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-07 12:57:53,161 INFO L276 IsEmpty]: Start isEmpty. Operand 863 states and 1153 transitions. [2019-09-07 12:57:53,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-07 12:57:53,163 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:57:53,163 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:57:53,164 INFO L418 AbstractCegarLoop]: === Iteration 40 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:57:53,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:57:53,164 INFO L82 PathProgramCache]: Analyzing trace with hash -478986825, now seen corresponding path program 1 times [2019-09-07 12:57:53,164 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:57:53,164 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:57:53,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:57:53,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 12:57:53,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:57:53,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:57:53,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 12:57:53,200 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 12:57:53,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 12:57:53,201 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 12:57:53,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 12:57:53,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 12:57:53,201 INFO L87 Difference]: Start difference. First operand 863 states and 1153 transitions. Second operand 3 states. [2019-09-07 12:57:53,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:57:53,235 INFO L93 Difference]: Finished difference Result 1149 states and 1536 transitions. [2019-09-07 12:57:53,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 12:57:53,235 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2019-09-07 12:57:53,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:57:53,238 INFO L225 Difference]: With dead ends: 1149 [2019-09-07 12:57:53,239 INFO L226 Difference]: Without dead ends: 788 [2019-09-07 12:57:53,240 INFO L628 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 [2019-09-07 12:57:53,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 788 states. [2019-09-07 12:57:53,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 788 to 757. [2019-09-07 12:57:53,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 757 states. [2019-09-07 12:57:53,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 757 states to 757 states and 980 transitions. [2019-09-07 12:57:53,281 INFO L78 Accepts]: Start accepts. Automaton has 757 states and 980 transitions. Word has length 62 [2019-09-07 12:57:53,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:57:53,281 INFO L475 AbstractCegarLoop]: Abstraction has 757 states and 980 transitions. [2019-09-07 12:57:53,281 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 12:57:53,282 INFO L276 IsEmpty]: Start isEmpty. Operand 757 states and 980 transitions. [2019-09-07 12:57:53,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-07 12:57:53,284 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:57:53,284 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:57:53,284 INFO L418 AbstractCegarLoop]: === Iteration 41 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:57:53,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:57:53,284 INFO L82 PathProgramCache]: Analyzing trace with hash 735394788, now seen corresponding path program 1 times [2019-09-07 12:57:53,285 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:57:53,285 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:57:53,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:57:53,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 12:57:53,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:57:53,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:57:53,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 12:57:53,412 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 12:57:53,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-07 12:57:53,413 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-07 12:57:53,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-07 12:57:53,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-09-07 12:57:53,415 INFO L87 Difference]: Start difference. First operand 757 states and 980 transitions. Second operand 12 states. [2019-09-07 12:57:53,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:57:53,647 INFO L93 Difference]: Finished difference Result 779 states and 1003 transitions. [2019-09-07 12:57:53,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-07 12:57:53,647 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 63 [2019-09-07 12:57:53,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:57:53,651 INFO L225 Difference]: With dead ends: 779 [2019-09-07 12:57:53,651 INFO L226 Difference]: Without dead ends: 755 [2019-09-07 12:57:53,652 INFO L628 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 [2019-09-07 12:57:53,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 755 states. [2019-09-07 12:57:53,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 755 to 755. [2019-09-07 12:57:53,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 755 states. [2019-09-07 12:57:53,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 755 states to 755 states and 976 transitions. [2019-09-07 12:57:53,691 INFO L78 Accepts]: Start accepts. Automaton has 755 states and 976 transitions. Word has length 63 [2019-09-07 12:57:53,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:57:53,691 INFO L475 AbstractCegarLoop]: Abstraction has 755 states and 976 transitions. [2019-09-07 12:57:53,691 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-07 12:57:53,691 INFO L276 IsEmpty]: Start isEmpty. Operand 755 states and 976 transitions. [2019-09-07 12:57:53,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-07 12:57:53,694 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:57:53,694 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:57:53,694 INFO L418 AbstractCegarLoop]: === Iteration 42 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:57:53,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:57:53,695 INFO L82 PathProgramCache]: Analyzing trace with hash -1698824433, now seen corresponding path program 1 times [2019-09-07 12:57:53,695 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:57:53,695 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:57:53,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:57:53,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 12:57:53,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:57:53,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:57:53,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 12:57:53,732 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 12:57:53,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 12:57:53,733 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 12:57:53,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 12:57:53,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 12:57:53,734 INFO L87 Difference]: Start difference. First operand 755 states and 976 transitions. Second operand 3 states. [2019-09-07 12:57:53,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:57:53,770 INFO L93 Difference]: Finished difference Result 885 states and 1149 transitions. [2019-09-07 12:57:53,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 12:57:53,770 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-09-07 12:57:53,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:57:53,773 INFO L225 Difference]: With dead ends: 885 [2019-09-07 12:57:53,773 INFO L226 Difference]: Without dead ends: 755 [2019-09-07 12:57:53,774 INFO L628 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 [2019-09-07 12:57:53,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 755 states. [2019-09-07 12:57:53,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 755 to 755. [2019-09-07 12:57:53,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 755 states. [2019-09-07 12:57:53,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 755 states to 755 states and 974 transitions. [2019-09-07 12:57:53,813 INFO L78 Accepts]: Start accepts. Automaton has 755 states and 974 transitions. Word has length 66 [2019-09-07 12:57:53,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:57:53,814 INFO L475 AbstractCegarLoop]: Abstraction has 755 states and 974 transitions. [2019-09-07 12:57:53,814 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 12:57:53,814 INFO L276 IsEmpty]: Start isEmpty. Operand 755 states and 974 transitions. [2019-09-07 12:57:53,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-07 12:57:53,816 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:57:53,816 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:57:53,816 INFO L418 AbstractCegarLoop]: === Iteration 43 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:57:53,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:57:53,817 INFO L82 PathProgramCache]: Analyzing trace with hash -679697142, now seen corresponding path program 1 times [2019-09-07 12:57:53,817 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:57:53,817 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:57:53,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:57:53,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 12:57:53,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:57:53,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:57:53,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 12:57:53,882 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 12:57:53,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 12:57:53,882 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 12:57:53,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 12:57:53,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-07 12:57:53,883 INFO L87 Difference]: Start difference. First operand 755 states and 974 transitions. Second operand 5 states. [2019-09-07 12:57:54,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:57:54,080 INFO L93 Difference]: Finished difference Result 819 states and 1050 transitions. [2019-09-07 12:57:54,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-07 12:57:54,080 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-09-07 12:57:54,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:57:54,083 INFO L225 Difference]: With dead ends: 819 [2019-09-07 12:57:54,083 INFO L226 Difference]: Without dead ends: 786 [2019-09-07 12:57:54,085 INFO L628 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 [2019-09-07 12:57:54,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 786 states. [2019-09-07 12:57:54,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 786 to 761. [2019-09-07 12:57:54,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 761 states. [2019-09-07 12:57:54,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 761 states to 761 states and 982 transitions. [2019-09-07 12:57:54,131 INFO L78 Accepts]: Start accepts. Automaton has 761 states and 982 transitions. Word has length 65 [2019-09-07 12:57:54,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:57:54,131 INFO L475 AbstractCegarLoop]: Abstraction has 761 states and 982 transitions. [2019-09-07 12:57:54,131 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 12:57:54,131 INFO L276 IsEmpty]: Start isEmpty. Operand 761 states and 982 transitions. [2019-09-07 12:57:54,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-07 12:57:54,134 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:57:54,134 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:57:54,134 INFO L418 AbstractCegarLoop]: === Iteration 44 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:57:54,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:57:54,135 INFO L82 PathProgramCache]: Analyzing trace with hash 765553274, now seen corresponding path program 1 times [2019-09-07 12:57:54,135 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:57:54,135 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:57:54,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:57:54,136 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 12:57:54,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:57:54,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:57:54,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 12:57:54,312 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 12:57:54,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-07 12:57:54,313 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-07 12:57:54,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-07 12:57:54,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-09-07 12:57:54,314 INFO L87 Difference]: Start difference. First operand 761 states and 982 transitions. Second operand 14 states. [2019-09-07 12:57:54,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:57:54,595 INFO L93 Difference]: Finished difference Result 787 states and 1010 transitions. [2019-09-07 12:57:54,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-07 12:57:54,596 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 70 [2019-09-07 12:57:54,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:57:54,600 INFO L225 Difference]: With dead ends: 787 [2019-09-07 12:57:54,600 INFO L226 Difference]: Without dead ends: 760 [2019-09-07 12:57:54,601 INFO L628 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 [2019-09-07 12:57:54,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 760 states. [2019-09-07 12:57:54,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 760 to 758. [2019-09-07 12:57:54,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 758 states. [2019-09-07 12:57:54,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 758 states to 758 states and 977 transitions. [2019-09-07 12:57:54,656 INFO L78 Accepts]: Start accepts. Automaton has 758 states and 977 transitions. Word has length 70 [2019-09-07 12:57:54,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:57:54,657 INFO L475 AbstractCegarLoop]: Abstraction has 758 states and 977 transitions. [2019-09-07 12:57:54,657 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-07 12:57:54,657 INFO L276 IsEmpty]: Start isEmpty. Operand 758 states and 977 transitions. [2019-09-07 12:57:54,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-07 12:57:54,659 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:57:54,660 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:57:54,660 INFO L418 AbstractCegarLoop]: === Iteration 45 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:57:54,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:57:54,660 INFO L82 PathProgramCache]: Analyzing trace with hash 1777618660, now seen corresponding path program 1 times [2019-09-07 12:57:54,660 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:57:54,661 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:57:54,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:57:54,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 12:57:54,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:57:54,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:57:54,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 12:57:54,823 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 12:57:54,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-07 12:57:54,824 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-07 12:57:54,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-07 12:57:54,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-09-07 12:57:54,824 INFO L87 Difference]: Start difference. First operand 758 states and 977 transitions. Second operand 12 states. [2019-09-07 12:57:55,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:57:55,034 INFO L93 Difference]: Finished difference Result 782 states and 1002 transitions. [2019-09-07 12:57:55,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-07 12:57:55,034 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 67 [2019-09-07 12:57:55,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:57:55,038 INFO L225 Difference]: With dead ends: 782 [2019-09-07 12:57:55,038 INFO L226 Difference]: Without dead ends: 758 [2019-09-07 12:57:55,039 INFO L628 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 [2019-09-07 12:57:55,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 758 states. [2019-09-07 12:57:55,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 758 to 756. [2019-09-07 12:57:55,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 756 states. [2019-09-07 12:57:55,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 756 states to 756 states and 973 transitions. [2019-09-07 12:57:55,078 INFO L78 Accepts]: Start accepts. Automaton has 756 states and 973 transitions. Word has length 67 [2019-09-07 12:57:55,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:57:55,079 INFO L475 AbstractCegarLoop]: Abstraction has 756 states and 973 transitions. [2019-09-07 12:57:55,079 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-07 12:57:55,079 INFO L276 IsEmpty]: Start isEmpty. Operand 756 states and 973 transitions. [2019-09-07 12:57:55,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-07 12:57:55,082 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:57:55,082 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:57:55,082 INFO L418 AbstractCegarLoop]: === Iteration 46 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:57:55,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:57:55,083 INFO L82 PathProgramCache]: Analyzing trace with hash -2077254621, now seen corresponding path program 1 times [2019-09-07 12:57:55,083 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:57:55,083 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:57:55,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:57:55,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 12:57:55,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:57:55,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:57:55,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 12:57:55,204 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 12:57:55,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-07 12:57:55,204 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-07 12:57:55,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-07 12:57:55,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-09-07 12:57:55,205 INFO L87 Difference]: Start difference. First operand 756 states and 973 transitions. Second operand 12 states. [2019-09-07 12:57:55,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:57:55,428 INFO L93 Difference]: Finished difference Result 778 states and 996 transitions. [2019-09-07 12:57:55,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-07 12:57:55,429 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 66 [2019-09-07 12:57:55,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:57:55,433 INFO L225 Difference]: With dead ends: 778 [2019-09-07 12:57:55,434 INFO L226 Difference]: Without dead ends: 754 [2019-09-07 12:57:55,434 INFO L628 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 [2019-09-07 12:57:55,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2019-09-07 12:57:55,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 754. [2019-09-07 12:57:55,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 754 states. [2019-09-07 12:57:55,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 969 transitions. [2019-09-07 12:57:55,473 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 969 transitions. Word has length 66 [2019-09-07 12:57:55,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:57:55,474 INFO L475 AbstractCegarLoop]: Abstraction has 754 states and 969 transitions. [2019-09-07 12:57:55,474 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-07 12:57:55,474 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 969 transitions. [2019-09-07 12:57:55,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-07 12:57:55,476 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:57:55,476 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:57:55,476 INFO L418 AbstractCegarLoop]: === Iteration 47 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:57:55,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:57:55,477 INFO L82 PathProgramCache]: Analyzing trace with hash -157011960, now seen corresponding path program 1 times [2019-09-07 12:57:55,477 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:57:55,477 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:57:55,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:57:55,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 12:57:55,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:57:55,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:57:55,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 12:57:55,522 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 12:57:55,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 12:57:55,522 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 12:57:55,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 12:57:55,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 12:57:55,523 INFO L87 Difference]: Start difference. First operand 754 states and 969 transitions. Second operand 5 states. [2019-09-07 12:57:55,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:57:55,630 INFO L93 Difference]: Finished difference Result 810 states and 1030 transitions. [2019-09-07 12:57:55,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-07 12:57:55,630 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-09-07 12:57:55,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:57:55,634 INFO L225 Difference]: With dead ends: 810 [2019-09-07 12:57:55,634 INFO L226 Difference]: Without dead ends: 756 [2019-09-07 12:57:55,635 INFO L628 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 [2019-09-07 12:57:55,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 756 states. [2019-09-07 12:57:55,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 756 to 754. [2019-09-07 12:57:55,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 754 states. [2019-09-07 12:57:55,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 967 transitions. [2019-09-07 12:57:55,694 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 967 transitions. Word has length 66 [2019-09-07 12:57:55,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:57:55,694 INFO L475 AbstractCegarLoop]: Abstraction has 754 states and 967 transitions. [2019-09-07 12:57:55,694 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 12:57:55,694 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 967 transitions. [2019-09-07 12:57:55,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-07 12:57:55,697 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:57:55,698 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:57:55,699 INFO L418 AbstractCegarLoop]: === Iteration 48 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:57:55,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:57:55,699 INFO L82 PathProgramCache]: Analyzing trace with hash 544587914, now seen corresponding path program 1 times [2019-09-07 12:57:55,699 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:57:55,699 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:57:55,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:57:55,701 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 12:57:55,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:57:55,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:57:55,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 12:57:55,843 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 12:57:55,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-07 12:57:55,843 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-07 12:57:55,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-07 12:57:55,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-09-07 12:57:55,844 INFO L87 Difference]: Start difference. First operand 754 states and 967 transitions. Second operand 11 states. [2019-09-07 12:57:56,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:57:56,065 INFO L93 Difference]: Finished difference Result 776 states and 990 transitions. [2019-09-07 12:57:56,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-07 12:57:56,066 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-09-07 12:57:56,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:57:56,068 INFO L225 Difference]: With dead ends: 776 [2019-09-07 12:57:56,069 INFO L226 Difference]: Without dead ends: 750 [2019-09-07 12:57:56,069 INFO L628 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 [2019-09-07 12:57:56,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 750 states. [2019-09-07 12:57:56,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 750 to 744. [2019-09-07 12:57:56,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 744 states. [2019-09-07 12:57:56,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 744 states to 744 states and 953 transitions. [2019-09-07 12:57:56,110 INFO L78 Accepts]: Start accepts. Automaton has 744 states and 953 transitions. Word has length 66 [2019-09-07 12:57:56,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:57:56,110 INFO L475 AbstractCegarLoop]: Abstraction has 744 states and 953 transitions. [2019-09-07 12:57:56,110 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-07 12:57:56,110 INFO L276 IsEmpty]: Start isEmpty. Operand 744 states and 953 transitions. [2019-09-07 12:57:56,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-07 12:57:56,112 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:57:56,113 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:57:56,113 INFO L418 AbstractCegarLoop]: === Iteration 49 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:57:56,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:57:56,113 INFO L82 PathProgramCache]: Analyzing trace with hash 31965889, now seen corresponding path program 1 times [2019-09-07 12:57:56,113 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:57:56,113 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:57:56,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:57:56,114 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 12:57:56,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:57:56,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:57:56,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 12:57:56,158 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 12:57:56,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 12:57:56,158 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 12:57:56,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 12:57:56,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 12:57:56,159 INFO L87 Difference]: Start difference. First operand 744 states and 953 transitions. Second operand 5 states. [2019-09-07 12:57:56,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:57:56,238 INFO L93 Difference]: Finished difference Result 785 states and 997 transitions. [2019-09-07 12:57:56,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-07 12:57:56,238 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2019-09-07 12:57:56,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:57:56,241 INFO L225 Difference]: With dead ends: 785 [2019-09-07 12:57:56,241 INFO L226 Difference]: Without dead ends: 751 [2019-09-07 12:57:56,242 INFO L628 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 [2019-09-07 12:57:56,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 751 states. [2019-09-07 12:57:56,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 751 to 744. [2019-09-07 12:57:56,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 744 states. [2019-09-07 12:57:56,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 744 states to 744 states and 952 transitions. [2019-09-07 12:57:56,280 INFO L78 Accepts]: Start accepts. Automaton has 744 states and 952 transitions. Word has length 67 [2019-09-07 12:57:56,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:57:56,280 INFO L475 AbstractCegarLoop]: Abstraction has 744 states and 952 transitions. [2019-09-07 12:57:56,280 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 12:57:56,281 INFO L276 IsEmpty]: Start isEmpty. Operand 744 states and 952 transitions. [2019-09-07 12:57:56,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-07 12:57:56,283 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:57:56,283 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:57:56,283 INFO L418 AbstractCegarLoop]: === Iteration 50 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:57:56,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:57:56,284 INFO L82 PathProgramCache]: Analyzing trace with hash 1319946579, now seen corresponding path program 1 times [2019-09-07 12:57:56,284 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:57:56,284 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:57:56,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:57:56,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 12:57:56,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:57:56,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:57:56,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 12:57:56,381 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 12:57:56,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-07 12:57:56,381 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-07 12:57:56,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-07 12:57:56,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-09-07 12:57:56,382 INFO L87 Difference]: Start difference. First operand 744 states and 952 transitions. Second operand 11 states. [2019-09-07 12:57:56,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:57:56,537 INFO L93 Difference]: Finished difference Result 771 states and 982 transitions. [2019-09-07 12:57:56,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-07 12:57:56,537 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 68 [2019-09-07 12:57:56,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:57:56,541 INFO L225 Difference]: With dead ends: 771 [2019-09-07 12:57:56,541 INFO L226 Difference]: Without dead ends: 738 [2019-09-07 12:57:56,542 INFO L628 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 [2019-09-07 12:57:56,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2019-09-07 12:57:56,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 738. [2019-09-07 12:57:56,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 738 states. [2019-09-07 12:57:56,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 738 states and 944 transitions. [2019-09-07 12:57:56,578 INFO L78 Accepts]: Start accepts. Automaton has 738 states and 944 transitions. Word has length 68 [2019-09-07 12:57:56,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:57:56,579 INFO L475 AbstractCegarLoop]: Abstraction has 738 states and 944 transitions. [2019-09-07 12:57:56,579 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-07 12:57:56,579 INFO L276 IsEmpty]: Start isEmpty. Operand 738 states and 944 transitions. [2019-09-07 12:57:56,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-07 12:57:56,581 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:57:56,581 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:57:56,582 INFO L418 AbstractCegarLoop]: === Iteration 51 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:57:56,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:57:56,582 INFO L82 PathProgramCache]: Analyzing trace with hash 1140935392, now seen corresponding path program 1 times [2019-09-07 12:57:56,582 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:57:56,582 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:57:56,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:57:56,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 12:57:56,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:57:56,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:57:56,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 12:57:56,703 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 12:57:56,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-07 12:57:56,703 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-07 12:57:56,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-07 12:57:56,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-09-07 12:57:56,704 INFO L87 Difference]: Start difference. First operand 738 states and 944 transitions. Second operand 11 states. [2019-09-07 12:57:56,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:57:56,913 INFO L93 Difference]: Finished difference Result 799 states and 1007 transitions. [2019-09-07 12:57:56,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-07 12:57:56,914 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 68 [2019-09-07 12:57:56,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:57:56,917 INFO L225 Difference]: With dead ends: 799 [2019-09-07 12:57:56,917 INFO L226 Difference]: Without dead ends: 721 [2019-09-07 12:57:56,917 INFO L628 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 [2019-09-07 12:57:56,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 721 states. [2019-09-07 12:57:56,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 721 to 721. [2019-09-07 12:57:56,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 721 states. [2019-09-07 12:57:56,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 721 states to 721 states and 917 transitions. [2019-09-07 12:57:56,965 INFO L78 Accepts]: Start accepts. Automaton has 721 states and 917 transitions. Word has length 68 [2019-09-07 12:57:56,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:57:56,966 INFO L475 AbstractCegarLoop]: Abstraction has 721 states and 917 transitions. [2019-09-07 12:57:56,966 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-07 12:57:56,966 INFO L276 IsEmpty]: Start isEmpty. Operand 721 states and 917 transitions. [2019-09-07 12:57:56,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-07 12:57:56,968 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:57:56,968 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:57:56,969 INFO L418 AbstractCegarLoop]: === Iteration 52 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:57:56,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:57:56,969 INFO L82 PathProgramCache]: Analyzing trace with hash -1565715428, now seen corresponding path program 1 times [2019-09-07 12:57:56,969 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:57:56,969 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:57:56,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:57:56,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 12:57:56,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:57:56,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:57:57,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 12:57:57,016 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 12:57:57,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 12:57:57,017 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 12:57:57,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 12:57:57,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 12:57:57,018 INFO L87 Difference]: Start difference. First operand 721 states and 917 transitions. Second operand 5 states. [2019-09-07 12:57:57,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:57:57,081 INFO L93 Difference]: Finished difference Result 762 states and 961 transitions. [2019-09-07 12:57:57,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-07 12:57:57,081 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2019-09-07 12:57:57,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:57:57,084 INFO L225 Difference]: With dead ends: 762 [2019-09-07 12:57:57,084 INFO L226 Difference]: Without dead ends: 728 [2019-09-07 12:57:57,085 INFO L628 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 [2019-09-07 12:57:57,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2019-09-07 12:57:57,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 721. [2019-09-07 12:57:57,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 721 states. [2019-09-07 12:57:57,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 721 states to 721 states and 916 transitions. [2019-09-07 12:57:57,122 INFO L78 Accepts]: Start accepts. Automaton has 721 states and 916 transitions. Word has length 69 [2019-09-07 12:57:57,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:57:57,123 INFO L475 AbstractCegarLoop]: Abstraction has 721 states and 916 transitions. [2019-09-07 12:57:57,123 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 12:57:57,123 INFO L276 IsEmpty]: Start isEmpty. Operand 721 states and 916 transitions. [2019-09-07 12:57:57,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-07 12:57:57,125 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:57:57,125 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:57:57,125 INFO L418 AbstractCegarLoop]: === Iteration 53 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:57:57,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:57:57,126 INFO L82 PathProgramCache]: Analyzing trace with hash -1543083174, now seen corresponding path program 1 times [2019-09-07 12:57:57,126 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:57:57,126 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:57:57,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:57:57,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 12:57:57,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:57:57,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:57:57,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 12:57:57,227 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 12:57:57,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-07 12:57:57,227 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-07 12:57:57,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-07 12:57:57,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-09-07 12:57:57,228 INFO L87 Difference]: Start difference. First operand 721 states and 916 transitions. Second operand 11 states. [2019-09-07 12:57:57,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:57:57,366 INFO L93 Difference]: Finished difference Result 748 states and 946 transitions. [2019-09-07 12:57:57,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-07 12:57:57,366 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 69 [2019-09-07 12:57:57,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:57:57,368 INFO L225 Difference]: With dead ends: 748 [2019-09-07 12:57:57,368 INFO L226 Difference]: Without dead ends: 716 [2019-09-07 12:57:57,369 INFO L628 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 [2019-09-07 12:57:57,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 716 states. [2019-09-07 12:57:57,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 716 to 716. [2019-09-07 12:57:57,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 716 states. [2019-09-07 12:57:57,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 716 states to 716 states and 909 transitions. [2019-09-07 12:57:57,404 INFO L78 Accepts]: Start accepts. Automaton has 716 states and 909 transitions. Word has length 69 [2019-09-07 12:57:57,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:57:57,405 INFO L475 AbstractCegarLoop]: Abstraction has 716 states and 909 transitions. [2019-09-07 12:57:57,405 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-07 12:57:57,405 INFO L276 IsEmpty]: Start isEmpty. Operand 716 states and 909 transitions. [2019-09-07 12:57:57,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-07 12:57:57,407 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:57:57,407 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:57:57,407 INFO L418 AbstractCegarLoop]: === Iteration 54 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:57:57,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:57:57,408 INFO L82 PathProgramCache]: Analyzing trace with hash -1351290009, now seen corresponding path program 1 times [2019-09-07 12:57:57,408 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:57:57,408 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:57:57,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:57:57,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 12:57:57,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:57:57,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:57:57,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 12:57:57,548 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 12:57:57,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-07 12:57:57,549 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-07 12:57:57,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-07 12:57:57,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-09-07 12:57:57,550 INFO L87 Difference]: Start difference. First operand 716 states and 909 transitions. Second operand 11 states. [2019-09-07 12:57:57,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:57:57,685 INFO L93 Difference]: Finished difference Result 743 states and 939 transitions. [2019-09-07 12:57:57,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-07 12:57:57,686 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 69 [2019-09-07 12:57:57,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:57:57,689 INFO L225 Difference]: With dead ends: 743 [2019-09-07 12:57:57,689 INFO L226 Difference]: Without dead ends: 713 [2019-09-07 12:57:57,689 INFO L628 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 [2019-09-07 12:57:57,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 713 states. [2019-09-07 12:57:57,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 713 to 713. [2019-09-07 12:57:57,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 713 states. [2019-09-07 12:57:57,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 713 states to 713 states and 904 transitions. [2019-09-07 12:57:57,724 INFO L78 Accepts]: Start accepts. Automaton has 713 states and 904 transitions. Word has length 69 [2019-09-07 12:57:57,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:57:57,724 INFO L475 AbstractCegarLoop]: Abstraction has 713 states and 904 transitions. [2019-09-07 12:57:57,724 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-07 12:57:57,725 INFO L276 IsEmpty]: Start isEmpty. Operand 713 states and 904 transitions. [2019-09-07 12:57:57,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-07 12:57:57,726 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:57:57,727 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:57:57,727 INFO L418 AbstractCegarLoop]: === Iteration 55 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:57:57,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:57:57,727 INFO L82 PathProgramCache]: Analyzing trace with hash -1348608070, now seen corresponding path program 1 times [2019-09-07 12:57:57,727 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:57:57,727 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:57:57,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:57:57,735 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 12:57:57,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:57:57,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:57:57,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 12:57:57,890 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 12:57:57,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-07 12:57:57,891 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-07 12:57:57,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-07 12:57:57,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-09-07 12:57:57,892 INFO L87 Difference]: Start difference. First operand 713 states and 904 transitions. Second operand 11 states. [2019-09-07 12:57:58,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:57:58,188 INFO L93 Difference]: Finished difference Result 723 states and 913 transitions. [2019-09-07 12:57:58,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-07 12:57:58,189 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 69 [2019-09-07 12:57:58,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:57:58,191 INFO L225 Difference]: With dead ends: 723 [2019-09-07 12:57:58,191 INFO L226 Difference]: Without dead ends: 661 [2019-09-07 12:57:58,192 INFO L628 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 [2019-09-07 12:57:58,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2019-09-07 12:57:58,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 657. [2019-09-07 12:57:58,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 657 states. [2019-09-07 12:57:58,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 832 transitions. [2019-09-07 12:57:58,244 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 832 transitions. Word has length 69 [2019-09-07 12:57:58,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:57:58,245 INFO L475 AbstractCegarLoop]: Abstraction has 657 states and 832 transitions. [2019-09-07 12:57:58,245 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-07 12:57:58,245 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 832 transitions. [2019-09-07 12:57:58,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-07 12:57:58,248 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:57:58,248 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:57:58,248 INFO L418 AbstractCegarLoop]: === Iteration 56 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:57:58,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:57:58,249 INFO L82 PathProgramCache]: Analyzing trace with hash 1205519637, now seen corresponding path program 1 times [2019-09-07 12:57:58,249 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:57:58,249 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:57:58,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:57:58,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 12:57:58,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:57:58,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:57:58,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 12:57:58,534 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 12:57:58,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-07 12:57:58,534 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-07 12:57:58,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-07 12:57:58,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-09-07 12:57:58,535 INFO L87 Difference]: Start difference. First operand 657 states and 832 transitions. Second operand 13 states. [2019-09-07 12:57:58,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:57:58,935 INFO L93 Difference]: Finished difference Result 677 states and 853 transitions. [2019-09-07 12:57:58,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-07 12:57:58,936 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 79 [2019-09-07 12:57:58,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:57:58,938 INFO L225 Difference]: With dead ends: 677 [2019-09-07 12:57:58,938 INFO L226 Difference]: Without dead ends: 652 [2019-09-07 12:57:58,939 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2019-09-07 12:57:58,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 652 states. [2019-09-07 12:57:58,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 652 to 652. [2019-09-07 12:57:58,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 652 states. [2019-09-07 12:57:58,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 652 states and 824 transitions. [2019-09-07 12:57:58,973 INFO L78 Accepts]: Start accepts. Automaton has 652 states and 824 transitions. Word has length 79 [2019-09-07 12:57:58,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:57:58,974 INFO L475 AbstractCegarLoop]: Abstraction has 652 states and 824 transitions. [2019-09-07 12:57:58,974 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-07 12:57:58,974 INFO L276 IsEmpty]: Start isEmpty. Operand 652 states and 824 transitions. [2019-09-07 12:57:58,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-07 12:57:58,976 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:57:58,976 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:57:58,977 INFO L418 AbstractCegarLoop]: === Iteration 57 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:57:58,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:57:58,977 INFO L82 PathProgramCache]: Analyzing trace with hash -812657032, now seen corresponding path program 1 times [2019-09-07 12:57:58,977 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:57:58,977 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:57:58,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:57:58,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 12:57:58,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:57:58,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:57:59,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 12:57:59,156 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 12:57:59,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-07 12:57:59,157 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-07 12:57:59,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-07 12:57:59,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-09-07 12:57:59,158 INFO L87 Difference]: Start difference. First operand 652 states and 824 transitions. Second operand 13 states. [2019-09-07 12:57:59,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:57:59,447 INFO L93 Difference]: Finished difference Result 669 states and 842 transitions. [2019-09-07 12:57:59,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-07 12:57:59,448 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 69 [2019-09-07 12:57:59,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:57:59,451 INFO L225 Difference]: With dead ends: 669 [2019-09-07 12:57:59,452 INFO L226 Difference]: Without dead ends: 640 [2019-09-07 12:57:59,452 INFO L628 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 [2019-09-07 12:57:59,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2019-09-07 12:57:59,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 640. [2019-09-07 12:57:59,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 640 states. [2019-09-07 12:57:59,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 808 transitions. [2019-09-07 12:57:59,496 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 808 transitions. Word has length 69 [2019-09-07 12:57:59,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:57:59,496 INFO L475 AbstractCegarLoop]: Abstraction has 640 states and 808 transitions. [2019-09-07 12:57:59,496 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-07 12:57:59,496 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 808 transitions. [2019-09-07 12:57:59,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-07 12:57:59,499 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:57:59,499 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:57:59,499 INFO L418 AbstractCegarLoop]: === Iteration 58 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:57:59,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:57:59,500 INFO L82 PathProgramCache]: Analyzing trace with hash 2125065170, now seen corresponding path program 1 times [2019-09-07 12:57:59,500 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:57:59,500 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:57:59,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:57:59,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 12:57:59,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:57:59,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:57:59,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 12:57:59,752 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 12:57:59,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-07 12:57:59,752 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-07 12:57:59,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-07 12:57:59,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-09-07 12:57:59,753 INFO L87 Difference]: Start difference. First operand 640 states and 808 transitions. Second operand 14 states. [2019-09-07 12:58:00,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:58:00,035 INFO L93 Difference]: Finished difference Result 697 states and 868 transitions. [2019-09-07 12:58:00,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-07 12:58:00,035 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 74 [2019-09-07 12:58:00,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:58:00,038 INFO L225 Difference]: With dead ends: 697 [2019-09-07 12:58:00,038 INFO L226 Difference]: Without dead ends: 629 [2019-09-07 12:58:00,039 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2019-09-07 12:58:00,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2019-09-07 12:58:00,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 629. [2019-09-07 12:58:00,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 629 states. [2019-09-07 12:58:00,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 629 states and 790 transitions. [2019-09-07 12:58:00,072 INFO L78 Accepts]: Start accepts. Automaton has 629 states and 790 transitions. Word has length 74 [2019-09-07 12:58:00,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:58:00,073 INFO L475 AbstractCegarLoop]: Abstraction has 629 states and 790 transitions. [2019-09-07 12:58:00,073 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-07 12:58:00,073 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 790 transitions. [2019-09-07 12:58:00,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-07 12:58:00,075 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:58:00,075 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:58:00,075 INFO L418 AbstractCegarLoop]: === Iteration 59 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:58:00,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:58:00,075 INFO L82 PathProgramCache]: Analyzing trace with hash -1618206117, now seen corresponding path program 1 times [2019-09-07 12:58:00,075 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:58:00,076 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:58:00,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:58:00,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 12:58:00,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:58:00,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:58:00,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 12:58:00,131 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 12:58:00,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 12:58:00,131 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 12:58:00,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 12:58:00,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 12:58:00,132 INFO L87 Difference]: Start difference. First operand 629 states and 790 transitions. Second operand 5 states. [2019-09-07 12:58:00,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:58:00,182 INFO L93 Difference]: Finished difference Result 671 states and 834 transitions. [2019-09-07 12:58:00,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-07 12:58:00,182 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2019-09-07 12:58:00,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:58:00,184 INFO L225 Difference]: With dead ends: 671 [2019-09-07 12:58:00,184 INFO L226 Difference]: Without dead ends: 633 [2019-09-07 12:58:00,185 INFO L628 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 [2019-09-07 12:58:00,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2019-09-07 12:58:00,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 629. [2019-09-07 12:58:00,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 629 states. [2019-09-07 12:58:00,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 629 states and 789 transitions. [2019-09-07 12:58:00,216 INFO L78 Accepts]: Start accepts. Automaton has 629 states and 789 transitions. Word has length 71 [2019-09-07 12:58:00,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:58:00,217 INFO L475 AbstractCegarLoop]: Abstraction has 629 states and 789 transitions. [2019-09-07 12:58:00,217 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 12:58:00,217 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 789 transitions. [2019-09-07 12:58:00,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-07 12:58:00,218 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:58:00,219 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:58:00,219 INFO L418 AbstractCegarLoop]: === Iteration 60 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:58:00,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:58:00,219 INFO L82 PathProgramCache]: Analyzing trace with hash 432777881, now seen corresponding path program 1 times [2019-09-07 12:58:00,219 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:58:00,219 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:58:00,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:58:00,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 12:58:00,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:58:00,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:58:00,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 12:58:00,414 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 12:58:00,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-07 12:58:00,415 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-07 12:58:00,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-07 12:58:00,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-09-07 12:58:00,416 INFO L87 Difference]: Start difference. First operand 629 states and 789 transitions. Second operand 14 states. [2019-09-07 12:58:00,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:58:00,637 INFO L93 Difference]: Finished difference Result 653 states and 815 transitions. [2019-09-07 12:58:00,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-07 12:58:00,638 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 71 [2019-09-07 12:58:00,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:58:00,640 INFO L225 Difference]: With dead ends: 653 [2019-09-07 12:58:00,640 INFO L226 Difference]: Without dead ends: 622 [2019-09-07 12:58:00,641 INFO L628 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 [2019-09-07 12:58:00,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states. [2019-09-07 12:58:00,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 622. [2019-09-07 12:58:00,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 622 states. [2019-09-07 12:58:00,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622 states to 622 states and 779 transitions. [2019-09-07 12:58:00,681 INFO L78 Accepts]: Start accepts. Automaton has 622 states and 779 transitions. Word has length 71 [2019-09-07 12:58:00,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:58:00,682 INFO L475 AbstractCegarLoop]: Abstraction has 622 states and 779 transitions. [2019-09-07 12:58:00,682 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-07 12:58:00,682 INFO L276 IsEmpty]: Start isEmpty. Operand 622 states and 779 transitions. [2019-09-07 12:58:00,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-07 12:58:00,684 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:58:00,684 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:58:00,685 INFO L418 AbstractCegarLoop]: === Iteration 61 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:58:00,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:58:00,686 INFO L82 PathProgramCache]: Analyzing trace with hash -1661633858, now seen corresponding path program 1 times [2019-09-07 12:58:00,686 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:58:00,686 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:58:00,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:58:00,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 12:58:00,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:58:00,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:58:00,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 12:58:00,839 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 12:58:00,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-07 12:58:00,840 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-07 12:58:00,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-07 12:58:00,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-09-07 12:58:00,840 INFO L87 Difference]: Start difference. First operand 622 states and 779 transitions. Second operand 14 states. [2019-09-07 12:58:01,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:58:01,044 INFO L93 Difference]: Finished difference Result 681 states and 842 transitions. [2019-09-07 12:58:01,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-07 12:58:01,044 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 71 [2019-09-07 12:58:01,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:58:01,046 INFO L225 Difference]: With dead ends: 681 [2019-09-07 12:58:01,046 INFO L226 Difference]: Without dead ends: 616 [2019-09-07 12:58:01,047 INFO L628 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 [2019-09-07 12:58:01,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2019-09-07 12:58:01,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 616. [2019-09-07 12:58:01,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 616 states. [2019-09-07 12:58:01,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 616 states and 770 transitions. [2019-09-07 12:58:01,081 INFO L78 Accepts]: Start accepts. Automaton has 616 states and 770 transitions. Word has length 71 [2019-09-07 12:58:01,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:58:01,082 INFO L475 AbstractCegarLoop]: Abstraction has 616 states and 770 transitions. [2019-09-07 12:58:01,082 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-07 12:58:01,082 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 770 transitions. [2019-09-07 12:58:01,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-07 12:58:01,084 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:58:01,084 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:58:01,084 INFO L418 AbstractCegarLoop]: === Iteration 62 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:58:01,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:58:01,085 INFO L82 PathProgramCache]: Analyzing trace with hash -1065956881, now seen corresponding path program 1 times [2019-09-07 12:58:01,085 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:58:01,085 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:58:01,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:58:01,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 12:58:01,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:58:01,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:58:01,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 12:58:01,193 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 12:58:01,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-07 12:58:01,194 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-07 12:58:01,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-07 12:58:01,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-09-07 12:58:01,195 INFO L87 Difference]: Start difference. First operand 616 states and 770 transitions. Second operand 11 states. [2019-09-07 12:58:01,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:58:01,350 INFO L93 Difference]: Finished difference Result 643 states and 800 transitions. [2019-09-07 12:58:01,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-07 12:58:01,351 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 72 [2019-09-07 12:58:01,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:58:01,352 INFO L225 Difference]: With dead ends: 643 [2019-09-07 12:58:01,352 INFO L226 Difference]: Without dead ends: 598 [2019-09-07 12:58:01,353 INFO L628 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 [2019-09-07 12:58:01,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2019-09-07 12:58:01,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 598. [2019-09-07 12:58:01,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 598 states. [2019-09-07 12:58:01,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 742 transitions. [2019-09-07 12:58:01,385 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 742 transitions. Word has length 72 [2019-09-07 12:58:01,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:58:01,386 INFO L475 AbstractCegarLoop]: Abstraction has 598 states and 742 transitions. [2019-09-07 12:58:01,386 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-07 12:58:01,386 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 742 transitions. [2019-09-07 12:58:01,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-07 12:58:01,388 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:58:01,388 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:58:01,388 INFO L418 AbstractCegarLoop]: === Iteration 63 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:58:01,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:58:01,388 INFO L82 PathProgramCache]: Analyzing trace with hash 1302449818, now seen corresponding path program 1 times [2019-09-07 12:58:01,389 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:58:01,389 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:58:01,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:58:01,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 12:58:01,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:58:01,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:58:01,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 12:58:01,487 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 12:58:01,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-07 12:58:01,487 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-07 12:58:01,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-07 12:58:01,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-09-07 12:58:01,488 INFO L87 Difference]: Start difference. First operand 598 states and 742 transitions. Second operand 11 states. [2019-09-07 12:58:01,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:58:01,622 INFO L93 Difference]: Finished difference Result 656 states and 805 transitions. [2019-09-07 12:58:01,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-07 12:58:01,623 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 71 [2019-09-07 12:58:01,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:58:01,624 INFO L225 Difference]: With dead ends: 656 [2019-09-07 12:58:01,624 INFO L226 Difference]: Without dead ends: 590 [2019-09-07 12:58:01,627 INFO L628 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 [2019-09-07 12:58:01,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2019-09-07 12:58:01,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 590. [2019-09-07 12:58:01,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 590 states. [2019-09-07 12:58:01,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 729 transitions. [2019-09-07 12:58:01,659 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 729 transitions. Word has length 71 [2019-09-07 12:58:01,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:58:01,659 INFO L475 AbstractCegarLoop]: Abstraction has 590 states and 729 transitions. [2019-09-07 12:58:01,659 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-07 12:58:01,659 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 729 transitions. [2019-09-07 12:58:01,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-07 12:58:01,661 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:58:01,661 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:58:01,661 INFO L418 AbstractCegarLoop]: === Iteration 64 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:58:01,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:58:01,663 INFO L82 PathProgramCache]: Analyzing trace with hash -389549299, now seen corresponding path program 1 times [2019-09-07 12:58:01,663 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:58:01,663 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:58:01,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:58:01,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 12:58:01,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:58:01,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:58:01,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 12:58:01,817 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 12:58:01,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-07 12:58:01,818 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-07 12:58:01,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-07 12:58:01,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-09-07 12:58:01,819 INFO L87 Difference]: Start difference. First operand 590 states and 729 transitions. Second operand 14 states. [2019-09-07 12:58:02,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:58:02,038 INFO L93 Difference]: Finished difference Result 649 states and 792 transitions. [2019-09-07 12:58:02,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-07 12:58:02,038 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 72 [2019-09-07 12:58:02,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:58:02,040 INFO L225 Difference]: With dead ends: 649 [2019-09-07 12:58:02,041 INFO L226 Difference]: Without dead ends: 578 [2019-09-07 12:58:02,042 INFO L628 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 [2019-09-07 12:58:02,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2019-09-07 12:58:02,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 578. [2019-09-07 12:58:02,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 578 states. [2019-09-07 12:58:02,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 710 transitions. [2019-09-07 12:58:02,091 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 710 transitions. Word has length 72 [2019-09-07 12:58:02,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:58:02,091 INFO L475 AbstractCegarLoop]: Abstraction has 578 states and 710 transitions. [2019-09-07 12:58:02,091 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-07 12:58:02,092 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 710 transitions. [2019-09-07 12:58:02,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-07 12:58:02,094 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:58:02,094 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:58:02,094 INFO L418 AbstractCegarLoop]: === Iteration 65 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:58:02,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:58:02,094 INFO L82 PathProgramCache]: Analyzing trace with hash 1474885070, now seen corresponding path program 1 times [2019-09-07 12:58:02,095 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:58:02,095 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:58:02,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:58:02,095 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 12:58:02,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:58:02,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:58:02,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 12:58:02,279 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 12:58:02,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-07 12:58:02,280 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-07 12:58:02,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-07 12:58:02,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-09-07 12:58:02,280 INFO L87 Difference]: Start difference. First operand 578 states and 710 transitions. Second operand 13 states. [2019-09-07 12:58:02,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:58:02,522 INFO L93 Difference]: Finished difference Result 580 states and 711 transitions. [2019-09-07 12:58:02,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-07 12:58:02,524 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 72 [2019-09-07 12:58:02,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:58:02,525 INFO L225 Difference]: With dead ends: 580 [2019-09-07 12:58:02,525 INFO L226 Difference]: Without dead ends: 525 [2019-09-07 12:58:02,526 INFO L628 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 [2019-09-07 12:58:02,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2019-09-07 12:58:02,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 525. [2019-09-07 12:58:02,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 525 states. [2019-09-07 12:58:02,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 652 transitions. [2019-09-07 12:58:02,552 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 652 transitions. Word has length 72 [2019-09-07 12:58:02,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:58:02,552 INFO L475 AbstractCegarLoop]: Abstraction has 525 states and 652 transitions. [2019-09-07 12:58:02,553 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-07 12:58:02,553 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 652 transitions. [2019-09-07 12:58:02,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-07 12:58:02,554 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:58:02,555 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:58:02,555 INFO L418 AbstractCegarLoop]: === Iteration 66 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:58:02,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:58:02,555 INFO L82 PathProgramCache]: Analyzing trace with hash 1301117145, now seen corresponding path program 1 times [2019-09-07 12:58:02,555 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:58:02,555 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:58:02,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:58:02,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 12:58:02,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:58:02,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:58:02,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 12:58:02,664 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 12:58:02,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-07 12:58:02,664 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-07 12:58:02,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-07 12:58:02,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-09-07 12:58:02,665 INFO L87 Difference]: Start difference. First operand 525 states and 652 transitions. Second operand 11 states. [2019-09-07 12:58:04,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:58:04,128 INFO L93 Difference]: Finished difference Result 1054 states and 1319 transitions. [2019-09-07 12:58:04,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-07 12:58:04,128 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 73 [2019-09-07 12:58:04,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:58:04,131 INFO L225 Difference]: With dead ends: 1054 [2019-09-07 12:58:04,131 INFO L226 Difference]: Without dead ends: 909 [2019-09-07 12:58:04,132 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2019-09-07 12:58:04,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 909 states. [2019-09-07 12:58:04,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 909 to 541. [2019-09-07 12:58:04,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 541 states. [2019-09-07 12:58:04,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 669 transitions. [2019-09-07 12:58:04,159 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 669 transitions. Word has length 73 [2019-09-07 12:58:04,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:58:04,160 INFO L475 AbstractCegarLoop]: Abstraction has 541 states and 669 transitions. [2019-09-07 12:58:04,160 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-07 12:58:04,160 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 669 transitions. [2019-09-07 12:58:04,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-07 12:58:04,161 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:58:04,161 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:58:04,162 INFO L418 AbstractCegarLoop]: === Iteration 67 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:58:04,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:58:04,162 INFO L82 PathProgramCache]: Analyzing trace with hash -1233648810, now seen corresponding path program 1 times [2019-09-07 12:58:04,162 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:58:04,162 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:58:04,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:58:04,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 12:58:04,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:58:04,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:58:04,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 12:58:04,276 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 12:58:04,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 12:58:04,277 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 12:58:04,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 12:58:04,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-07 12:58:04,277 INFO L87 Difference]: Start difference. First operand 541 states and 669 transitions. Second operand 6 states. [2019-09-07 12:58:04,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:58:04,350 INFO L93 Difference]: Finished difference Result 736 states and 919 transitions. [2019-09-07 12:58:04,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-07 12:58:04,351 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 77 [2019-09-07 12:58:04,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:58:04,352 INFO L225 Difference]: With dead ends: 736 [2019-09-07 12:58:04,352 INFO L226 Difference]: Without dead ends: 534 [2019-09-07 12:58:04,353 INFO L628 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 [2019-09-07 12:58:04,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2019-09-07 12:58:04,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 534. [2019-09-07 12:58:04,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 534 states. [2019-09-07 12:58:04,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 658 transitions. [2019-09-07 12:58:04,399 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 658 transitions. Word has length 77 [2019-09-07 12:58:04,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:58:04,400 INFO L475 AbstractCegarLoop]: Abstraction has 534 states and 658 transitions. [2019-09-07 12:58:04,400 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 12:58:04,400 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 658 transitions. [2019-09-07 12:58:04,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-07 12:58:04,402 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:58:04,402 INFO L399 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] [2019-09-07 12:58:04,403 INFO L418 AbstractCegarLoop]: === Iteration 68 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:58:04,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:58:04,403 INFO L82 PathProgramCache]: Analyzing trace with hash -586530439, now seen corresponding path program 1 times [2019-09-07 12:58:04,403 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:58:04,403 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:58:04,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:58:04,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 12:58:04,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:58:04,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:58:04,455 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-07 12:58:04,455 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 12:58:04,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 12:58:04,456 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 12:58:04,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 12:58:04,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 12:58:04,457 INFO L87 Difference]: Start difference. First operand 534 states and 658 transitions. Second operand 5 states. [2019-09-07 12:58:04,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:58:04,522 INFO L93 Difference]: Finished difference Result 568 states and 694 transitions. [2019-09-07 12:58:04,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-07 12:58:04,522 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 75 [2019-09-07 12:58:04,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:58:04,524 INFO L225 Difference]: With dead ends: 568 [2019-09-07 12:58:04,524 INFO L226 Difference]: Without dead ends: 534 [2019-09-07 12:58:04,524 INFO L628 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 [2019-09-07 12:58:04,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2019-09-07 12:58:04,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 534. [2019-09-07 12:58:04,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 534 states. [2019-09-07 12:58:04,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 657 transitions. [2019-09-07 12:58:04,574 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 657 transitions. Word has length 75 [2019-09-07 12:58:04,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:58:04,575 INFO L475 AbstractCegarLoop]: Abstraction has 534 states and 657 transitions. [2019-09-07 12:58:04,575 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 12:58:04,575 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 657 transitions. [2019-09-07 12:58:04,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-07 12:58:04,576 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:58:04,576 INFO L399 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] [2019-09-07 12:58:04,577 INFO L418 AbstractCegarLoop]: === Iteration 69 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:58:04,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:58:04,577 INFO L82 PathProgramCache]: Analyzing trace with hash -563898185, now seen corresponding path program 1 times [2019-09-07 12:58:04,577 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:58:04,577 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:58:04,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:58:04,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 12:58:04,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:58:04,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:58:04,669 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-07 12:58:04,670 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 12:58:04,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-07 12:58:04,670 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-07 12:58:04,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-07 12:58:04,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-09-07 12:58:04,671 INFO L87 Difference]: Start difference. First operand 534 states and 657 transitions. Second operand 11 states. [2019-09-07 12:58:04,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:58:04,795 INFO L93 Difference]: Finished difference Result 553 states and 678 transitions. [2019-09-07 12:58:04,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-07 12:58:04,796 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 75 [2019-09-07 12:58:04,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:58:04,797 INFO L225 Difference]: With dead ends: 553 [2019-09-07 12:58:04,797 INFO L226 Difference]: Without dead ends: 510 [2019-09-07 12:58:04,798 INFO L628 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 [2019-09-07 12:58:04,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2019-09-07 12:58:04,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 507. [2019-09-07 12:58:04,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 507 states. [2019-09-07 12:58:04,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 623 transitions. [2019-09-07 12:58:04,828 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 623 transitions. Word has length 75 [2019-09-07 12:58:04,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:58:04,828 INFO L475 AbstractCegarLoop]: Abstraction has 507 states and 623 transitions. [2019-09-07 12:58:04,828 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-07 12:58:04,828 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 623 transitions. [2019-09-07 12:58:04,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-07 12:58:04,830 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:58:04,830 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:58:04,830 INFO L418 AbstractCegarLoop]: === Iteration 70 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:58:04,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:58:04,831 INFO L82 PathProgramCache]: Analyzing trace with hash -287687659, now seen corresponding path program 1 times [2019-09-07 12:58:04,831 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:58:04,831 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:58:04,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:58:04,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 12:58:04,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:58:04,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:58:04,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 12:58:04,990 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 12:58:04,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-07 12:58:04,990 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-07 12:58:04,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-07 12:58:04,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-09-07 12:58:04,991 INFO L87 Difference]: Start difference. First operand 507 states and 623 transitions. Second operand 14 states. [2019-09-07 12:58:05,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:58:05,189 INFO L93 Difference]: Finished difference Result 571 states and 696 transitions. [2019-09-07 12:58:05,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-07 12:58:05,189 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 77 [2019-09-07 12:58:05,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:58:05,190 INFO L225 Difference]: With dead ends: 571 [2019-09-07 12:58:05,191 INFO L226 Difference]: Without dead ends: 504 [2019-09-07 12:58:05,191 INFO L628 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 [2019-09-07 12:58:05,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2019-09-07 12:58:05,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 504. [2019-09-07 12:58:05,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 504 states. [2019-09-07 12:58:05,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 616 transitions. [2019-09-07 12:58:05,219 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 616 transitions. Word has length 77 [2019-09-07 12:58:05,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:58:05,220 INFO L475 AbstractCegarLoop]: Abstraction has 504 states and 616 transitions. [2019-09-07 12:58:05,220 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-07 12:58:05,220 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 616 transitions. [2019-09-07 12:58:05,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-07 12:58:05,221 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:58:05,221 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:58:05,222 INFO L418 AbstractCegarLoop]: === Iteration 71 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:58:05,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:58:05,222 INFO L82 PathProgramCache]: Analyzing trace with hash -1789747715, now seen corresponding path program 1 times [2019-09-07 12:58:05,222 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:58:05,222 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:58:05,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:58:05,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 12:58:05,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:58:05,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:58:05,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 12:58:05,269 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 12:58:05,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 12:58:05,269 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 12:58:05,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 12:58:05,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 12:58:05,270 INFO L87 Difference]: Start difference. First operand 504 states and 616 transitions. Second operand 5 states. [2019-09-07 12:58:05,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:58:05,466 INFO L93 Difference]: Finished difference Result 699 states and 866 transitions. [2019-09-07 12:58:05,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-07 12:58:05,466 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 81 [2019-09-07 12:58:05,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:58:05,468 INFO L225 Difference]: With dead ends: 699 [2019-09-07 12:58:05,468 INFO L226 Difference]: Without dead ends: 504 [2019-09-07 12:58:05,469 INFO L628 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 [2019-09-07 12:58:05,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2019-09-07 12:58:05,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 504. [2019-09-07 12:58:05,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 504 states. [2019-09-07 12:58:05,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 615 transitions. [2019-09-07 12:58:05,499 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 615 transitions. Word has length 81 [2019-09-07 12:58:05,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:58:05,499 INFO L475 AbstractCegarLoop]: Abstraction has 504 states and 615 transitions. [2019-09-07 12:58:05,499 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 12:58:05,500 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 615 transitions. [2019-09-07 12:58:05,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-07 12:58:05,501 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:58:05,501 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:58:05,501 INFO L418 AbstractCegarLoop]: === Iteration 72 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:58:05,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:58:05,502 INFO L82 PathProgramCache]: Analyzing trace with hash 450861343, now seen corresponding path program 1 times [2019-09-07 12:58:05,502 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:58:05,502 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:58:05,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:58:05,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 12:58:05,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:58:05,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:58:05,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 12:58:05,587 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 12:58:05,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-07 12:58:05,588 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-07 12:58:05,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-07 12:58:05,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-07 12:58:05,588 INFO L87 Difference]: Start difference. First operand 504 states and 615 transitions. Second operand 10 states. [2019-09-07 12:58:07,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:58:07,254 INFO L93 Difference]: Finished difference Result 865 states and 1065 transitions. [2019-09-07 12:58:07,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-07 12:58:07,254 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 78 [2019-09-07 12:58:07,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:58:07,256 INFO L225 Difference]: With dead ends: 865 [2019-09-07 12:58:07,257 INFO L226 Difference]: Without dead ends: 731 [2019-09-07 12:58:07,257 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2019-09-07 12:58:07,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 731 states. [2019-09-07 12:58:07,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 731 to 367. [2019-09-07 12:58:07,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2019-09-07 12:58:07,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 458 transitions. [2019-09-07 12:58:07,285 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 458 transitions. Word has length 78 [2019-09-07 12:58:07,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:58:07,286 INFO L475 AbstractCegarLoop]: Abstraction has 367 states and 458 transitions. [2019-09-07 12:58:07,286 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-07 12:58:07,286 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 458 transitions. [2019-09-07 12:58:07,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-07 12:58:07,287 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:58:07,287 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:58:07,287 INFO L418 AbstractCegarLoop]: === Iteration 73 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:58:07,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:58:07,288 INFO L82 PathProgramCache]: Analyzing trace with hash -759495946, now seen corresponding path program 1 times [2019-09-07 12:58:07,288 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:58:07,288 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:58:07,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:58:07,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 12:58:07,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:58:07,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:58:07,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 12:58:07,334 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 12:58:07,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 12:58:07,334 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 12:58:07,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 12:58:07,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 12:58:07,335 INFO L87 Difference]: Start difference. First operand 367 states and 458 transitions. Second operand 3 states. [2019-09-07 12:58:07,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:58:07,389 INFO L93 Difference]: Finished difference Result 410 states and 504 transitions. [2019-09-07 12:58:07,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 12:58:07,390 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2019-09-07 12:58:07,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:58:07,391 INFO L225 Difference]: With dead ends: 410 [2019-09-07 12:58:07,391 INFO L226 Difference]: Without dead ends: 372 [2019-09-07 12:58:07,392 INFO L628 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 [2019-09-07 12:58:07,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2019-09-07 12:58:07,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 368. [2019-09-07 12:58:07,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368 states. [2019-09-07 12:58:07,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 459 transitions. [2019-09-07 12:58:07,420 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 459 transitions. Word has length 80 [2019-09-07 12:58:07,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:58:07,420 INFO L475 AbstractCegarLoop]: Abstraction has 368 states and 459 transitions. [2019-09-07 12:58:07,420 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 12:58:07,420 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 459 transitions. [2019-09-07 12:58:07,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-07 12:58:07,422 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:58:07,422 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:58:07,422 INFO L418 AbstractCegarLoop]: === Iteration 74 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:58:07,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:58:07,422 INFO L82 PathProgramCache]: Analyzing trace with hash 1291488052, now seen corresponding path program 1 times [2019-09-07 12:58:07,422 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:58:07,423 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:58:07,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:58:07,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 12:58:07,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:58:07,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:58:07,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 12:58:07,602 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 12:58:07,602 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-07 12:58:07,602 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-07 12:58:07,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-07 12:58:07,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-09-07 12:58:07,603 INFO L87 Difference]: Start difference. First operand 368 states and 459 transitions. Second operand 14 states. [2019-09-07 12:58:07,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:58:07,770 INFO L93 Difference]: Finished difference Result 383 states and 475 transitions. [2019-09-07 12:58:07,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-07 12:58:07,770 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 80 [2019-09-07 12:58:07,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:58:07,771 INFO L225 Difference]: With dead ends: 383 [2019-09-07 12:58:07,771 INFO L226 Difference]: Without dead ends: 310 [2019-09-07 12:58:07,772 INFO L628 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 [2019-09-07 12:58:07,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2019-09-07 12:58:07,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 310. [2019-09-07 12:58:07,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310 states. [2019-09-07 12:58:07,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 388 transitions. [2019-09-07 12:58:07,795 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 388 transitions. Word has length 80 [2019-09-07 12:58:07,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:58:07,795 INFO L475 AbstractCegarLoop]: Abstraction has 310 states and 388 transitions. [2019-09-07 12:58:07,795 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-07 12:58:07,796 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 388 transitions. [2019-09-07 12:58:07,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-07 12:58:07,797 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:58:07,797 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:58:07,797 INFO L418 AbstractCegarLoop]: === Iteration 75 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:58:07,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:58:07,797 INFO L82 PathProgramCache]: Analyzing trace with hash 752230136, now seen corresponding path program 1 times [2019-09-07 12:58:07,798 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:58:07,798 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:58:07,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:58:07,800 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 12:58:07,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:58:07,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:58:07,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 12:58:07,851 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 12:58:07,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 12:58:07,852 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 12:58:07,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 12:58:07,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-07 12:58:07,852 INFO L87 Difference]: Start difference. First operand 310 states and 388 transitions. Second operand 6 states. [2019-09-07 12:58:08,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:58:08,123 INFO L93 Difference]: Finished difference Result 445 states and 546 transitions. [2019-09-07 12:58:08,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-07 12:58:08,124 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2019-09-07 12:58:08,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:58:08,125 INFO L225 Difference]: With dead ends: 445 [2019-09-07 12:58:08,125 INFO L226 Difference]: Without dead ends: 303 [2019-09-07 12:58:08,126 INFO L628 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 [2019-09-07 12:58:08,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2019-09-07 12:58:08,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 257. [2019-09-07 12:58:08,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-09-07 12:58:08,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 301 transitions. [2019-09-07 12:58:08,143 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 301 transitions. Word has length 83 [2019-09-07 12:58:08,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:58:08,143 INFO L475 AbstractCegarLoop]: Abstraction has 257 states and 301 transitions. [2019-09-07 12:58:08,143 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 12:58:08,143 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 301 transitions. [2019-09-07 12:58:08,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-07 12:58:08,144 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:58:08,144 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:58:08,145 INFO L418 AbstractCegarLoop]: === Iteration 76 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:58:08,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:58:08,145 INFO L82 PathProgramCache]: Analyzing trace with hash 1148690809, now seen corresponding path program 1 times [2019-09-07 12:58:08,145 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:58:08,145 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:58:08,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:58:08,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 12:58:08,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:58:08,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:58:08,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 12:58:08,294 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 12:58:08,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-07 12:58:08,295 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-07 12:58:08,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-07 12:58:08,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-09-07 12:58:08,296 INFO L87 Difference]: Start difference. First operand 257 states and 301 transitions. Second operand 13 states. [2019-09-07 12:58:09,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:58:09,302 INFO L93 Difference]: Finished difference Result 289 states and 338 transitions. [2019-09-07 12:58:09,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-07 12:58:09,302 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 99 [2019-09-07 12:58:09,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:58:09,303 INFO L225 Difference]: With dead ends: 289 [2019-09-07 12:58:09,303 INFO L226 Difference]: Without dead ends: 266 [2019-09-07 12:58:09,304 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2019-09-07 12:58:09,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2019-09-07 12:58:09,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 257. [2019-09-07 12:58:09,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-09-07 12:58:09,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 300 transitions. [2019-09-07 12:58:09,321 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 300 transitions. Word has length 99 [2019-09-07 12:58:09,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:58:09,322 INFO L475 AbstractCegarLoop]: Abstraction has 257 states and 300 transitions. [2019-09-07 12:58:09,322 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-07 12:58:09,322 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 300 transitions. [2019-09-07 12:58:09,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-07 12:58:09,322 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:58:09,323 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:58:09,323 INFO L418 AbstractCegarLoop]: === Iteration 77 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:58:09,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:58:09,323 INFO L82 PathProgramCache]: Analyzing trace with hash -22783563, now seen corresponding path program 1 times [2019-09-07 12:58:09,323 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:58:09,323 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:58:09,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:58:09,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 12:58:09,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:58:09,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:58:09,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 12:58:09,413 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 12:58:09,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-07 12:58:09,413 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-07 12:58:09,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-07 12:58:09,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-07 12:58:09,414 INFO L87 Difference]: Start difference. First operand 257 states and 300 transitions. Second operand 10 states. [2019-09-07 12:58:10,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:58:10,524 INFO L93 Difference]: Finished difference Result 551 states and 641 transitions. [2019-09-07 12:58:10,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-07 12:58:10,524 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 101 [2019-09-07 12:58:10,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:58:10,526 INFO L225 Difference]: With dead ends: 551 [2019-09-07 12:58:10,526 INFO L226 Difference]: Without dead ends: 492 [2019-09-07 12:58:10,527 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=367, Unknown=0, NotChecked=0, Total=462 [2019-09-07 12:58:10,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2019-09-07 12:58:10,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 448. [2019-09-07 12:58:10,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 448 states. [2019-09-07 12:58:10,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 522 transitions. [2019-09-07 12:58:10,560 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 522 transitions. Word has length 101 [2019-09-07 12:58:10,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:58:10,560 INFO L475 AbstractCegarLoop]: Abstraction has 448 states and 522 transitions. [2019-09-07 12:58:10,560 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-07 12:58:10,560 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 522 transitions. [2019-09-07 12:58:10,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-07 12:58:10,567 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:58:10,567 INFO L399 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] [2019-09-07 12:58:10,567 INFO L418 AbstractCegarLoop]: === Iteration 78 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:58:10,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:58:10,567 INFO L82 PathProgramCache]: Analyzing trace with hash 875169512, now seen corresponding path program 1 times [2019-09-07 12:58:10,568 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:58:10,568 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:58:10,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:58:10,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 12:58:10,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:58:10,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:58:10,629 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-07 12:58:10,629 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 12:58:10,630 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-09-07 12:58:10,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 12:58:10,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:58:10,812 INFO L256 TraceCheckSpWp]: Trace formula consists of 921 conjuncts, 2 conjunts are in the unsatisfiable core [2019-09-07 12:58:10,828 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 12:58:10,876 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 12:58:10,892 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 12:58:10,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2019-09-07 12:58:10,893 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 12:58:10,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 12:58:10,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-07 12:58:10,894 INFO L87 Difference]: Start difference. First operand 448 states and 522 transitions. Second operand 6 states. [2019-09-07 12:58:11,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:58:11,167 INFO L93 Difference]: Finished difference Result 696 states and 843 transitions. [2019-09-07 12:58:11,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-07 12:58:11,167 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 114 [2019-09-07 12:58:11,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:58:11,170 INFO L225 Difference]: With dead ends: 696 [2019-09-07 12:58:11,170 INFO L226 Difference]: Without dead ends: 419 [2019-09-07 12:58:11,171 INFO L628 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 [2019-09-07 12:58:11,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2019-09-07 12:58:11,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 376. [2019-09-07 12:58:11,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2019-09-07 12:58:11,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 433 transitions. [2019-09-07 12:58:11,208 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 433 transitions. Word has length 114 [2019-09-07 12:58:11,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:58:11,208 INFO L475 AbstractCegarLoop]: Abstraction has 376 states and 433 transitions. [2019-09-07 12:58:11,208 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 12:58:11,208 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 433 transitions. [2019-09-07 12:58:11,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-07 12:58:11,210 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:58:11,210 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:58:11,211 INFO L418 AbstractCegarLoop]: === Iteration 79 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:58:11,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:58:11,211 INFO L82 PathProgramCache]: Analyzing trace with hash 1854279667, now seen corresponding path program 1 times [2019-09-07 12:58:11,211 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:58:11,211 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:58:11,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:58:11,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 12:58:11,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:58:11,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:58:11,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 12:58:11,301 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 12:58:11,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-07 12:58:11,302 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-07 12:58:11,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-07 12:58:11,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-07 12:58:11,302 INFO L87 Difference]: Start difference. First operand 376 states and 433 transitions. Second operand 8 states. [2019-09-07 12:58:11,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:58:11,389 INFO L93 Difference]: Finished difference Result 394 states and 452 transitions. [2019-09-07 12:58:11,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-07 12:58:11,390 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 101 [2019-09-07 12:58:11,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:58:11,391 INFO L225 Difference]: With dead ends: 394 [2019-09-07 12:58:11,392 INFO L226 Difference]: Without dead ends: 288 [2019-09-07 12:58:11,392 INFO L628 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 [2019-09-07 12:58:11,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2019-09-07 12:58:11,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 151. [2019-09-07 12:58:11,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-09-07 12:58:11,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 168 transitions. [2019-09-07 12:58:11,411 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 168 transitions. Word has length 101 [2019-09-07 12:58:11,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:58:11,411 INFO L475 AbstractCegarLoop]: Abstraction has 151 states and 168 transitions. [2019-09-07 12:58:11,411 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-07 12:58:11,411 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 168 transitions. [2019-09-07 12:58:11,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-07 12:58:11,412 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:58:11,412 INFO L399 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] [2019-09-07 12:58:11,412 INFO L418 AbstractCegarLoop]: === Iteration 80 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:58:11,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:58:11,413 INFO L82 PathProgramCache]: Analyzing trace with hash -67677820, now seen corresponding path program 1 times [2019-09-07 12:58:11,413 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:58:11,413 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:58:11,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:58:11,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 12:58:11,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:58:11,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:58:11,520 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-07 12:58:11,521 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 12:58:11,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-07 12:58:11,521 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-07 12:58:11,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-07 12:58:11,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-09-07 12:58:11,522 INFO L87 Difference]: Start difference. First operand 151 states and 168 transitions. Second operand 11 states. [2019-09-07 12:58:12,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:58:12,057 INFO L93 Difference]: Finished difference Result 173 states and 193 transitions. [2019-09-07 12:58:12,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-07 12:58:12,057 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 115 [2019-09-07 12:58:12,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:58:12,059 INFO L225 Difference]: With dead ends: 173 [2019-09-07 12:58:12,059 INFO L226 Difference]: Without dead ends: 149 [2019-09-07 12:58:12,060 INFO L628 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 [2019-09-07 12:58:12,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-09-07 12:58:12,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 146. [2019-09-07 12:58:12,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-09-07 12:58:12,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 159 transitions. [2019-09-07 12:58:12,093 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 159 transitions. Word has length 115 [2019-09-07 12:58:12,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:58:12,093 INFO L475 AbstractCegarLoop]: Abstraction has 146 states and 159 transitions. [2019-09-07 12:58:12,093 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-07 12:58:12,093 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 159 transitions. [2019-09-07 12:58:12,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-07 12:58:12,094 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:58:12,094 INFO L399 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] [2019-09-07 12:58:12,095 INFO L418 AbstractCegarLoop]: === Iteration 81 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:58:12,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:58:12,095 INFO L82 PathProgramCache]: Analyzing trace with hash -1345019515, now seen corresponding path program 1 times [2019-09-07 12:58:12,095 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:58:12,095 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:58:12,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:58:12,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 12:58:12,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:58:12,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:58:12,183 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-07 12:58:12,183 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 12:58:12,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-07 12:58:12,184 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 12:58:12,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 12:58:12,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-07 12:58:12,184 INFO L87 Difference]: Start difference. First operand 146 states and 159 transitions. Second operand 9 states. [2019-09-07 12:58:12,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:58:12,745 INFO L93 Difference]: Finished difference Result 280 states and 305 transitions. [2019-09-07 12:58:12,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-07 12:58:12,745 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 116 [2019-09-07 12:58:12,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:58:12,747 INFO L225 Difference]: With dead ends: 280 [2019-09-07 12:58:12,747 INFO L226 Difference]: Without dead ends: 146 [2019-09-07 12:58:12,747 INFO L628 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 [2019-09-07 12:58:12,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-09-07 12:58:12,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2019-09-07 12:58:12,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-09-07 12:58:12,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 158 transitions. [2019-09-07 12:58:12,763 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 158 transitions. Word has length 116 [2019-09-07 12:58:12,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:58:12,763 INFO L475 AbstractCegarLoop]: Abstraction has 146 states and 158 transitions. [2019-09-07 12:58:12,763 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 12:58:12,763 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 158 transitions. [2019-09-07 12:58:12,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-07 12:58:12,764 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:58:12,764 INFO L399 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] [2019-09-07 12:58:12,764 INFO L418 AbstractCegarLoop]: === Iteration 82 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:58:12,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:58:12,765 INFO L82 PathProgramCache]: Analyzing trace with hash -1226578041, now seen corresponding path program 1 times [2019-09-07 12:58:12,765 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:58:12,765 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:58:12,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:58:12,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 12:58:12,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:58:12,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:58:12,805 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-07 12:58:12,806 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 12:58:12,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 12:58:12,806 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 12:58:12,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 12:58:12,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 12:58:12,807 INFO L87 Difference]: Start difference. First operand 146 states and 158 transitions. Second operand 3 states. [2019-09-07 12:58:12,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:58:12,834 INFO L93 Difference]: Finished difference Result 192 states and 211 transitions. [2019-09-07 12:58:12,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 12:58:12,835 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2019-09-07 12:58:12,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:58:12,836 INFO L225 Difference]: With dead ends: 192 [2019-09-07 12:58:12,836 INFO L226 Difference]: Without dead ends: 158 [2019-09-07 12:58:12,836 INFO L628 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 [2019-09-07 12:58:12,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-09-07 12:58:12,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 152. [2019-09-07 12:58:12,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-09-07 12:58:12,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 165 transitions. [2019-09-07 12:58:12,854 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 165 transitions. Word has length 116 [2019-09-07 12:58:12,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:58:12,854 INFO L475 AbstractCegarLoop]: Abstraction has 152 states and 165 transitions. [2019-09-07 12:58:12,854 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 12:58:12,854 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 165 transitions. [2019-09-07 12:58:12,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-07 12:58:12,855 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:58:12,855 INFO L399 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] [2019-09-07 12:58:12,855 INFO L418 AbstractCegarLoop]: === Iteration 83 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:58:12,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:58:12,856 INFO L82 PathProgramCache]: Analyzing trace with hash 1619619274, now seen corresponding path program 1 times [2019-09-07 12:58:12,856 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:58:12,856 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:58:12,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:58:12,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 12:58:12,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:58:12,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:58:12,955 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-07 12:58:12,955 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 12:58:12,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-07 12:58:12,956 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-07 12:58:12,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-07 12:58:12,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-09-07 12:58:12,957 INFO L87 Difference]: Start difference. First operand 152 states and 165 transitions. Second operand 11 states. [2019-09-07 12:58:13,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:58:13,655 INFO L93 Difference]: Finished difference Result 152 states and 165 transitions. [2019-09-07 12:58:13,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-07 12:58:13,655 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 116 [2019-09-07 12:58:13,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:58:13,656 INFO L225 Difference]: With dead ends: 152 [2019-09-07 12:58:13,656 INFO L226 Difference]: Without dead ends: 0 [2019-09-07 12:58:13,657 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=273, Unknown=0, NotChecked=0, Total=342 [2019-09-07 12:58:13,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-07 12:58:13,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-07 12:58:13,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-07 12:58:13,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-07 12:58:13,658 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 116 [2019-09-07 12:58:13,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:58:13,659 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-07 12:58:13,659 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-07 12:58:13,659 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-07 12:58:13,659 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-07 12:58:13,666 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-09-07 12:58:16,835 WARN L188 SmtUtils]: Spent 434.00 ms on a formula simplification. DAG size of input: 177 DAG size of output: 1 [2019-09-07 12:58:16,959 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 50 [2019-09-07 12:58:17,092 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 50 [2019-09-07 12:58:17,248 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 54 [2019-09-07 12:58:17,409 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 57 [2019-09-07 12:58:18,119 WARN L188 SmtUtils]: Spent 674.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 73 [2019-09-07 12:58:18,650 WARN L188 SmtUtils]: Spent 528.00 ms on a formula simplification. DAG size of input: 174 DAG size of output: 92 [2019-09-07 12:58:18,847 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 52 [2019-09-07 12:58:19,440 WARN L188 SmtUtils]: Spent 494.00 ms on a formula simplification. DAG size of input: 172 DAG size of output: 90 [2019-09-07 12:58:19,552 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 54 [2019-09-07 12:58:19,675 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 57 [2019-09-07 12:58:19,887 WARN L188 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 64 [2019-09-07 12:58:20,750 WARN L188 SmtUtils]: Spent 793.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 98 [2019-09-07 12:58:21,239 WARN L188 SmtUtils]: Spent 481.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 54 [2019-09-07 12:58:21,954 WARN L188 SmtUtils]: Spent 710.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 95 [2019-09-07 12:58:22,106 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 70 [2019-09-07 12:58:22,437 WARN L188 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 55 [2019-09-07 12:58:22,553 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 56 [2019-09-07 12:58:22,992 WARN L188 SmtUtils]: Spent 436.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 77 [2019-09-07 12:58:23,304 WARN L188 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 67 [2019-09-07 12:58:24,602 WARN L188 SmtUtils]: Spent 1.25 s on a formula simplification. DAG size of input: 191 DAG size of output: 100 [2019-09-07 12:58:24,707 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 50 [2019-09-07 12:58:24,815 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 61 [2019-09-07 12:58:24,919 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 57 [2019-09-07 12:58:25,040 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 41 [2019-09-07 12:58:25,337 WARN L188 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 67 [2019-09-07 12:58:25,638 WARN L188 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 58 [2019-09-07 12:58:26,411 WARN L188 SmtUtils]: Spent 769.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 98 [2019-09-07 12:58:27,599 WARN L188 SmtUtils]: Spent 1.18 s on a formula simplification. DAG size of input: 197 DAG size of output: 97 [2019-09-07 12:58:28,048 WARN L188 SmtUtils]: Spent 404.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 60 [2019-09-07 12:58:28,151 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 50 [2019-09-07 12:58:28,830 WARN L188 SmtUtils]: Spent 674.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 75 [2019-09-07 12:58:29,061 WARN L188 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 57 [2019-09-07 12:58:29,513 WARN L188 SmtUtils]: Spent 450.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 79 [2019-09-07 12:58:29,931 WARN L188 SmtUtils]: Spent 415.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 77 [2019-09-07 12:58:30,063 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 66 [2019-09-07 12:58:30,331 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 52 [2019-09-07 12:58:30,434 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 1 [2019-09-07 12:58:30,548 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 57 [2019-09-07 12:58:30,787 WARN L188 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 67 [2019-09-07 12:58:31,576 WARN L188 SmtUtils]: Spent 783.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 98 [2019-09-07 12:58:32,018 WARN L188 SmtUtils]: Spent 439.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 69 [2019-09-07 12:58:32,158 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 52 [2019-09-07 12:58:32,266 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 50 [2019-09-07 12:58:32,444 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 57 [2019-09-07 12:58:33,030 WARN L188 SmtUtils]: Spent 584.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 80 [2019-09-07 12:58:33,392 WARN L188 SmtUtils]: Spent 359.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 73 [2019-09-07 12:58:33,645 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 71 [2019-09-07 12:58:33,898 WARN L188 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 61 [2019-09-07 12:58:34,196 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 52 [2019-09-07 12:58:34,308 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 50 [2019-09-07 12:58:34,578 WARN L188 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 61 [2019-09-07 12:58:34,687 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 50 [2019-09-07 12:58:34,878 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 54 [2019-09-07 12:58:35,092 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 57 [2019-09-07 12:58:35,204 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 62 [2019-09-07 12:58:35,393 WARN L188 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 61 [2019-09-07 12:58:35,744 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 55 [2019-09-07 12:58:36,201 WARN L188 SmtUtils]: Spent 455.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 88 [2019-09-07 12:58:36,631 WARN L188 SmtUtils]: Spent 428.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 77 [2019-09-07 12:58:37,308 WARN L188 SmtUtils]: Spent 673.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 82 [2019-09-07 12:58:37,658 WARN L188 SmtUtils]: Spent 345.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 1 [2019-09-07 12:58:38,254 WARN L188 SmtUtils]: Spent 594.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 91 [2019-09-07 12:58:38,435 WARN L188 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 1 [2019-09-07 12:58:38,544 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 50 [2019-09-07 12:58:39,164 WARN L188 SmtUtils]: Spent 476.00 ms on a formula simplification. DAG size of input: 172 DAG size of output: 90 [2019-09-07 12:58:39,300 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 52 [2019-09-07 12:58:39,408 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 69 [2019-09-07 12:58:39,539 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 52 [2019-09-07 12:58:39,642 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 57 [2019-09-07 12:58:39,761 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 54 [2019-09-07 12:58:39,865 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 52 [2019-09-07 12:58:40,009 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 52 [2019-09-07 12:58:40,118 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 50 [2019-09-07 12:58:40,899 WARN L188 SmtUtils]: Spent 777.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 98 [2019-09-07 12:58:41,006 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 50 [2019-09-07 12:58:42,188 WARN L188 SmtUtils]: Spent 1.18 s on a formula simplification. DAG size of input: 197 DAG size of output: 97 [2019-09-07 12:58:42,294 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 61 [2019-09-07 12:58:42,592 WARN L188 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 61 [2019-09-07 12:58:42,748 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 67 [2019-09-07 12:58:42,855 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 50 [2019-09-07 12:58:43,257 WARN L188 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 67 [2019-09-07 12:58:43,424 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 55 [2019-09-07 12:58:43,531 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 57 [2019-09-07 12:58:43,756 WARN L188 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 51 [2019-09-07 12:58:43,949 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 50 [2019-09-07 12:58:44,384 WARN L188 SmtUtils]: Spent 425.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 70 [2019-09-07 12:58:44,619 WARN L188 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 67 [2019-09-07 12:58:44,814 WARN L188 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 46 [2019-09-07 12:58:44,928 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 54 [2019-09-07 12:58:45,125 WARN L188 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 66 [2019-09-07 12:58:45,245 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 41 [2019-09-07 12:58:45,622 WARN L188 SmtUtils]: Spent 374.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 89 [2019-09-07 12:58:45,800 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 57 [2019-09-07 12:58:46,221 WARN L188 SmtUtils]: Spent 418.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 66 [2019-09-07 12:58:46,982 WARN L188 SmtUtils]: Spent 759.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 87 [2019-09-07 12:58:47,141 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 1 [2019-09-07 12:58:47,383 WARN L188 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 69 [2019-09-07 12:58:48,523 WARN L188 SmtUtils]: Spent 1.14 s on a formula simplification. DAG size of input: 180 DAG size of output: 95 [2019-09-07 12:58:49,176 WARN L188 SmtUtils]: Spent 651.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 88 [2019-09-07 12:58:49,779 WARN L188 SmtUtils]: Spent 600.00 ms on a formula simplification. DAG size of input: 196 DAG size of output: 86 [2019-09-07 12:58:49,881 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 57 [2019-09-07 12:58:50,189 WARN L188 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 69 [2019-09-07 12:58:50,294 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 57 [2019-09-07 12:58:50,403 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 57 [2019-09-07 12:58:50,974 WARN L188 SmtUtils]: Spent 567.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 80 [2019-09-07 12:58:51,080 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 1 [2019-09-07 12:58:51,577 WARN L188 SmtUtils]: Spent 495.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 78 [2019-09-07 12:58:51,847 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 62 [2019-09-07 12:58:52,045 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 57 [2019-09-07 12:58:52,520 WARN L188 SmtUtils]: Spent 472.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 75 [2019-09-07 12:58:52,812 WARN L188 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 67 [2019-09-07 12:58:53,057 WARN L188 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 61 [2019-09-07 12:58:53,339 WARN L188 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 52 [2019-09-07 12:58:53,580 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 50 [2019-09-07 12:58:53,837 WARN L188 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 80 [2019-09-07 12:58:54,016 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 62 [2019-09-07 12:58:54,214 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 57 [2019-09-07 12:58:54,456 WARN L188 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 64 [2019-09-07 12:58:54,672 WARN L188 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 57 [2019-09-07 12:58:54,877 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 54 [2019-09-07 12:58:55,363 WARN L188 SmtUtils]: Spent 483.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 79 [2019-09-07 12:58:55,469 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 1 [2019-09-07 12:58:55,894 WARN L188 SmtUtils]: Spent 423.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 83 [2019-09-07 12:58:56,697 WARN L188 SmtUtils]: Spent 629.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 84 [2019-09-07 12:58:56,910 WARN L188 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 64 [2019-09-07 12:58:57,112 WARN L188 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 54 [2019-09-07 12:58:57,282 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 62 [2019-09-07 12:58:57,286 INFO L443 ceAbstractionStarter]: For program point SendSrbSynchronousEXIT(lines 84 129) no Hoare annotation was computed. [2019-09-07 12:58:57,286 INFO L439 ceAbstractionStarter]: At program point L122(line 122) the Hoare annotation is: (let ((.cse0 (not (<= (+ ~NP~0 2) ~SKIP1~0))) (.cse4 (not (<= (+ ~SKIP2~0 3) ~IPC~0))) (.cse1 (not (<= (+ ~NP~0 5) ~MPR3~0))) (.cse2 (not (= |old(~s~0)| ~NP~0))) (.cse3 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse5 (not (= 0 ~pended~0))) (.cse6 (not (<= (+ ~DC~0 2) ~SKIP2~0)))) (and (or .cse0 (or .cse1 .cse2 (not (= ~compRegistered~0 0))) (not (= 0 ~routine~0)) .cse3 .cse4 .cse5 .cse6) (or (or .cse0 .cse4 (or .cse1 .cse2 .cse3 .cse5 (not (<= 1 ~compRegistered~0)) (not (= 1 ~routine~0))) .cse6) (not (<= 0 ~myStatus~0)) (not (= |old(~customIrp~0)| 0))))) [2019-09-07 12:58:57,286 INFO L443 ceAbstractionStarter]: For program point L122-1(line 122) no Hoare annotation was computed. [2019-09-07 12:58:57,286 INFO L443 ceAbstractionStarter]: For program point L120(lines 120 125) no Hoare annotation was computed. [2019-09-07 12:58:57,287 INFO L443 ceAbstractionStarter]: For program point L120-2(lines 120 125) no Hoare annotation was computed. [2019-09-07 12:58:57,287 INFO L439 ceAbstractionStarter]: At program point SendSrbSynchronousENTRY(lines 84 129) the Hoare annotation is: (let ((.cse0 (not (<= (+ ~NP~0 2) ~SKIP1~0))) (.cse4 (not (<= (+ ~SKIP2~0 3) ~IPC~0))) (.cse1 (not (<= (+ ~NP~0 5) ~MPR3~0))) (.cse2 (not (= |old(~s~0)| ~NP~0))) (.cse3 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse6 (not (= 0 ~pended~0))) (.cse7 (not (<= (+ ~DC~0 2) ~SKIP2~0))) (.cse5 (= ~s~0 |old(~s~0)|))) (and (or .cse0 (or .cse1 .cse2 (not (= ~compRegistered~0 0))) (not (= 0 ~routine~0)) .cse3 .cse4 .cse5 .cse6 .cse7) (or (or .cse0 .cse4 (or .cse1 .cse2 .cse3 .cse6 (not (<= 1 ~compRegistered~0)) (not (= 1 ~routine~0))) .cse7) (and .cse5 (= |old(~customIrp~0)| ~customIrp~0)) (not (<= 0 ~myStatus~0)) (not (= |old(~customIrp~0)| 0))))) [2019-09-07 12:58:57,287 INFO L443 ceAbstractionStarter]: For program point SendSrbSynchronousFINAL(lines 84 129) no Hoare annotation was computed. [2019-09-07 12:58:57,287 INFO L443 ceAbstractionStarter]: For program point L102(lines 102 114) no Hoare annotation was computed. [2019-09-07 12:58:57,287 INFO L443 ceAbstractionStarter]: For program point L102-2(lines 100 128) no Hoare annotation was computed. [2019-09-07 12:58:57,287 INFO L443 ceAbstractionStarter]: For program point _BLAST_initFINAL(lines 62 83) no Hoare annotation was computed. [2019-09-07 12:58:57,288 INFO L439 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(~DC~0)|)) (not (= 0 ~routine~0)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (and (= ~s~0 ~MPR1~0) (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~s~0 ~UNLOADED~0) (= ~s~0 |old(~s~0)|) (= ~s~0 ~SKIP2~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~SKIP1~0 ~s~0) (= ~s~0 ~IPC~0) (= ~s~0 ~NP~0) (= ~s~0 ~DC~0) (= ~MPR3~0 ~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))) [2019-09-07 12:58:57,288 INFO L443 ceAbstractionStarter]: For program point _BLAST_initEXIT(lines 62 83) no Hoare annotation was computed. [2019-09-07 12:58:57,288 INFO L443 ceAbstractionStarter]: For program point L172(lines 171 188) no Hoare annotation was computed. [2019-09-07 12:58:57,288 INFO L439 ceAbstractionStarter]: At program point L189(lines 161 199) the Hoare annotation is: (let ((.cse0 (+ ~myStatus~0 1073741637))) (let ((.cse1 (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (<= 0 .cse0)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|))))) (and (or (not (<= .cse0 0)) .cse1) (or .cse1 (and (and (= 0 ~pended~0) (= ~s~0 ~NP~0) (<= 1 ~compRegistered~0) (= ~routine~0 1)) (= |old(~customIrp~0)| ~customIrp~0)) (not (<= 0 ~myStatus~0)) (not (= |old(~customIrp~0)| 0)))))) [2019-09-07 12:58:57,288 INFO L443 ceAbstractionStarter]: For program point CdAudioStartDeviceFINAL(lines 140 216) no Hoare annotation was computed. [2019-09-07 12:58:57,288 INFO L443 ceAbstractionStarter]: For program point L202(lines 202 204) no Hoare annotation was computed. [2019-09-07 12:58:57,288 INFO L443 ceAbstractionStarter]: For program point L165(lines 165 168) no Hoare annotation was computed. [2019-09-07 12:58:57,288 INFO L439 ceAbstractionStarter]: At program point CdAudioStartDeviceENTRY(lines 140 216) the Hoare annotation is: (let ((.cse0 (+ ~myStatus~0 1073741637))) (let ((.cse3 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse7 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse6 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse8 (<= 0 .cse0)) (.cse4 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse5 (<= (+ ~DC~0 2) ~SKIP2~0))) (let ((.cse2 (and .cse3 (= 0 ~pended~0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) .cse7 .cse6 (= ~s~0 |old(~s~0)|) (= 0 ~routine~0) .cse8 .cse4 .cse5)) (.cse1 (or (not .cse3) (not .cse4) (not .cse5) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| ~NP~0)) (not .cse6) (not .cse7) (not .cse8) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|))))) (and (or (not (<= .cse0 0)) .cse1 .cse2) (or (and .cse2 (= |old(~customIrp~0)| ~customIrp~0)) .cse1 (not (<= 0 ~myStatus~0)) (not (= |old(~customIrp~0)| 0))))))) [2019-09-07 12:58:57,288 INFO L443 ceAbstractionStarter]: For program point L161(lines 161 199) no Hoare annotation was computed. [2019-09-07 12:58:57,289 INFO L443 ceAbstractionStarter]: For program point CdAudioStartDeviceEXIT(lines 140 216) no Hoare annotation was computed. [2019-09-07 12:58:57,289 INFO L443 ceAbstractionStarter]: For program point L161-2(lines 161 199) no Hoare annotation was computed. [2019-09-07 12:58:57,289 INFO L443 ceAbstractionStarter]: For program point L157(lines 157 159) no Hoare annotation was computed. [2019-09-07 12:58:57,289 INFO L443 ceAbstractionStarter]: For program point L186(line 186) no Hoare annotation was computed. [2019-09-07 12:58:57,289 INFO L443 ceAbstractionStarter]: For program point L178(lines 178 180) no Hoare annotation was computed. [2019-09-07 12:58:57,289 INFO L443 ceAbstractionStarter]: For program point L207(lines 207 209) no Hoare annotation was computed. [2019-09-07 12:58:57,289 INFO L439 ceAbstractionStarter]: At program point L207-2(lines 207 209) the Hoare annotation is: (let ((.cse1 (+ ~myStatus~0 1073741637))) (let ((.cse0 (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (<= 0 .cse1)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|))))) (and (or (and (= |old(~customIrp~0)| ~customIrp~0) (and (= 0 ~pended~0) (= ~s~0 ~NP~0) (<= 1 ~compRegistered~0) (= ~routine~0 1))) .cse0 (not (<= 0 ~myStatus~0)) (not (= |old(~customIrp~0)| 0))) (or (not (<= .cse1 0)) .cse0)))) [2019-09-07 12:58:57,289 INFO L439 ceAbstractionStarter]: At program point L154(line 154) the Hoare annotation is: (let ((.cse0 (+ ~myStatus~0 1073741637))) (let ((.cse3 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse7 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse6 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse8 (<= 0 .cse0)) (.cse4 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse5 (<= (+ ~DC~0 2) ~SKIP2~0))) (let ((.cse2 (and .cse3 (= 0 ~pended~0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) .cse7 .cse6 (= ~s~0 |old(~s~0)|) (= 0 ~routine~0) .cse8 .cse4 .cse5)) (.cse1 (or (not .cse3) (not .cse4) (not .cse5) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| ~NP~0)) (not .cse6) (not .cse7) (not .cse8) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|))))) (and (or (not (<= .cse0 0)) .cse1 .cse2) (or (and .cse2 (= |old(~customIrp~0)| ~customIrp~0)) .cse1 (not (<= 0 ~myStatus~0)) (not (= |old(~customIrp~0)| 0))))))) [2019-09-07 12:58:57,289 INFO L443 ceAbstractionStarter]: For program point L154-1(line 154) no Hoare annotation was computed. [2019-09-07 12:58:57,289 INFO L443 ceAbstractionStarter]: For program point L212(line 212) no Hoare annotation was computed. [2019-09-07 12:58:57,290 INFO L439 ceAbstractionStarter]: At program point L175(lines 175 183) the Hoare annotation is: (let ((.cse1 (+ ~myStatus~0 1073741637))) (let ((.cse0 (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (<= 0 .cse1)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|))))) (and (or .cse0 (not (<= 0 ~myStatus~0)) (not (= |old(~customIrp~0)| 0)) (and (and (= 0 ~pended~0) (= ~s~0 ~NP~0) (<= 1 ~compRegistered~0) (= ~routine~0 1)) (= |old(~customIrp~0)| ~customIrp~0))) (or (not (<= .cse1 0)) .cse0)))) [2019-09-07 12:58:57,290 INFO L439 ceAbstractionStarter]: At program point L171-2(lines 171 188) the Hoare annotation is: (let ((.cse1 (+ ~myStatus~0 1073741637))) (let ((.cse0 (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (<= 0 .cse1)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|))))) (and (or .cse0 (not (<= 0 ~myStatus~0)) (not (= |old(~customIrp~0)| 0)) (and (and (= 0 ~pended~0) (= ~s~0 ~NP~0) (<= 1 ~compRegistered~0) (= ~routine~0 1)) (= |old(~customIrp~0)| ~customIrp~0))) (or (not (<= .cse1 0)) .cse0)))) [2019-09-07 12:58:57,290 INFO L443 ceAbstractionStarter]: For program point L882-2(lines 882 884) no Hoare annotation was computed. [2019-09-07 12:58:57,290 INFO L439 ceAbstractionStarter]: At program point AG_SetStatusAndReturnENTRY(lines 876 892) the Hoare annotation is: (let ((.cse0 (not (<= (+ ~NP~0 2) ~SKIP1~0))) (.cse1 (not (<= (+ ~NP~0 5) ~MPR3~0))) (.cse2 (not (= 0 ~routine~0))) (.cse3 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse4 (not (<= (+ ~SKIP2~0 3) ~IPC~0))) (.cse5 (not (= 0 ~pended~0))) (.cse6 (not (<= (+ ~DC~0 2) ~SKIP2~0))) (.cse7 (or (not (= |old(~s~0)| ~NP~0)) (not (= ~compRegistered~0 0))))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ~s~0 |old(~s~0)|) .cse6 .cse7) (or (= ~myStatus~0 |old(~myStatus~0)|) (or .cse0 .cse1 .cse2 .cse3 .cse4 (not (<= 0 (+ |old(~myStatus~0)| 1073741637))) .cse5 .cse6 .cse7)))) [2019-09-07 12:58:57,290 INFO L443 ceAbstractionStarter]: For program point AG_SetStatusAndReturnEXIT(lines 876 892) no Hoare annotation was computed. [2019-09-07 12:58:57,290 INFO L439 ceAbstractionStarter]: At program point L888(line 888) the Hoare annotation is: (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (= 0 ~routine~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (and (= ~s~0 |old(~s~0)|) (<= AG_SetStatusAndReturn_~status |AG_SetStatusAndReturn_#in~status|)) (not (= 0 ~pended~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (or (not (= |old(~s~0)| ~NP~0)) (not (= ~compRegistered~0 0)))) [2019-09-07 12:58:57,290 INFO L443 ceAbstractionStarter]: For program point L888-1(line 888) no Hoare annotation was computed. [2019-09-07 12:58:57,290 INFO L443 ceAbstractionStarter]: For program point AG_SetStatusAndReturnFINAL(lines 876 892) no Hoare annotation was computed. [2019-09-07 12:58:57,290 INFO L443 ceAbstractionStarter]: For program point L882(lines 882 884) no Hoare annotation was computed. [2019-09-07 12:58:57,291 INFO L439 ceAbstractionStarter]: At program point L1786(lines 1785 1816) the Hoare annotation is: (let ((.cse12 (+ ~myStatus~0 1073741637))) (let ((.cse2 (<= .cse12 0)) (.cse0 (= ~myStatus~0 0))) (let ((.cse1 (let ((.cse3 (let ((.cse5 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse6 (= 0 ~pended~0)) (.cse7 (= ~s~0 ~NP~0)) (.cse8 (= 0 ~compRegistered~0)) (.cse9 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse10 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse11 (= 0 ~routine~0)) (.cse13 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse14 (<= (+ ~DC~0 2) ~SKIP2~0))) (or (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (<= 0 .cse12) (not .cse0) .cse13 .cse14) (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 (= ~myStatus~0 |old(~myStatus~0)|))))) (.cse4 (= |old(~customIrp~0)| ~customIrp~0))) (or (and .cse3 .cse4 (<= 0 ~myStatus~0)) (and .cse3 .cse2 .cse4))))) (or (and .cse0 .cse1) (not (= |old(~myStatus~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 |old(~routine~0)|)) (and .cse1 .cse2) (not (= |old(~compRegistered~0)| 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)))))) [2019-09-07 12:58:57,291 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 1716 1878) no Hoare annotation was computed. [2019-09-07 12:58:57,291 INFO L443 ceAbstractionStarter]: For program point L1844(lines 1844 1850) no Hoare annotation was computed. [2019-09-07 12:58:57,291 INFO L439 ceAbstractionStarter]: At program point L1820(line 1820) the Hoare annotation is: (let ((.cse9 (<= (+ ~NP~0 5) ~MPR3~0))) (let ((.cse2 (= main_~status~9 0)) (.cse6 (= ~s~0 ~SKIP2~0)) (.cse0 (= ~s~0 ~IPC~0)) (.cse1 (= main_~status~9 ~lowerDriverReturn~0)) (.cse8 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse4 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse7 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse3 (and (= 0 ~pended~0) .cse9)) (.cse5 (<= (+ ~SKIP1~0 2) ~MPR1~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)) (and .cse0 .cse1 (<= (+ ~DC~0 5) ~IPC~0) .cse4 .cse3 .cse5) (and .cse1 .cse6 .cse2 .cse3) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (and .cse1 .cse6 .cse4 .cse7 .cse3 .cse5) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= 0 |old(~pended~0)|)) (and .cse0 .cse8 .cse1 .cse9 .cse4 .cse7 .cse5 (= 0 ~routine~0) (<= 1 ~compRegistered~0)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (and (and .cse8 .cse4 .cse7 .cse3 .cse5 (= ~s~0 ~DC~0)) (not (= main_~status~9 259))) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0))))) [2019-09-07 12:58:57,291 INFO L439 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(~DC~0)|)) (not (= 0 |old(~routine~0)|)) (and (= ~s~0 ~MPR1~0) (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~s~0 ~UNLOADED~0) (= 0 ~routine~0) (= ~s~0 ~SKIP2~0) (= ~myStatus~0 |old(~myStatus~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~SKIP1~0 ~s~0) (= ~s~0 ~IPC~0) (= ~s~0 ~NP~0) (= ~s~0 ~DC~0) (= ~MPR3~0 ~s~0)) (not (= |old(~compRegistered~0)| 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))) [2019-09-07 12:58:57,291 INFO L443 ceAbstractionStarter]: For program point L1754-1(lines 1726 1877) no Hoare annotation was computed. [2019-09-07 12:58:57,291 INFO L443 ceAbstractionStarter]: For program point L1771(lines 1756 1823) no Hoare annotation was computed. [2019-09-07 12:58:57,291 INFO L439 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))) [2019-09-07 12:58:57,292 INFO L439 ceAbstractionStarter]: At program point L1813(lines 1756 1823) the Hoare annotation is: (let ((.cse9 (<= (+ ~NP~0 5) ~MPR3~0))) (let ((.cse2 (= main_~status~9 0)) (.cse6 (= ~s~0 ~SKIP2~0)) (.cse0 (= ~s~0 ~IPC~0)) (.cse1 (= main_~status~9 ~lowerDriverReturn~0)) (.cse8 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse4 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse7 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse3 (and (= 0 ~pended~0) .cse9)) (.cse5 (<= (+ ~SKIP1~0 2) ~MPR1~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)) (and .cse0 .cse1 (<= (+ ~DC~0 5) ~IPC~0) .cse4 .cse3 .cse5) (and .cse1 .cse6 .cse2 .cse3) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (and .cse1 .cse6 .cse4 .cse7 .cse3 .cse5) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= 0 |old(~pended~0)|)) (and .cse0 .cse8 .cse1 .cse9 .cse4 .cse7 .cse5 (= 0 ~routine~0) (<= 1 ~compRegistered~0)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (and (and .cse8 .cse4 .cse7 .cse3 .cse5 (= ~s~0 ~DC~0)) (not (= main_~status~9 259))) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0))))) [2019-09-07 12:58:57,292 INFO L443 ceAbstractionStarter]: For program point L1780(lines 1780 1817) no Hoare annotation was computed. [2019-09-07 12:58:57,292 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 1716 1878) no Hoare annotation was computed. [2019-09-07 12:58:57,292 INFO L443 ceAbstractionStarter]: For program point L1797(line 1797) no Hoare annotation was computed. [2019-09-07 12:58:57,292 INFO L439 ceAbstractionStarter]: At program point L1855(lines 1842 1871) the Hoare annotation is: (let ((.cse2 (= main_~status~9 ~lowerDriverReturn~0)) (.cse3 (<= (+ ~NP~0 5) ~MPR3~0))) (let ((.cse0 (let ((.cse4 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse5 (<= (+ ~SKIP1~0 2) ~MPR1~0))) (or (and .cse4 (and .cse2 .cse3) .cse5) (and (= ~s~0 ~DC~0) (and .cse3 .cse4 .cse5)))))) (let ((.cse1 (and .cse0 (<= (+ ~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 (<= (+ ~DC~0 5) ~IPC~0) (<= ~IPC~0 ~s~0)) (and (<= ~SKIP2~0 ~s~0) .cse1) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 |old(~routine~0)|)) (not (= |old(~compRegistered~0)| 0)) (and .cse2 (= main_~status~9 0) .cse3) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (and (not (= main_~status~9 259)) (and (<= (+ ~NP~0 2) ~SKIP1~0) .cse1)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0)))))) [2019-09-07 12:58:57,292 INFO L439 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(~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 (= ~s~0 ~MPR1~0) (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~s~0 ~UNLOADED~0) (= ~s~0 |old(~s~0)|) (= 0 ~routine~0) (= ~s~0 ~SKIP2~0) (= ~myStatus~0 |old(~myStatus~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~SKIP1~0 ~s~0) (= ~s~0 ~IPC~0) (= ~s~0 ~NP~0) (= ~s~0 ~DC~0) (= ~MPR3~0 ~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))) [2019-09-07 12:58:57,292 INFO L443 ceAbstractionStarter]: For program point L1756(lines 1726 1877) no Hoare annotation was computed. [2019-09-07 12:58:57,292 INFO L439 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 (= 0 ~routine~0)) (.cse7 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse8 (<= (+ ~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)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 |old(~routine~0)|)) (not (= |old(~compRegistered~0)| 0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= (+ ~myStatus~0 1) 0) (<= 0 (+ ~myStatus~0 1073741637)) .cse7 .cse8) (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)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= ~myStatus~0 |old(~myStatus~0)|)))) [2019-09-07 12:58:57,293 INFO L439 ceAbstractionStarter]: At program point L1839(lines 1832 1874) the Hoare annotation is: (let ((.cse0 (= ~s~0 ~IPC~0)) (.cse5 (= main_~status~9 0)) (.cse1 (= main_~status~9 ~lowerDriverReturn~0)) (.cse7 (= ~s~0 ~SKIP2~0)) (.cse2 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse6 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse3 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse4 (<= (+ ~NP~0 5) ~MPR3~0))) (or (not (= |old(~myStatus~0)| 0)) (= ~s~0 ~UNLOADED~0) (and .cse0 .cse1 (<= (+ ~DC~0 5) ~IPC~0) .cse2 .cse3 .cse4) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (and .cse0 .cse1 .cse5 .cse4) (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 (not (= main_~status~9 259)) (and (<= (+ ~NP~0 2) ~SKIP1~0) .cse2 .cse6 .cse3 (= ~s~0 ~DC~0) .cse4)) (and .cse1 .cse7 .cse5 .cse4) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= 0 |old(~pended~0)|)) (and .cse1 .cse7 .cse2 .cse6 .cse3 .cse4) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0)))) [2019-09-07 12:58:57,293 INFO L443 ceAbstractionStarter]: For program point L1864(lines 1864 1868) no Hoare annotation was computed. [2019-09-07 12:58:57,293 INFO L439 ceAbstractionStarter]: At program point L1831(lines 1824 1875) the Hoare annotation is: (let ((.cse9 (<= (+ ~NP~0 5) ~MPR3~0))) (let ((.cse5 (= ~s~0 ~SKIP2~0)) (.cse0 (= ~s~0 ~IPC~0)) (.cse1 (= main_~status~9 ~lowerDriverReturn~0)) (.cse7 (= main_~status~9 0)) (.cse8 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse2 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse6 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse3 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse4 (and .cse9 (= 0 ~pended~0)))) (or (not (= |old(~myStatus~0)| 0)) (= ~s~0 ~UNLOADED~0) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (and .cse0 .cse1 (<= (+ ~DC~0 5) ~IPC~0) .cse2 .cse3 .cse4) (and .cse1 .cse5 .cse2 .cse6 .cse3 .cse4) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 |old(~routine~0)|)) (not (= |old(~compRegistered~0)| 0)) (and .cse1 .cse5 .cse7 .cse4) (and .cse0 .cse8 .cse1 .cse9 .cse2 .cse6 .cse3 (= 0 ~routine~0) (<= 1 ~compRegistered~0)) (and .cse0 .cse1 .cse7 .cse4) (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 (and .cse8 .cse2 .cse6 .cse3 (= ~s~0 ~DC~0) .cse4) (not (= main_~status~9 259))) (not (= |old(~customIrp~0)| 0))))) [2019-09-07 12:58:57,293 INFO L443 ceAbstractionStarter]: For program point L1790(lines 1790 1815) no Hoare annotation was computed. [2019-09-07 12:58:57,293 INFO L443 ceAbstractionStarter]: For program point L1840(lines 1824 1875) no Hoare annotation was computed. [2019-09-07 12:58:57,293 INFO L443 ceAbstractionStarter]: For program point L1807(line 1807) no Hoare annotation was computed. [2019-09-07 12:58:57,293 INFO L443 ceAbstractionStarter]: For program point L1766(lines 1766 1769) no Hoare annotation was computed. [2019-09-07 12:58:57,294 INFO L439 ceAbstractionStarter]: At program point L1766-2(lines 1766 1769) the Hoare annotation is: (or (let ((.cse1 (+ ~myStatus~0 1073741637))) (let ((.cse0 (let ((.cse3 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse4 (= 0 ~pended~0)) (.cse5 (= ~s~0 ~NP~0)) (.cse6 (= 0 ~compRegistered~0)) (.cse7 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse8 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse9 (= 0 ~routine~0)) (.cse10 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse11 (<= (+ ~DC~0 2) ~SKIP2~0))) (or (and .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= (+ ~myStatus~0 1) 0) (<= 0 .cse1) .cse10 .cse11) (and .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= ~myStatus~0 |old(~myStatus~0)|))))) (.cse2 (= |old(~customIrp~0)| ~customIrp~0))) (or (and .cse0 (<= .cse1 0) .cse2) (and .cse0 .cse2 (<= 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)) (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))) [2019-09-07 12:58:57,294 INFO L443 ceAbstractionStarter]: For program point L1857(lines 1857 1869) no Hoare annotation was computed. [2019-09-07 12:58:57,294 INFO L439 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(~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)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= 0 |old(~pended~0)|)) (and (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= 0 ~routine~0)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0))) [2019-09-07 12:58:57,294 INFO L443 ceAbstractionStarter]: For program point L1841(lines 1841 1872) no Hoare annotation was computed. [2019-09-07 12:58:57,294 INFO L439 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))) [2019-09-07 12:58:57,294 INFO L443 ceAbstractionStarter]: For program point L1833(lines 1833 1837) no Hoare annotation was computed. [2019-09-07 12:58:57,294 INFO L443 ceAbstractionStarter]: For program point L1858(lines 1858 1862) no Hoare annotation was computed. [2019-09-07 12:58:57,294 INFO L443 ceAbstractionStarter]: For program point L1825(lines 1825 1829) no Hoare annotation was computed. [2019-09-07 12:58:57,294 INFO L443 ceAbstractionStarter]: For program point L1842(lines 1842 1871) no Hoare annotation was computed. [2019-09-07 12:58:57,294 INFO L446 ceAbstractionStarter]: At program point L1793(lines 1792 1815) the Hoare annotation is: true [2019-09-07 12:58:57,294 INFO L443 ceAbstractionStarter]: For program point L1785(lines 1785 1816) no Hoare annotation was computed. [2019-09-07 12:58:57,294 INFO L443 ceAbstractionStarter]: For program point L1843(lines 1843 1853) no Hoare annotation was computed. [2019-09-07 12:58:57,294 INFO L443 ceAbstractionStarter]: For program point L1802(line 1802) no Hoare annotation was computed. [2019-09-07 12:58:57,295 INFO L439 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))) [2019-09-07 12:58:57,295 INFO L439 ceAbstractionStarter]: At program point L1887(line 1887) the Hoare annotation is: (let ((.cse2 (+ ~myStatus~0 1073741637))) (let ((.cse0 (or (not (= ~setEventCalled~0 1)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ |old(~s~0)| 2) ~SKIP1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (= 1 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (<= 0 .cse2)) (not (= 0 ~pended~0)) (not (<= 1 ~compRegistered~0)))) (.cse1 (not (= ~customIrp~0 0)))) (and (or .cse0 (not (<= 0 ~myStatus~0)) .cse1) (or (not (<= .cse2 0)) .cse0 .cse1)))) [2019-09-07 12:58:57,295 INFO L443 ceAbstractionStarter]: For program point L1887-1(lines 1879 1892) no Hoare annotation was computed. [2019-09-07 12:58:57,295 INFO L439 ceAbstractionStarter]: At program point stubMoreProcessingRequiredENTRY(lines 1879 1892) the Hoare annotation is: (let ((.cse3 (+ ~myStatus~0 1073741637))) (let ((.cse11 (= ~setEventCalled~0 1)) (.cse9 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse10 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse6 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse5 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse8 (<= 0 .cse3)) (.cse4 (= 0 ~pended~0)) (.cse7 (<= 1 ~compRegistered~0))) (let ((.cse1 (or (not .cse11) (not .cse9) (not (<= (+ |old(~s~0)| 2) ~SKIP1~0)) (not .cse10) (not (= 1 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (not .cse6) (not .cse5) (not .cse8) (not .cse4) (not .cse7))) (.cse2 (not (= ~customIrp~0 0))) (.cse0 (and .cse4 .cse5 .cse6 (= ~s~0 |old(~s~0)|) .cse7 .cse8 .cse9 .cse10 (= ~NP~0 |old(~s~0)|) (= ~routine~0 1) (<= (+ ~s~0 2) ~SKIP1~0) .cse11))) (and (or .cse0 .cse1 (not (<= 0 ~myStatus~0)) .cse2) (or (or .cse1 .cse2) (not (<= .cse3 0)) .cse0))))) [2019-09-07 12:58:57,295 INFO L443 ceAbstractionStarter]: For program point stubMoreProcessingRequiredEXIT(lines 1879 1892) no Hoare annotation was computed. [2019-09-07 12:58:57,295 INFO L443 ceAbstractionStarter]: For program point L2079(lines 2079 2096) no Hoare annotation was computed. [2019-09-07 12:58:57,295 INFO L439 ceAbstractionStarter]: At program point L2075(lines 2074 2097) the Hoare annotation is: (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (= 0 ~routine~0)) (and (= 0 ~pended~0) (= ~SKIP1~0 ~s~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~DC~0 2) ~SKIP2~0))) [2019-09-07 12:58:57,295 INFO L439 ceAbstractionStarter]: At program point L2067(line 2067) the Hoare annotation is: (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (= 0 ~routine~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~DC~0 2) ~SKIP2~0))) [2019-09-07 12:58:57,295 INFO L443 ceAbstractionStarter]: For program point PoCallDriverEXIT(lines 2042 2126) no Hoare annotation was computed. [2019-09-07 12:58:57,296 INFO L439 ceAbstractionStarter]: At program point L2059(line 2059) the Hoare annotation is: (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (= 0 ~routine~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~DC~0 2) ~SKIP2~0))) [2019-09-07 12:58:57,296 INFO L443 ceAbstractionStarter]: For program point L2059-1(line 2059) no Hoare annotation was computed. [2019-09-07 12:58:57,296 INFO L443 ceAbstractionStarter]: For program point L2051(lines 2051 2071) no Hoare annotation was computed. [2019-09-07 12:58:57,296 INFO L443 ceAbstractionStarter]: For program point L2051-1(lines 2051 2071) no Hoare annotation was computed. [2019-09-07 12:58:57,296 INFO L439 ceAbstractionStarter]: At program point L2080(lines 2079 2096) the Hoare annotation is: (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (= 0 ~routine~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= 0 |old(~pended~0)|)) (and (= 0 ~pended~0) (= ~SKIP1~0 ~s~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0))) [2019-09-07 12:58:57,296 INFO L443 ceAbstractionStarter]: For program point PoCallDriverFINAL(lines 2042 2126) no Hoare annotation was computed. [2019-09-07 12:58:57,296 INFO L443 ceAbstractionStarter]: For program point L2105(lines 2105 2111) no Hoare annotation was computed. [2019-09-07 12:58:57,296 INFO L439 ceAbstractionStarter]: At program point PoCallDriverENTRY(lines 2042 2126) the Hoare annotation is: (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (= 0 ~routine~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= 0 |old(~pended~0)|)) (and (= 0 ~pended~0) (= ~SKIP1~0 ~s~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0))) [2019-09-07 12:58:57,296 INFO L443 ceAbstractionStarter]: For program point L2052(lines 2052 2062) no Hoare annotation was computed. [2019-09-07 12:58:57,297 INFO L443 ceAbstractionStarter]: For program point L2114(lines 2114 2121) no Hoare annotation was computed. [2019-09-07 12:58:57,297 INFO L443 ceAbstractionStarter]: For program point L2102(lines 2102 2122) no Hoare annotation was computed. [2019-09-07 12:58:57,297 INFO L443 ceAbstractionStarter]: For program point L2065(lines 2065 2069) no Hoare annotation was computed. [2019-09-07 12:58:57,297 INFO L439 ceAbstractionStarter]: At program point L2094(lines 2050 2125) the Hoare annotation is: (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (= ~SKIP1~0 |old(~s~0)|)) (and (= 0 ~pended~0) (= ~SKIP1~0 ~s~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (= 0 ~routine~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|))) [2019-09-07 12:58:57,297 INFO L443 ceAbstractionStarter]: For program point L2057(lines 2057 2061) no Hoare annotation was computed. [2019-09-07 12:58:57,297 INFO L443 ceAbstractionStarter]: For program point L2057-2(lines 2052 2062) no Hoare annotation was computed. [2019-09-07 12:58:57,297 INFO L443 ceAbstractionStarter]: For program point L2119-1(lines 2098 2123) no Hoare annotation was computed. [2019-09-07 12:58:57,297 INFO L439 ceAbstractionStarter]: At program point L2119(line 2119) the Hoare annotation is: (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (= 0 ~routine~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~DC~0 2) ~SKIP2~0))) [2019-09-07 12:58:57,297 INFO L439 ceAbstractionStarter]: At program point L2082(lines 2081 2096) the Hoare annotation is: (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (= 0 ~routine~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= 0 |old(~pended~0)|)) (and (= 0 ~pended~0) (= ~SKIP1~0 ~s~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0))) [2019-09-07 12:58:57,298 INFO L443 ceAbstractionStarter]: For program point L2074(lines 2074 2097) no Hoare annotation was computed. [2019-09-07 12:58:57,298 INFO L439 ceAbstractionStarter]: At program point L2054(line 2054) the Hoare annotation is: (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (= 0 ~routine~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~DC~0 2) ~SKIP2~0))) [2019-09-07 12:58:57,298 INFO L443 ceAbstractionStarter]: For program point L2054-1(line 2054) no Hoare annotation was computed. [2019-09-07 12:58:57,298 INFO L439 ceAbstractionStarter]: At program point L413(line 413) the Hoare annotation is: (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (= ~s~0 |old(~s~0)|) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= ~compRegistered~0 0)) (not (= 0 ~pended~0))) [2019-09-07 12:58:57,298 INFO L443 ceAbstractionStarter]: For program point L413-1(line 413) no Hoare annotation was computed. [2019-09-07 12:58:57,298 INFO L443 ceAbstractionStarter]: For program point L411(lines 411 416) no Hoare annotation was computed. [2019-09-07 12:58:57,298 INFO L439 ceAbstractionStarter]: At program point CdAudioIsPlayActiveENTRY(lines 387 431) the Hoare annotation is: (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (= ~s~0 |old(~s~0)|) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= ~compRegistered~0 0)) (not (= 0 ~pended~0))) [2019-09-07 12:58:57,299 INFO L443 ceAbstractionStarter]: For program point L411-2(lines 399 430) no Hoare annotation was computed. [2019-09-07 12:58:57,299 INFO L443 ceAbstractionStarter]: For program point L403(lines 403 405) no Hoare annotation was computed. [2019-09-07 12:58:57,299 INFO L443 ceAbstractionStarter]: For program point L406(lines 406 408) no Hoare annotation was computed. [2019-09-07 12:58:57,299 INFO L443 ceAbstractionStarter]: For program point CdAudioIsPlayActiveEXIT(lines 387 431) no Hoare annotation was computed. [2019-09-07 12:58:57,299 INFO L443 ceAbstractionStarter]: For program point L400(lines 400 402) no Hoare annotation was computed. [2019-09-07 12:58:57,299 INFO L443 ceAbstractionStarter]: For program point CdAudioIsPlayActiveFINAL(lines 387 431) no Hoare annotation was computed. [2019-09-07 12:58:57,299 INFO L443 ceAbstractionStarter]: For program point L423(lines 423 428) no Hoare annotation was computed. [2019-09-07 12:58:57,299 INFO L443 ceAbstractionStarter]: For program point L423-2(lines 423 428) no Hoare annotation was computed. [2019-09-07 12:58:57,300 INFO L439 ceAbstractionStarter]: At program point L2013(lines 2005 2024) the Hoare annotation is: (let ((.cse29 (+ ~myStatus~0 1073741637))) (let ((.cse17 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse11 (= 0 ~pended~0)) (.cse15 (<= 0 .cse29)) (.cse12 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse13 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse16 (<= (+ ~NP~0 5) ~MPR3~0))) (let ((.cse14 (<= 1 ~compRegistered~0)) (.cse28 (not (<= (+ ~NP~0 2) ~SKIP1~0))) (.cse19 (not .cse16)) (.cse22 (not (= |old(~s~0)| ~NP~0))) (.cse23 (not .cse13)) (.cse24 (not .cse12)) (.cse25 (not .cse15)) (.cse26 (not .cse11)) (.cse20 (not .cse17))) (let ((.cse9 (= ~s~0 |old(~s~0)|)) (.cse1 (= |old(~customIrp~0)| ~customIrp~0)) (.cse4 (not (<= 0 ~myStatus~0))) (.cse6 (not (<= .cse29 0))) (.cse10 (or .cse28 (or .cse19 .cse22 (not (= ~compRegistered~0 0))) (not (= 0 ~routine~0)) .cse23 .cse24 .cse25 .cse26 .cse20)) (.cse5 (not (= |old(~customIrp~0)| 0))) (.cse18 (not (= |old(~setEventCalled~0)| 1))) (.cse27 (not .cse14)) (.cse21 (not (= 1 ~routine~0)))) (let ((.cse2 (not (= |old(~s~0)| ~MPR3~0))) (.cse3 (or .cse18 .cse28 .cse25 .cse20 (or .cse23 .cse24 (or .cse19 .cse26 .cse27 .cse21)))) (.cse0 (and (or .cse4 .cse10 .cse5) (or .cse6 .cse10 .cse5))) (.cse8 (or .cse18 (not (<= (+ |old(~s~0)| 2) ~SKIP1~0)) .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27)) (.cse7 (and (and .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (= ~NP~0 |old(~s~0)|) (= ~routine~0 1) (<= (+ ~s~0 2) ~SKIP1~0) (= ~setEventCalled~0 1)) .cse9 .cse1))) (and (or (not (= ~myStatus~0 0)) .cse0 .cse1) (or .cse2 .cse3 .cse4 .cse5) (or .cse6 .cse2 .cse3 .cse5) (or .cse7 .cse8 .cse4 .cse5) (or .cse9 .cse10) (or .cse6 .cse1 .cse0) (or (or .cse6 .cse8 .cse5) .cse7))))))) [2019-09-07 12:58:57,300 INFO L443 ceAbstractionStarter]: For program point KeWaitForSingleObjectEXIT(lines 2000 2041) no Hoare annotation was computed. [2019-09-07 12:58:57,300 INFO L443 ceAbstractionStarter]: For program point L2005(lines 2005 2024) no Hoare annotation was computed. [2019-09-07 12:58:57,300 INFO L439 ceAbstractionStarter]: At program point L2030(lines 2029 2039) the Hoare annotation is: (let ((.cse30 (+ ~myStatus~0 1073741637))) (let ((.cse29 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse23 (= 0 ~pended~0)) (.cse27 (<= 0 .cse30)) (.cse24 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse25 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse28 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse22 (<= (+ ~NP~0 2) ~SKIP1~0))) (let ((.cse21 (not .cse22)) (.cse12 (not .cse28)) (.cse15 (not (= |old(~s~0)| ~NP~0))) (.cse16 (not .cse25)) (.cse17 (not .cse24)) (.cse18 (not .cse27)) (.cse19 (not .cse23)) (.cse13 (not .cse29)) (.cse26 (<= 1 ~compRegistered~0))) (let ((.cse11 (not (= |old(~setEventCalled~0)| 1))) (.cse20 (not .cse26)) (.cse14 (not (= 1 ~routine~0))) (.cse0 (= ~s~0 ~NP~0)) (.cse7 (= |old(~customIrp~0)| ~customIrp~0)) (.cse10 (not (<= 0 ~myStatus~0))) (.cse5 (not (<= .cse30 0))) (.cse1 (or .cse21 (or .cse12 .cse15 (not (= ~compRegistered~0 0))) (not (= 0 ~routine~0)) .cse16 .cse17 .cse18 .cse19 .cse13)) (.cse4 (not (= |old(~customIrp~0)| 0)))) (let ((.cse8 (and (or .cse10 .cse1 .cse4) (or .cse5 .cse1 .cse4))) (.cse6 (and (and .cse22 .cse23 .cse0 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 (= ~routine~0 1)) .cse7)) (.cse2 (not (= |old(~s~0)| ~MPR3~0))) (.cse3 (or .cse11 .cse21 .cse18 .cse13 (or .cse16 .cse17 (or .cse12 .cse19 .cse20 .cse14))))) (and (or .cse0 .cse1) (or (or .cse2 .cse3 .cse4) .cse5 .cse6) (or .cse7 (not (= ~myStatus~0 0)) .cse8) (or (and (and (= ~s~0 |old(~s~0)|) (= ~setEventCalled~0 1)) .cse7) (let ((.cse9 (or .cse11 (not (<= (+ |old(~s~0)| 2) ~SKIP1~0)) .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20))) (and (or .cse5 .cse9 .cse4) (or .cse9 .cse10 .cse4)))) (or .cse5 .cse7 .cse8) (or .cse6 .cse2 .cse3 .cse10 .cse4))))))) [2019-09-07 12:58:57,301 INFO L439 ceAbstractionStarter]: At program point L2028(lines 2027 2039) the Hoare annotation is: (let ((.cse30 (+ ~myStatus~0 1073741637))) (let ((.cse29 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse23 (= 0 ~pended~0)) (.cse27 (<= 0 .cse30)) (.cse24 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse25 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse28 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse22 (<= (+ ~NP~0 2) ~SKIP1~0))) (let ((.cse21 (not .cse22)) (.cse12 (not .cse28)) (.cse15 (not (= |old(~s~0)| ~NP~0))) (.cse16 (not .cse25)) (.cse17 (not .cse24)) (.cse18 (not .cse27)) (.cse19 (not .cse23)) (.cse13 (not .cse29)) (.cse26 (<= 1 ~compRegistered~0))) (let ((.cse11 (not (= |old(~setEventCalled~0)| 1))) (.cse20 (not .cse26)) (.cse14 (not (= 1 ~routine~0))) (.cse0 (= ~s~0 ~NP~0)) (.cse7 (= |old(~customIrp~0)| ~customIrp~0)) (.cse10 (not (<= 0 ~myStatus~0))) (.cse5 (not (<= .cse30 0))) (.cse1 (or .cse21 (or .cse12 .cse15 (not (= ~compRegistered~0 0))) (not (= 0 ~routine~0)) .cse16 .cse17 .cse18 .cse19 .cse13)) (.cse4 (not (= |old(~customIrp~0)| 0)))) (let ((.cse8 (and (or .cse10 .cse1 .cse4) (or .cse5 .cse1 .cse4))) (.cse6 (and (and .cse22 .cse23 .cse0 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 (= ~routine~0 1)) .cse7)) (.cse2 (not (= |old(~s~0)| ~MPR3~0))) (.cse3 (or .cse11 .cse21 .cse18 .cse13 (or .cse16 .cse17 (or .cse12 .cse19 .cse20 .cse14))))) (and (or .cse0 .cse1) (or (or .cse2 .cse3 .cse4) .cse5 .cse6) (or .cse7 (not (= ~myStatus~0 0)) .cse8) (or (and (and (= ~s~0 |old(~s~0)|) (= ~setEventCalled~0 1)) .cse7) (let ((.cse9 (or .cse11 (not (<= (+ |old(~s~0)| 2) ~SKIP1~0)) .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20))) (and (or .cse5 .cse9 .cse4) (or .cse9 .cse10 .cse4)))) (or .cse5 .cse7 .cse8) (or .cse6 .cse2 .cse3 .cse10 .cse4))))))) [2019-09-07 12:58:57,301 INFO L439 ceAbstractionStarter]: At program point L2020(line 2020) the Hoare annotation is: (let ((.cse17 (+ ~myStatus~0 1073741637))) (let ((.cse8 (not (= |old(~s~0)| ~NP~0))) (.cse14 (not (= |old(~setEventCalled~0)| 1))) (.cse6 (not (<= (+ ~NP~0 2) ~SKIP1~0))) (.cse11 (not (<= 0 .cse17))) (.cse13 (not (<= (+ ~DC~0 2) ~SKIP2~0))) (.cse9 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse10 (not (<= (+ ~SKIP2~0 3) ~IPC~0))) (.cse7 (not (<= (+ ~NP~0 5) ~MPR3~0))) (.cse12 (not (= 0 ~pended~0))) (.cse16 (not (<= 1 ~compRegistered~0))) (.cse15 (not (= 1 ~routine~0)))) (let ((.cse0 (not (= |old(~s~0)| ~MPR3~0))) (.cse1 (or .cse14 .cse6 .cse11 .cse13 (or .cse9 .cse10 (or .cse7 .cse12 .cse16 .cse15)))) (.cse2 (not (<= 0 ~myStatus~0))) (.cse4 (not (<= .cse17 0))) (.cse5 (or .cse14 (not (<= (+ |old(~s~0)| 2) ~SKIP1~0)) .cse7 .cse13 .cse15 .cse8 .cse9 .cse10 .cse11 .cse12 .cse16)) (.cse3 (not (= |old(~customIrp~0)| 0)))) (and (or .cse0 .cse1 .cse2 .cse3) (or .cse4 .cse0 .cse1 .cse3) (or .cse5 .cse2 .cse3) (or .cse4 .cse5 .cse3) (or .cse6 (or .cse7 .cse8 (not (= ~compRegistered~0 0))) (not (= 0 ~routine~0)) .cse9 .cse10 .cse11 .cse12 .cse13))))) [2019-09-07 12:58:57,301 INFO L443 ceAbstractionStarter]: For program point L2018(lines 2018 2022) no Hoare annotation was computed. [2019-09-07 12:58:57,301 INFO L443 ceAbstractionStarter]: For program point L2018-1(lines 2005 2024) no Hoare annotation was computed. [2019-09-07 12:58:57,301 INFO L443 ceAbstractionStarter]: For program point KeWaitForSingleObjectFINAL(lines 2000 2041) no Hoare annotation was computed. [2019-09-07 12:58:57,301 INFO L443 ceAbstractionStarter]: For program point L2006(lines 2006 2011) no Hoare annotation was computed. [2019-09-07 12:58:57,302 INFO L443 ceAbstractionStarter]: For program point L2027(lines 2027 2039) no Hoare annotation was computed. [2019-09-07 12:58:57,302 INFO L439 ceAbstractionStarter]: At program point KeWaitForSingleObjectENTRY(lines 2000 2041) the Hoare annotation is: (let ((.cse32 (+ ~myStatus~0 1073741637))) (let ((.cse28 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse22 (= 0 ~pended~0)) (.cse26 (<= 0 .cse32)) (.cse23 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse24 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse27 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse21 (<= (+ ~NP~0 2) ~SKIP1~0))) (let ((.cse12 (not .cse21)) (.cse17 (not .cse27)) (.cse31 (not (= |old(~s~0)| ~NP~0))) (.cse15 (not .cse24)) (.cse16 (not .cse23)) (.cse13 (not .cse26)) (.cse18 (not .cse22)) (.cse14 (not .cse28)) (.cse25 (<= 1 ~compRegistered~0))) (let ((.cse29 (= ~routine~0 1)) (.cse30 (= ~setEventCalled~0 1)) (.cse5 (= |old(~customIrp~0)| ~customIrp~0)) (.cse11 (not (= |old(~setEventCalled~0)| 1))) (.cse20 (not (= 1 ~routine~0))) (.cse19 (not .cse25)) (.cse10 (not (<= 0 ~myStatus~0))) (.cse3 (not (<= .cse32 0))) (.cse7 (or .cse12 (or .cse17 .cse31 (not (= ~compRegistered~0 0))) (not (= 0 ~routine~0)) .cse15 .cse16 .cse13 .cse18 .cse14)) (.cse2 (not (= |old(~customIrp~0)| 0)))) (let ((.cse6 (and (or .cse10 .cse7 .cse2) (or .cse3 .cse7 .cse2))) (.cse9 (or .cse11 (not (<= (+ |old(~s~0)| 2) ~SKIP1~0)) .cse17 .cse14 .cse20 .cse31 .cse15 .cse16 .cse13 .cse18 .cse19)) (.cse8 (and (and .cse22 (= ~s~0 ~NP~0) .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 (= ~NP~0 |old(~s~0)|) .cse29 (<= (+ ~s~0 2) ~SKIP1~0) .cse30) .cse5)) (.cse4 (and (= ~MPR3~0 ~s~0) (and .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30) .cse5)) (.cse0 (not (= |old(~s~0)| ~MPR3~0))) (.cse1 (or .cse11 .cse12 .cse13 .cse14 (or .cse15 .cse16 (or .cse17 .cse18 .cse19 .cse20))))) (and (or (or .cse0 .cse1 .cse2) .cse3 .cse4) (or (not (= ~myStatus~0 0)) .cse5 .cse6) (or (= ~s~0 |old(~s~0)|) .cse7) (or .cse8 .cse9 .cse10 .cse2) (or .cse3 .cse5 .cse6) (or (or .cse3 .cse9 .cse2) .cse8) (or .cse4 .cse0 .cse1 .cse10 .cse2))))))) [2019-09-07 12:58:57,302 INFO L439 ceAbstractionStarter]: At program point L1630(line 1630) the Hoare annotation is: (let ((.cse11 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse10 (<= (+ ~NP~0 2) ~SKIP1~0))) (let ((.cse0 (not .cse10)) (.cse1 (not .cse11)) (.cse2 (and .cse10 (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~s~0 |old(~s~0)|) (= 0 ~routine~0) .cse11)) (.cse3 (not (<= (+ ~DC~0 2) ~SKIP2~0))) (.cse4 (not (= 0 |old(~routine~0)|))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse7 (not (<= (+ ~SKIP2~0 3) ~IPC~0))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (not (= 0 |old(~pended~0)|)))) (and (or .cse0 .cse1 .cse2 (not (= ~myStatus~0 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse0 .cse1 .cse2 .cse3 (not (<= (+ ~myStatus~0 1) 0)) .cse4 .cse5 .cse6 .cse7 (not (<= 0 (+ ~myStatus~0 1073741637))) .cse8 .cse9)))) [2019-09-07 12:58:57,302 INFO L443 ceAbstractionStarter]: For program point L1630-1(line 1630) no Hoare annotation was computed. [2019-09-07 12:58:57,303 INFO L439 ceAbstractionStarter]: At program point L1625(line 1625) the Hoare annotation is: (let ((.cse0 (not (<= (+ ~NP~0 2) ~SKIP1~0))) (.cse1 (not (<= (+ ~NP~0 5) ~MPR3~0))) (.cse3 (and (= 0 ~pended~0) (= ~s~0 |old(~s~0)|) (= 0 ~routine~0) (<= 1 ~compRegistered~0))) (.cse2 (not (<= (+ ~DC~0 2) ~SKIP2~0))) (.cse4 (not (= 0 |old(~routine~0)|))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse7 (not (<= (+ ~SKIP2~0 3) ~IPC~0))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (not (= 0 |old(~pended~0)|)))) (and (or .cse0 .cse1 .cse2 (not (<= (+ ~myStatus~0 1) 0)) .cse3 .cse4 .cse5 .cse6 .cse7 (not (<= 0 (+ ~myStatus~0 1073741637))) .cse8 .cse9) (or .cse0 .cse1 (not (= ~myStatus~0 0)) .cse3 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) [2019-09-07 12:58:57,303 INFO L443 ceAbstractionStarter]: For program point L1625-1(line 1625) no Hoare annotation was computed. [2019-09-07 12:58:57,303 INFO L439 ceAbstractionStarter]: At program point CdAudioHPCdrDeviceControlENTRY(lines 1589 1637) the Hoare annotation is: (let ((.cse0 (not (<= (+ ~NP~0 2) ~SKIP1~0))) (.cse1 (not (<= (+ ~NP~0 5) ~MPR3~0))) (.cse2 (not (<= (+ ~DC~0 2) ~SKIP2~0))) (.cse4 (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~s~0 |old(~s~0)|) (= 0 ~routine~0))) (.cse3 (not (= 0 |old(~routine~0)|))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse7 (not (<= (+ ~SKIP2~0 3) ~IPC~0))) (.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) (or .cse0 .cse1 .cse2 (not (<= (+ ~myStatus~0 1) 0)) .cse4 .cse3 .cse5 .cse6 .cse7 (not (<= 0 (+ ~myStatus~0 1073741637))) .cse8 .cse9))) [2019-09-07 12:58:57,303 INFO L439 ceAbstractionStarter]: At program point L1616(line 1616) the Hoare annotation is: (let ((.cse0 (not (<= (+ ~NP~0 2) ~SKIP1~0))) (.cse1 (not (<= (+ ~NP~0 5) ~MPR3~0))) (.cse2 (not (<= (+ ~DC~0 2) ~SKIP2~0))) (.cse3 (not (= 0 |old(~routine~0)|))) (.cse4 (not (= |old(~s~0)| ~NP~0))) (.cse5 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse6 (not (<= (+ ~SKIP2~0 3) ~IPC~0))) (.cse7 (not (= |old(~compRegistered~0)| 0))) (.cse8 (not (= 0 |old(~pended~0)|)))) (and (or .cse0 .cse1 .cse2 (not (<= (+ ~myStatus~0 1) 0)) .cse3 .cse4 .cse5 .cse6 (not (<= 0 (+ ~myStatus~0 1073741637))) .cse7 .cse8) (or .cse0 .cse1 (not (= ~myStatus~0 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8))) [2019-09-07 12:58:57,303 INFO L443 ceAbstractionStarter]: For program point CdAudioHPCdrDeviceControlEXIT(lines 1589 1637) no Hoare annotation was computed. [2019-09-07 12:58:57,303 INFO L443 ceAbstractionStarter]: For program point L1614(lines 1614 1621) no Hoare annotation was computed. [2019-09-07 12:58:57,303 INFO L443 ceAbstractionStarter]: For program point L1614-1(lines 1609 1622) no Hoare annotation was computed. [2019-09-07 12:58:57,304 INFO L439 ceAbstractionStarter]: At program point L1611(line 1611) the Hoare annotation is: (let ((.cse0 (not (<= (+ ~NP~0 2) ~SKIP1~0))) (.cse1 (not (<= (+ ~NP~0 5) ~MPR3~0))) (.cse2 (not (<= (+ ~DC~0 2) ~SKIP2~0))) (.cse3 (not (= 0 |old(~routine~0)|))) (.cse4 (not (= |old(~s~0)| ~NP~0))) (.cse5 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse6 (not (<= (+ ~SKIP2~0 3) ~IPC~0))) (.cse7 (not (= |old(~compRegistered~0)| 0))) (.cse8 (not (= 0 |old(~pended~0)|)))) (and (or .cse0 .cse1 .cse2 (not (<= (+ ~myStatus~0 1) 0)) .cse3 .cse4 .cse5 .cse6 (not (<= 0 (+ ~myStatus~0 1073741637))) .cse7 .cse8) (or .cse0 .cse1 (not (= ~myStatus~0 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8))) [2019-09-07 12:58:57,304 INFO L443 ceAbstractionStarter]: For program point L1609(lines 1609 1622) no Hoare annotation was computed. [2019-09-07 12:58:57,304 INFO L443 ceAbstractionStarter]: For program point L1608(lines 1608 1633) no Hoare annotation was computed. [2019-09-07 12:58:57,304 INFO L443 ceAbstractionStarter]: For program point CdAudioHPCdrDeviceControlFINAL(lines 1589 1637) no Hoare annotation was computed. [2019-09-07 12:58:57,304 INFO L443 ceAbstractionStarter]: For program point L1986-1(lines 1978 1991) no Hoare annotation was computed. [2019-09-07 12:58:57,304 INFO L443 ceAbstractionStarter]: For program point L1982(lines 1982 1988) no Hoare annotation was computed. [2019-09-07 12:58:57,304 INFO L439 ceAbstractionStarter]: At program point IofCompleteRequestENTRY(lines 1978 1991) the Hoare annotation is: (let ((.cse2 (= ~s~0 |old(~s~0)|)) (.cse0 (not (<= (+ ~NP~0 5) ~MPR3~0))) (.cse6 (not (= |old(~s~0)| ~NP~0))) (.cse3 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse4 (not (<= (+ ~SKIP2~0 3) ~IPC~0))) (.cse5 (not (= 0 ~pended~0))) (.cse1 (not (<= (+ ~DC~0 2) ~SKIP2~0)))) (and (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) .cse0 .cse1 .cse2 (not (= 0 ~routine~0)) .cse3 .cse4 .cse5 (or .cse6 (not (= ~compRegistered~0 0)))) (or .cse2 (or (or .cse0 .cse6) .cse3 .cse4 .cse5 (not (<= (+ |old(~s~0)| 2) ~SKIP1~0)) (not (<= 1 ~compRegistered~0)) .cse1 (not (= 1 ~routine~0)))))) [2019-09-07 12:58:57,305 INFO L443 ceAbstractionStarter]: For program point IofCompleteRequestEXIT(lines 1978 1991) no Hoare annotation was computed. [2019-09-07 12:58:57,305 INFO L439 ceAbstractionStarter]: At program point L1986(line 1986) the Hoare annotation is: (let ((.cse0 (not (<= (+ ~NP~0 5) ~MPR3~0))) (.cse2 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse3 (not (<= (+ ~SKIP2~0 3) ~IPC~0))) (.cse4 (not (= 0 ~pended~0))) (.cse5 (not (<= (+ ~DC~0 2) ~SKIP2~0))) (.cse1 (not (= |old(~s~0)| ~NP~0)))) (and (or (or .cse0 .cse1) .cse2 .cse3 .cse4 (not (<= (+ |old(~s~0)| 2) ~SKIP1~0)) (not (<= 1 ~compRegistered~0)) .cse5 (not (= 1 ~routine~0))) (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) .cse0 (not (= 0 ~routine~0)) .cse2 .cse3 .cse4 .cse5 (or .cse1 (not (= ~compRegistered~0 0)))))) [2019-09-07 12:58:57,305 INFO L439 ceAbstractionStarter]: At program point L1697(line 1697) the Hoare annotation is: (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (and (= 0 ~pended~0) (= ~SKIP1~0 ~s~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~DC~0 2) ~SKIP2~0))) [2019-09-07 12:58:57,305 INFO L443 ceAbstractionStarter]: For program point L1697-1(line 1697) no Hoare annotation was computed. [2019-09-07 12:58:57,305 INFO L439 ceAbstractionStarter]: At program point L1691(line 1691) the Hoare annotation is: (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~DC~0 2) ~SKIP2~0))) [2019-09-07 12:58:57,305 INFO L439 ceAbstractionStarter]: At program point CdAudioPowerENTRY(lines 1680 1701) the Hoare annotation is: (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (and (= 0 ~pended~0) (= ~s~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~DC~0 2) ~SKIP2~0))) [2019-09-07 12:58:57,305 INFO L443 ceAbstractionStarter]: For program point L1691-1(lines 1687 1693) no Hoare annotation was computed. [2019-09-07 12:58:57,306 INFO L443 ceAbstractionStarter]: For program point CdAudioPowerFINAL(lines 1680 1701) no Hoare annotation was computed. [2019-09-07 12:58:57,306 INFO L443 ceAbstractionStarter]: For program point L1687(lines 1687 1693) no Hoare annotation was computed. [2019-09-07 12:58:57,306 INFO L443 ceAbstractionStarter]: For program point CdAudioPowerEXIT(lines 1680 1701) no Hoare annotation was computed. [2019-09-07 12:58:57,306 INFO L443 ceAbstractionStarter]: For program point HPCdrCompletionFINAL(lines 1567 1588) no Hoare annotation was computed. [2019-09-07 12:58:57,306 INFO L439 ceAbstractionStarter]: At program point HPCdrCompletionENTRY(lines 1567 1588) the Hoare annotation is: (let ((.cse0 (not (<= (+ ~NP~0 5) ~MPR3~0))) (.cse1 (not (<= (+ ~s~0 2) ~SKIP1~0))) (.cse3 (= 0 ~pended~0)) (.cse2 (not (<= (+ ~DC~0 2) ~SKIP2~0))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= ~s~0 ~NP~0))) (.cse6 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse7 (not (<= (+ ~SKIP2~0 3) ~IPC~0))) (.cse8 (not (= 0 |old(~pended~0)|))) (.cse9 (not (<= 1 ~compRegistered~0)))) (and (or .cse0 .cse1 .cse2 (not (<= (+ ~myStatus~0 1) 0)) .cse3 .cse4 .cse5 .cse6 .cse7 (not (<= 0 (+ ~myStatus~0 1073741637))) .cse8 .cse9) (or .cse0 (not (= ~myStatus~0 0)) .cse1 .cse3 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) [2019-09-07 12:58:57,306 INFO L443 ceAbstractionStarter]: For program point HPCdrCompletionEXIT(lines 1567 1588) no Hoare annotation was computed. [2019-09-07 12:58:57,306 INFO L439 ceAbstractionStarter]: At program point L1583(line 1583) the Hoare annotation is: (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~s~0 2) ~SKIP1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= (+ ~myStatus~0 1) 0)) (not (= 0 ~routine~0)) (not (= ~s~0 ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (<= 0 (+ ~myStatus~0 1073741637))) (not (= 0 |old(~pended~0)|)) (not (<= 1 ~compRegistered~0))) [2019-09-07 12:58:57,307 INFO L443 ceAbstractionStarter]: For program point L1581(lines 1581 1585) no Hoare annotation was computed. [2019-09-07 12:58:57,307 INFO L439 ceAbstractionStarter]: At program point L1577(line 1577) the Hoare annotation is: (let ((.cse0 (not (<= (+ ~NP~0 5) ~MPR3~0))) (.cse1 (not (<= (+ ~s~0 2) ~SKIP1~0))) (.cse2 (not (<= (+ ~DC~0 2) ~SKIP2~0))) (.cse3 (not (= 0 ~routine~0))) (.cse4 (not (= ~s~0 ~NP~0))) (.cse5 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse6 (not (<= (+ ~SKIP2~0 3) ~IPC~0))) (.cse7 (not (= 0 |old(~pended~0)|))) (.cse8 (not (<= 1 ~compRegistered~0)))) (and (or .cse0 (not (= ~myStatus~0 0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse0 .cse1 .cse2 (not (<= (+ ~myStatus~0 1) 0)) .cse3 .cse4 .cse5 .cse6 (not (<= 0 (+ ~myStatus~0 1073741637))) .cse7 .cse8))) [2019-09-07 12:58:57,307 INFO L443 ceAbstractionStarter]: For program point L1573(lines 1573 1579) no Hoare annotation was computed. [2019-09-07 12:58:57,307 INFO L443 ceAbstractionStarter]: For program point L1572(lines 1572 1580) no Hoare annotation was computed. [2019-09-07 12:58:57,307 INFO L443 ceAbstractionStarter]: For program point L1572-1(lines 1571 1587) no Hoare annotation was computed. [2019-09-07 12:58:57,307 INFO L446 ceAbstractionStarter]: At program point HpCdrProcessLastSessionENTRY(lines 1557 1566) the Hoare annotation is: true [2019-09-07 12:58:57,307 INFO L443 ceAbstractionStarter]: For program point L1561(lines 1561 1563) no Hoare annotation was computed. [2019-09-07 12:58:57,307 INFO L443 ceAbstractionStarter]: For program point L1561-2(lines 1557 1566) no Hoare annotation was computed. [2019-09-07 12:58:57,307 INFO L443 ceAbstractionStarter]: For program point HpCdrProcessLastSessionEXIT(lines 1557 1566) no Hoare annotation was computed. [2019-09-07 12:58:57,308 INFO L446 ceAbstractionStarter]: At program point KeSetEventENTRY(lines 1992 1999) the Hoare annotation is: true [2019-09-07 12:58:57,308 INFO L443 ceAbstractionStarter]: For program point KeSetEventFINAL(lines 1992 1999) no Hoare annotation was computed. [2019-09-07 12:58:57,308 INFO L443 ceAbstractionStarter]: For program point KeSetEventEXIT(lines 1992 1999) no Hoare annotation was computed. [2019-09-07 12:58:57,308 INFO L443 ceAbstractionStarter]: For program point stub_driver_initEXIT(lines 1702 1715) no Hoare annotation was computed. [2019-09-07 12:58:57,308 INFO L439 ceAbstractionStarter]: At program point stub_driver_initENTRY(lines 1702 1715) the Hoare annotation is: (or (let ((.cse2 (+ ~myStatus~0 1073741637))) (let ((.cse0 (let ((.cse3 (not (<= (+ ~NP~0 2) ~SKIP1~0))) (.cse4 (not (<= (+ ~NP~0 5) ~MPR3~0))) (.cse5 (not (<= (+ ~DC~0 2) ~SKIP2~0))) (.cse6 (not (= 0 ~routine~0))) (.cse7 (not (= |old(~s~0)| ~NP~0))) (.cse8 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse9 (not (<= (+ ~SKIP2~0 3) ~IPC~0))) (.cse10 (not (= |old(~compRegistered~0)| 0))) (.cse11 (not (= 0 |old(~pended~0)|)))) (and (or .cse3 .cse4 .cse5 (not (<= (+ ~myStatus~0 1) 0)) .cse6 .cse7 .cse8 .cse9 (not (<= 0 .cse2)) .cse10 .cse11) (or .cse3 .cse4 (not (= ~myStatus~0 0)) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11)))) (.cse1 (not (= |old(~customIrp~0)| 0)))) (and (or .cse0 (not (<= 0 ~myStatus~0)) .cse1) (or (not (<= .cse2 0)) .cse0 .cse1)))) (and (and (= 0 ~pended~0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0)) (= |old(~customIrp~0)| ~customIrp~0))) [2019-09-07 12:58:57,308 INFO L443 ceAbstractionStarter]: For program point stub_driver_initFINAL(lines 1702 1715) no Hoare annotation was computed. [2019-09-07 12:58:57,308 INFO L446 ceAbstractionStarter]: At program point CdAudioSignalCompletionENTRY(lines 130 139) the Hoare annotation is: true [2019-09-07 12:58:57,308 INFO L443 ceAbstractionStarter]: For program point CdAudioSignalCompletionFINAL(lines 130 139) no Hoare annotation was computed. [2019-09-07 12:58:57,309 INFO L446 ceAbstractionStarter]: At program point L135(line 135) the Hoare annotation is: true [2019-09-07 12:58:57,309 INFO L443 ceAbstractionStarter]: For program point L135-1(line 135) no Hoare annotation was computed. [2019-09-07 12:58:57,309 INFO L443 ceAbstractionStarter]: For program point CdAudioSignalCompletionEXIT(lines 130 139) no Hoare annotation was computed. [2019-09-07 12:58:57,309 INFO L443 ceAbstractionStarter]: For program point L287(lines 287 290) no Hoare annotation was computed. [2019-09-07 12:58:57,309 INFO L439 ceAbstractionStarter]: At program point L254(line 254) the Hoare annotation is: (let ((.cse10 (+ |old(~myStatus~0)| 1073741637))) (let ((.cse2 (not (<= .cse10 0))) (.cse3 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse6 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse7 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse5 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse4 (<= (+ ~SKIP2~0 3) ~IPC~0))) (let ((.cse0 (let ((.cse8 (or (not .cse3) (not .cse6) (not .cse7) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| ~NP~0)) (not .cse5) (not .cse4) (not (<= 0 .cse10)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)))) (.cse9 (not (= |old(~customIrp~0)| 0)))) (and (or .cse2 .cse8 .cse9) (or .cse8 (not (<= 0 |old(~myStatus~0)|)) .cse9)))) (.cse1 (and .cse3 (= 0 ~pended~0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) .cse4 .cse5 (= ~s~0 |old(~s~0)|) (= 0 ~routine~0) .cse6 .cse7))) (and (or .cse0 .cse1 .cse2) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0))))))) [2019-09-07 12:58:57,309 INFO L443 ceAbstractionStarter]: For program point L254-1(line 254) no Hoare annotation was computed. [2019-09-07 12:58:57,310 INFO L439 ceAbstractionStarter]: At program point L287-2(lines 277 291) the Hoare annotation is: (let ((.cse17 (+ |old(~myStatus~0)| 1073741637))) (let ((.cse1 (not (<= .cse17 0))) (.cse10 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse13 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse14 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse12 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse11 (<= (+ ~SKIP2~0 3) ~IPC~0))) (let ((.cse0 (let ((.cse15 (or (not .cse10) (not .cse13) (not .cse14) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| ~NP~0)) (not .cse12) (not .cse11) (not (<= 0 .cse17)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)))) (.cse16 (not (= |old(~customIrp~0)| 0)))) (and (or .cse1 .cse15 .cse16) (or .cse15 (not (<= 0 |old(~myStatus~0)|)) .cse16)))) (.cse2 (= CdAudioPnp_~status~2 |old(~myStatus~0)|)) (.cse3 (let ((.cse9 (+ ~myStatus~0 1073741637))) (let ((.cse5 (not (= ~MPR3~0 |old(~s~0)|))) (.cse6 (= 0 ~customIrp~0)) (.cse7 (= |old(~customIrp~0)| ~customIrp~0)) (.cse8 (and .cse10 (= 0 ~pended~0) (= ~s~0 ~NP~0) .cse11 .cse12 (<= 1 ~compRegistered~0) (<= 0 .cse9) .cse13 .cse14 (= ~routine~0 1)))) (or (and .cse5 .cse6 .cse7 .cse8 (<= 0 ~myStatus~0)) (and .cse5 .cse6 (<= .cse9 0) .cse7 .cse8))))) (.cse4 (= ~myStatus~0 |old(~myStatus~0)|))) (and (or .cse0 .cse1 (and .cse2 .cse3 .cse4)) (or .cse0 (not (= |old(~myStatus~0)| 0)) (and (and .cse2 .cse3) .cse4)))))) [2019-09-07 12:58:57,310 INFO L443 ceAbstractionStarter]: For program point L275(line 275) no Hoare annotation was computed. [2019-09-07 12:58:57,310 INFO L443 ceAbstractionStarter]: For program point L238(lines 238 306) no Hoare annotation was computed. [2019-09-07 12:58:57,310 INFO L443 ceAbstractionStarter]: For program point L300(line 300) no Hoare annotation was computed. [2019-09-07 12:58:57,310 INFO L443 ceAbstractionStarter]: For program point L263(lines 263 273) no Hoare annotation was computed. [2019-09-07 12:58:57,310 INFO L439 ceAbstractionStarter]: At program point L259(lines 259 260) the Hoare annotation is: (let ((.cse10 (+ |old(~myStatus~0)| 1073741637))) (let ((.cse2 (not (<= .cse10 0))) (.cse3 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse6 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse7 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse5 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse4 (<= (+ ~SKIP2~0 3) ~IPC~0))) (let ((.cse1 (let ((.cse8 (or (not .cse3) (not .cse6) (not .cse7) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| ~NP~0)) (not .cse5) (not .cse4) (not (<= 0 .cse10)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)))) (.cse9 (not (= |old(~customIrp~0)| 0)))) (and (or .cse2 .cse8 .cse9) (or .cse8 (not (<= 0 |old(~myStatus~0)|)) .cse9)))) (.cse0 (and (and (and .cse3 (= 0 ~pended~0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) .cse4 .cse5 (= ~s~0 |old(~s~0)|) (= 0 ~routine~0) (<= 0 (+ ~myStatus~0 1073741637)) .cse6 .cse7) (= |old(~customIrp~0)| ~customIrp~0)) (= ~myStatus~0 |old(~myStatus~0)|)))) (and (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0))) (or .cse1 .cse2 .cse0))))) [2019-09-07 12:58:57,310 INFO L443 ceAbstractionStarter]: For program point L259-1(lines 259 260) no Hoare annotation was computed. [2019-09-07 12:58:57,310 INFO L443 ceAbstractionStarter]: For program point CdAudioPnpEXIT(lines 217 310) no Hoare annotation was computed. [2019-09-07 12:58:57,311 INFO L439 ceAbstractionStarter]: At program point L239(lines 238 306) the Hoare annotation is: (let ((.cse10 (+ |old(~myStatus~0)| 1073741637))) (let ((.cse2 (not (<= .cse10 0))) (.cse3 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse6 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse7 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse5 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse4 (<= (+ ~SKIP2~0 3) ~IPC~0))) (let ((.cse1 (let ((.cse8 (or (not .cse3) (not .cse6) (not .cse7) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| ~NP~0)) (not .cse5) (not .cse4) (not (<= 0 .cse10)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)))) (.cse9 (not (= |old(~customIrp~0)| 0)))) (and (or .cse2 .cse8 .cse9) (or .cse8 (not (<= 0 |old(~myStatus~0)|)) .cse9)))) (.cse0 (and (and (and .cse3 (= 0 ~pended~0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) .cse4 .cse5 (= ~s~0 |old(~s~0)|) (= 0 ~routine~0) (<= 0 (+ ~myStatus~0 1073741637)) .cse6 .cse7) (= |old(~customIrp~0)| ~customIrp~0)) (= ~myStatus~0 |old(~myStatus~0)|)))) (and (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0))) (or .cse1 .cse2 .cse0))))) [2019-09-07 12:58:57,311 INFO L439 ceAbstractionStarter]: At program point CdAudioPnpENTRY(lines 217 310) the Hoare annotation is: (let ((.cse10 (+ |old(~myStatus~0)| 1073741637))) (let ((.cse2 (not (<= .cse10 0))) (.cse3 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse6 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse7 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse5 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse4 (<= (+ ~SKIP2~0 3) ~IPC~0))) (let ((.cse1 (let ((.cse8 (or (not .cse3) (not .cse6) (not .cse7) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| ~NP~0)) (not .cse5) (not .cse4) (not (<= 0 .cse10)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)))) (.cse9 (not (= |old(~customIrp~0)| 0)))) (and (or .cse2 .cse8 .cse9) (or .cse8 (not (<= 0 |old(~myStatus~0)|)) .cse9)))) (.cse0 (and (and (and .cse3 (= 0 ~pended~0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) .cse4 .cse5 (= ~s~0 |old(~s~0)|) (= 0 ~routine~0) (<= 0 (+ ~myStatus~0 1073741637)) .cse6 .cse7) (= |old(~customIrp~0)| ~customIrp~0)) (= ~myStatus~0 |old(~myStatus~0)|)))) (and (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0))) (or .cse1 .cse2 .cse0))))) [2019-09-07 12:58:57,311 INFO L439 ceAbstractionStarter]: At program point L268(lines 263 273) the Hoare annotation is: (let ((.cse10 (+ |old(~myStatus~0)| 1073741637))) (let ((.cse2 (not (<= .cse10 0))) (.cse3 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse6 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse7 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse5 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse4 (<= (+ ~SKIP2~0 3) ~IPC~0))) (let ((.cse0 (let ((.cse8 (or (not .cse3) (not .cse6) (not .cse7) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| ~NP~0)) (not .cse5) (not .cse4) (not (<= 0 .cse10)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)))) (.cse9 (not (= |old(~customIrp~0)| 0)))) (and (or .cse2 .cse8 .cse9) (or .cse8 (not (<= 0 |old(~myStatus~0)|)) .cse9)))) (.cse1 (and (and (and .cse3 (= ~s~0 ~NP~0) (= 0 ~pended~0) (= 0 ~compRegistered~0) .cse4 .cse5 (= 0 ~routine~0) (= ~s~0 |old(~s~0)|) (<= 0 (+ ~myStatus~0 1073741637)) .cse6 .cse7) (<= CdAudioPnp_~setPagable~0 0) (= |old(~customIrp~0)| ~customIrp~0)) (= ~myStatus~0 |old(~myStatus~0)|)))) (and (or .cse0 (not (= |old(~myStatus~0)| 0)) .cse1) (or .cse0 .cse1 .cse2))))) [2019-09-07 12:58:57,311 INFO L443 ceAbstractionStarter]: For program point CdAudioPnpFINAL(lines 217 310) no Hoare annotation was computed. [2019-09-07 12:58:57,312 INFO L443 ceAbstractionStarter]: For program point L235(lines 235 307) no Hoare annotation was computed. [2019-09-07 12:58:57,312 INFO L443 ceAbstractionStarter]: For program point L264(lines 264 266) no Hoare annotation was computed. [2019-09-07 12:58:57,312 INFO L443 ceAbstractionStarter]: For program point L293(line 293) no Hoare annotation was computed. [2019-09-07 12:58:57,312 INFO L439 ceAbstractionStarter]: At program point L248(line 248) the Hoare annotation is: (let ((.cse10 (+ |old(~myStatus~0)| 1073741637))) (let ((.cse1 (not (<= .cse10 0))) (.cse3 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse6 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse7 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse5 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse4 (<= (+ ~SKIP2~0 3) ~IPC~0))) (let ((.cse0 (let ((.cse8 (or (not .cse3) (not .cse6) (not .cse7) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| ~NP~0)) (not .cse5) (not .cse4) (not (<= 0 .cse10)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)))) (.cse9 (not (= |old(~customIrp~0)| 0)))) (and (or .cse1 .cse8 .cse9) (or .cse8 (not (<= 0 |old(~myStatus~0)|)) .cse9)))) (.cse2 (and .cse3 (= 0 ~pended~0) (= ~s~0 ~NP~0) .cse4 .cse5 (<= 1 ~compRegistered~0) .cse6 .cse7 (= ~NP~0 |old(~s~0)|) (= ~routine~0 1)))) (and (or .cse0 .cse1 (and (= CdAudioPnp_~status~2 |old(~myStatus~0)|) .cse2 (= ~myStatus~0 |old(~myStatus~0)|))) (or .cse0 (not (= |old(~myStatus~0)| 0)) (and .cse2 (= |old(~customIrp~0)| ~customIrp~0) (= CdAudioPnp_~status~2 0))))))) [2019-09-07 12:58:57,312 INFO L443 ceAbstractionStarter]: For program point L248-1(line 248) no Hoare annotation was computed. [2019-09-07 12:58:57,312 INFO L443 ceAbstractionStarter]: For program point L277(lines 277 291) no Hoare annotation was computed. [2019-09-07 12:58:57,312 INFO L439 ceAbstractionStarter]: At program point L236(lines 235 307) the Hoare annotation is: (let ((.cse4 (+ |old(~myStatus~0)| 1073741637))) (let ((.cse1 (not (<= .cse4 0)))) (let ((.cse0 (let ((.cse2 (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (<= 0 .cse4)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)))) (.cse3 (not (= |old(~customIrp~0)| 0)))) (and (or .cse1 .cse2 .cse3) (or .cse2 (not (<= 0 |old(~myStatus~0)|)) .cse3))))) (and (or .cse0 .cse1) (or .cse0 (not (= |old(~myStatus~0)| 0)) (and (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~s~0 |old(~s~0)|) (= 0 ~routine~0)) (= ~myStatus~0 |old(~myStatus~0)|) (= |old(~customIrp~0)| ~customIrp~0))))))) [2019-09-07 12:58:57,313 INFO L439 ceAbstractionStarter]: At program point L269-1(lines 263 273) the Hoare annotation is: (let ((.cse11 (+ |old(~myStatus~0)| 1073741637))) (let ((.cse3 (not (<= .cse11 0))) (.cse6 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse1 (not (= |old(~myStatus~0)| 0))) (.cse10 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse9 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse7 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse8 (<= (+ ~DC~0 2) ~SKIP2~0))) (let ((.cse2 (and (let ((.cse12 (= ~s~0 ~NP~0)) (.cse13 (= 0 ~pended~0)) (.cse14 (= 0 ~compRegistered~0)) (.cse15 (= 0 ~routine~0)) (.cse16 (= ~s~0 |old(~s~0)|))) (or (and (= ~myStatus~0 0) .cse6 .cse12 .cse13 .cse14 .cse10 .cse9 .cse15 .cse16 .cse7 .cse8) (and .cse6 .cse12 .cse13 .cse14 .cse1 .cse10 .cse9 .cse15 .cse16 (<= 0 (+ ~myStatus~0 1073741637)) .cse7 .cse8))) (= |old(~customIrp~0)| ~customIrp~0))) (.cse0 (let ((.cse4 (or (not .cse6) (not .cse7) (not .cse8) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| ~NP~0)) (not .cse9) (not .cse10) (not (<= 0 .cse11)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)))) (.cse5 (not (= |old(~customIrp~0)| 0)))) (and (or .cse3 .cse4 .cse5) (or .cse4 (not (<= 0 |old(~myStatus~0)|)) .cse5))))) (and (or .cse0 .cse1 .cse2) (or (and .cse2 (= ~myStatus~0 |old(~myStatus~0)|)) .cse0 .cse3))))) [2019-09-07 12:58:57,313 INFO L439 ceAbstractionStarter]: At program point L294(line 294) the Hoare annotation is: (let ((.cse17 (+ |old(~myStatus~0)| 1073741637))) (let ((.cse4 (not (<= .cse17 0))) (.cse10 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse11 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse13 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse14 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse12 (<= (+ ~SKIP2~0 3) ~IPC~0))) (let ((.cse0 (let ((.cse15 (or (not .cse10) (not .cse11) (not .cse13) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| ~NP~0)) (not .cse14) (not .cse12) (not (<= 0 .cse17)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)))) (.cse16 (not (= |old(~customIrp~0)| 0)))) (and (or .cse4 .cse15 .cse16) (or .cse15 (not (<= 0 |old(~myStatus~0)|)) .cse16)))) (.cse1 (= CdAudioPnp_~status~2 |old(~myStatus~0)|)) (.cse2 (let ((.cse9 (+ ~myStatus~0 1073741637))) (let ((.cse5 (not (= ~MPR3~0 |old(~s~0)|))) (.cse6 (= 0 ~customIrp~0)) (.cse7 (= |old(~customIrp~0)| ~customIrp~0)) (.cse8 (and (and .cse10 .cse11 (= ~s~0 ~NP~0) (= 0 ~pended~0) .cse12 .cse13 .cse14 (<= 1 ~compRegistered~0) (= ~routine~0 1)) (<= 0 .cse9) (= ~setEventCalled~0 1)))) (or (and .cse5 .cse6 .cse7 .cse8 (<= 0 ~myStatus~0)) (and .cse5 .cse6 (<= .cse9 0) .cse7 .cse8))))) (.cse3 (= ~myStatus~0 |old(~myStatus~0)|))) (and (or .cse0 (not (= |old(~myStatus~0)| 0)) (and (and .cse1 .cse2) .cse3)) (or .cse0 (and .cse1 .cse2 .cse3) .cse4))))) [2019-09-07 12:58:57,313 INFO L443 ceAbstractionStarter]: For program point L294-1(line 294) no Hoare annotation was computed. [2019-09-07 12:58:57,313 INFO L443 ceAbstractionStarter]: For program point L282(lines 282 284) no Hoare annotation was computed. [2019-09-07 12:58:57,313 INFO L443 ceAbstractionStarter]: For program point L278(lines 278 280) no Hoare annotation was computed. [2019-09-07 12:58:57,314 INFO L443 ceAbstractionStarter]: For program point L245(line 245) no Hoare annotation was computed. [2019-09-07 12:58:57,314 INFO L443 ceAbstractionStarter]: For program point L278-2(lines 277 286) no Hoare annotation was computed. [2019-09-07 12:58:57,314 INFO L439 ceAbstractionStarter]: At program point L241(lines 240 306) the Hoare annotation is: (let ((.cse10 (+ |old(~myStatus~0)| 1073741637))) (let ((.cse2 (not (<= .cse10 0))) (.cse3 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse6 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse7 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse5 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse4 (<= (+ ~SKIP2~0 3) ~IPC~0))) (let ((.cse0 (let ((.cse8 (or (not .cse3) (not .cse6) (not .cse7) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| ~NP~0)) (not .cse5) (not .cse4) (not (<= 0 .cse10)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)))) (.cse9 (not (= |old(~customIrp~0)| 0)))) (and (or .cse2 .cse8 .cse9) (or .cse8 (not (<= 0 |old(~myStatus~0)|)) .cse9)))) (.cse1 (and .cse3 (= 0 ~pended~0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) .cse4 .cse5 (= ~s~0 |old(~s~0)|) (= 0 ~routine~0) .cse6 .cse7))) (and (or .cse0 .cse1 .cse2) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0))))))) [2019-09-07 12:58:57,314 INFO L446 ceAbstractionStarter]: At program point errorFnENTRY(lines 54 61) the Hoare annotation is: true [2019-09-07 12:58:57,314 INFO L443 ceAbstractionStarter]: For program point errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION(line 58) no Hoare annotation was computed. [2019-09-07 12:58:57,314 INFO L443 ceAbstractionStarter]: For program point errorFnFINAL(lines 54 61) no Hoare annotation was computed. [2019-09-07 12:58:57,314 INFO L443 ceAbstractionStarter]: For program point errorFnEXIT(lines 54 61) no Hoare annotation was computed. [2019-09-07 12:58:57,315 INFO L439 ceAbstractionStarter]: At program point L828(line 828) the Hoare annotation is: (or (and (= 0 ~pended~0) (= ~s~0 |old(~s~0)|)) (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (<= 0 (+ |old(~myStatus~0)| 1073741637))) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)))) [2019-09-07 12:58:57,315 INFO L443 ceAbstractionStarter]: For program point L828-1(line 828) no Hoare annotation was computed. [2019-09-07 12:58:57,315 INFO L439 ceAbstractionStarter]: At program point L663(lines 663 664) the Hoare annotation is: (or (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (<= 0 (+ |old(~myStatus~0)| 1073741637))) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|))) (and (= 0 ~pended~0) (= ~s~0 ~NP~0))) [2019-09-07 12:58:57,315 INFO L443 ceAbstractionStarter]: For program point L663-1(lines 663 664) no Hoare annotation was computed. [2019-09-07 12:58:57,315 INFO L439 ceAbstractionStarter]: At program point L597(lines 596 858) the Hoare annotation is: (or (and (= 0 ~pended~0) (= ~s~0 |old(~s~0)|)) (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (<= 0 (+ |old(~myStatus~0)| 1073741637))) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)))) [2019-09-07 12:58:57,315 INFO L443 ceAbstractionStarter]: For program point L614(lines 614 854) no Hoare annotation was computed. [2019-09-07 12:58:57,315 INFO L443 ceAbstractionStarter]: For program point L747(lines 747 751) no Hoare annotation was computed. [2019-09-07 12:58:57,315 INFO L443 ceAbstractionStarter]: For program point L714(lines 714 718) no Hoare annotation was computed. [2019-09-07 12:58:57,316 INFO L439 ceAbstractionStarter]: At program point L797(line 797) the Hoare annotation is: (or (and (= 0 ~pended~0) (= ~s~0 |old(~s~0)|)) (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (<= 0 (+ |old(~myStatus~0)| 1073741637))) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)))) [2019-09-07 12:58:57,316 INFO L439 ceAbstractionStarter]: At program point L764(line 764) the Hoare annotation is: (or (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (<= 0 (+ |old(~myStatus~0)| 1073741637))) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|))) (and (= 0 ~pended~0) (= ~s~0 |old(~s~0)|) (<= (+ CdAudio535DeviceControl_~status~5 1073741823) 0))) [2019-09-07 12:58:57,316 INFO L443 ceAbstractionStarter]: For program point L797-1(line 797) no Hoare annotation was computed. [2019-09-07 12:58:57,316 INFO L443 ceAbstractionStarter]: For program point L764-1(line 764) no Hoare annotation was computed. [2019-09-07 12:58:57,316 INFO L443 ceAbstractionStarter]: For program point L698(lines 698 705) no Hoare annotation was computed. [2019-09-07 12:58:57,316 INFO L443 ceAbstractionStarter]: For program point L632(lines 632 850) no Hoare annotation was computed. [2019-09-07 12:58:57,316 INFO L439 ceAbstractionStarter]: At program point L633(lines 632 850) the Hoare annotation is: (or (and (= 0 ~pended~0) (= ~s~0 |old(~s~0)|)) (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (<= 0 (+ |old(~myStatus~0)| 1073741637))) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)))) [2019-09-07 12:58:57,317 INFO L439 ceAbstractionStarter]: At program point L848(lines 636 849) the Hoare annotation is: (or (and (= ~s~0 ~NP~0) (= 0 ~pended~0) (<= (+ CdAudio535DeviceControl_~status~5 1073741670) 0)) (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (<= 0 (+ |old(~myStatus~0)| 1073741637))) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)))) [2019-09-07 12:58:57,317 INFO L439 ceAbstractionStarter]: At program point L815(line 815) the Hoare annotation is: (or (and (= 0 ~pended~0) (= ~s~0 |old(~s~0)|)) (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (<= 0 (+ |old(~myStatus~0)| 1073741637))) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)))) [2019-09-07 12:58:57,317 INFO L443 ceAbstractionStarter]: For program point L815-1(line 815) no Hoare annotation was computed. [2019-09-07 12:58:57,317 INFO L443 ceAbstractionStarter]: For program point L799(lines 799 803) no Hoare annotation was computed. [2019-09-07 12:58:57,317 INFO L443 ceAbstractionStarter]: For program point L667(lines 667 675) no Hoare annotation was computed. [2019-09-07 12:58:57,317 INFO L443 ceAbstractionStarter]: For program point L783(lines 783 786) no Hoare annotation was computed. [2019-09-07 12:58:57,317 INFO L439 ceAbstractionStarter]: At program point CdAudio535DeviceControlENTRY(lines 432 875) the Hoare annotation is: (or (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (<= 0 (+ |old(~myStatus~0)| 1073741637))) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|))) (and (= 0 ~pended~0) (= ~s~0 |old(~s~0)|) (= ~myStatus~0 |old(~myStatus~0)|))) [2019-09-07 12:58:57,317 INFO L443 ceAbstractionStarter]: For program point L651(lines 651 658) no Hoare annotation was computed. [2019-09-07 12:58:57,318 INFO L443 ceAbstractionStarter]: For program point L800(lines 800 802) no Hoare annotation was computed. [2019-09-07 12:58:57,318 INFO L443 ceAbstractionStarter]: For program point L569(lines 569 864) no Hoare annotation was computed. [2019-09-07 12:58:57,318 INFO L443 ceAbstractionStarter]: For program point L553(lines 553 868) no Hoare annotation was computed. [2019-09-07 12:58:57,318 INFO L439 ceAbstractionStarter]: At program point L702(line 702) the Hoare annotation is: (or (and (= ~s~0 ~NP~0) (= 0 ~pended~0) (<= (+ CdAudio535DeviceControl_~status~5 1073741670) 0)) (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (<= 0 (+ |old(~myStatus~0)| 1073741637))) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)))) [2019-09-07 12:58:57,318 INFO L443 ceAbstractionStarter]: For program point L702-1(line 702) no Hoare annotation was computed. [2019-09-07 12:58:57,319 INFO L439 ceAbstractionStarter]: At program point L570(lines 569 864) the Hoare annotation is: (or (and (= 0 ~pended~0) (= ~s~0 |old(~s~0)|)) (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (<= 0 (+ |old(~myStatus~0)| 1073741637))) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)))) [2019-09-07 12:58:57,319 INFO L443 ceAbstractionStarter]: For program point L818(lines 818 820) no Hoare annotation was computed. [2019-09-07 12:58:57,319 INFO L443 ceAbstractionStarter]: For program point L752(lines 752 759) no Hoare annotation was computed. [2019-09-07 12:58:57,319 INFO L443 ceAbstractionStarter]: For program point L587(lines 587 860) no Hoare annotation was computed. [2019-09-07 12:58:57,320 INFO L439 ceAbstractionStarter]: At program point L554(lines 553 868) the Hoare annotation is: (or (and (= 0 ~pended~0) (= ~s~0 |old(~s~0)|)) (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (<= 0 (+ |old(~myStatus~0)| 1073741637))) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)))) [2019-09-07 12:58:57,320 INFO L443 ceAbstractionStarter]: For program point L736(lines 736 740) no Hoare annotation was computed. [2019-09-07 12:58:57,321 INFO L439 ceAbstractionStarter]: At program point L670(line 670) the Hoare annotation is: (or (and (= ~s~0 ~NP~0) (= 0 ~pended~0) (<= (+ CdAudio535DeviceControl_~status~5 1073741670) 0)) (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (<= 0 (+ |old(~myStatus~0)| 1073741637))) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)))) [2019-09-07 12:58:57,321 INFO L443 ceAbstractionStarter]: For program point L736-2(lines 636 847) no Hoare annotation was computed. [2019-09-07 12:58:57,321 INFO L443 ceAbstractionStarter]: For program point L670-1(line 670) no Hoare annotation was computed. [2019-09-07 12:58:57,321 INFO L439 ceAbstractionStarter]: At program point L588(lines 587 860) the Hoare annotation is: (or (and (= 0 ~pended~0) (= ~s~0 |old(~s~0)|)) (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (<= 0 (+ |old(~myStatus~0)| 1073741637))) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)))) [2019-09-07 12:58:57,321 INFO L443 ceAbstractionStarter]: For program point L605(lines 605 856) no Hoare annotation was computed. [2019-09-07 12:58:57,321 INFO L443 ceAbstractionStarter]: For program point L787(lines 787 793) no Hoare annotation was computed. [2019-09-07 12:58:57,322 INFO L443 ceAbstractionStarter]: For program point L787-1(lines 787 793) no Hoare annotation was computed. [2019-09-07 12:58:57,322 INFO L439 ceAbstractionStarter]: At program point L721(lines 711 732) the Hoare annotation is: (or (and (and (= ~s~0 ~NP~0) (= 0 ~pended~0) (= ~myStatus~0 |old(~myStatus~0)|)) (<= (+ CdAudio535DeviceControl_~status~5 1073741670) 0)) (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (<= 0 (+ |old(~myStatus~0)| 1073741637))) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)))) [2019-09-07 12:58:57,322 INFO L439 ceAbstractionStarter]: At program point L655(line 655) the Hoare annotation is: (or (and (= ~s~0 ~NP~0) (= 0 ~pended~0) (<= (+ CdAudio535DeviceControl_~status~5 1073741670) 0)) (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (<= 0 (+ |old(~myStatus~0)| 1073741637))) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)))) [2019-09-07 12:58:57,324 INFO L443 ceAbstractionStarter]: For program point CdAudio535DeviceControlEXIT(lines 432 875) no Hoare annotation was computed. [2019-09-07 12:58:57,324 INFO L443 ceAbstractionStarter]: For program point L655-1(line 655) no Hoare annotation was computed. [2019-09-07 12:58:57,324 INFO L439 ceAbstractionStarter]: At program point L771(lines 771 772) the Hoare annotation is: (or (and (= 0 ~pended~0) (= ~s~0 |old(~s~0)|)) (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (<= 0 (+ |old(~myStatus~0)| 1073741637))) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)))) [2019-09-07 12:58:57,324 INFO L443 ceAbstractionStarter]: For program point L771-1(lines 771 772) no Hoare annotation was computed. [2019-09-07 12:58:57,324 INFO L443 ceAbstractionStarter]: For program point L639(line 639) no Hoare annotation was computed. [2019-09-07 12:58:57,324 INFO L443 ceAbstractionStarter]: For program point L788(lines 788 792) no Hoare annotation was computed. [2019-09-07 12:58:57,325 INFO L443 ceAbstractionStarter]: For program point L623(lines 623 852) no Hoare annotation was computed. [2019-09-07 12:58:57,325 INFO L443 ceAbstractionStarter]: For program point L871(line 871) no Hoare annotation was computed. [2019-09-07 12:58:57,325 INFO L443 ceAbstractionStarter]: For program point L789(lines 789 791) no Hoare annotation was computed. [2019-09-07 12:58:57,325 INFO L439 ceAbstractionStarter]: At program point L756(line 756) the Hoare annotation is: (or (and (= 0 ~pended~0) (= ~s~0 |old(~s~0)|) (<= (+ CdAudio535DeviceControl_~status~5 1073741670) 0)) (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (<= 0 (+ |old(~myStatus~0)| 1073741637))) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)))) [2019-09-07 12:58:57,325 INFO L443 ceAbstractionStarter]: For program point L756-1(line 756) no Hoare annotation was computed. [2019-09-07 12:58:57,325 INFO L439 ceAbstractionStarter]: At program point L624(lines 605 856) the Hoare annotation is: (or (and (= 0 ~pended~0) (= ~s~0 |old(~s~0)|)) (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (<= 0 (+ |old(~myStatus~0)| 1073741637))) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)))) [2019-09-07 12:58:57,325 INFO L443 ceAbstractionStarter]: For program point L839(line 839) no Hoare annotation was computed. [2019-09-07 12:58:57,325 INFO L443 ceAbstractionStarter]: For program point L641(lines 641 645) no Hoare annotation was computed. [2019-09-07 12:58:57,326 INFO L443 ceAbstractionStarter]: For program point L724(lines 724 730) no Hoare annotation was computed. [2019-09-07 12:58:57,326 INFO L439 ceAbstractionStarter]: At program point L691(line 691) the Hoare annotation is: (or (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (<= 0 (+ |old(~myStatus~0)| 1073741637))) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|))) (and (= 0 ~pended~0) (= ~s~0 |old(~s~0)|) (= ~myStatus~0 |old(~myStatus~0)|))) [2019-09-07 12:58:57,326 INFO L443 ceAbstractionStarter]: For program point L691-1(line 691) no Hoare annotation was computed. [2019-09-07 12:58:57,326 INFO L443 ceAbstractionStarter]: For program point L774(lines 774 778) no Hoare annotation was computed. [2019-09-07 12:58:57,326 INFO L443 ceAbstractionStarter]: For program point L560(lines 560 866) no Hoare annotation was computed. [2019-09-07 12:58:57,326 INFO L439 ceAbstractionStarter]: At program point L841(lines 634 850) the Hoare annotation is: (or (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (<= 0 (+ |old(~myStatus~0)| 1073741637))) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|))) (and (= ~s~0 ~NP~0) (= 0 ~pended~0))) [2019-09-07 12:58:57,326 INFO L443 ceAbstractionStarter]: For program point L808(lines 808 811) no Hoare annotation was computed. [2019-09-07 12:58:57,326 INFO L439 ceAbstractionStarter]: At program point L709(line 709) the Hoare annotation is: (or (and (= 0 ~pended~0) (= ~s~0 ~NP~0) (= ~myStatus~0 |old(~myStatus~0)|)) (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (<= 0 (+ |old(~myStatus~0)| 1073741637))) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)))) [2019-09-07 12:58:57,327 INFO L443 ceAbstractionStarter]: For program point L709-1(line 709) no Hoare annotation was computed. [2019-09-07 12:58:57,327 INFO L443 ceAbstractionStarter]: For program point L693(lines 693 697) no Hoare annotation was computed. [2019-09-07 12:58:57,327 INFO L439 ceAbstractionStarter]: At program point L561(lines 560 866) the Hoare annotation is: (or (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (<= 0 (+ |old(~myStatus~0)| 1073741637))) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|))) (and (= 0 ~pended~0) (= ~s~0 |old(~s~0)|) (= ~myStatus~0 |old(~myStatus~0)|))) [2019-09-07 12:58:57,327 INFO L443 ceAbstractionStarter]: For program point CdAudio535DeviceControlFINAL(lines 432 875) no Hoare annotation was computed. [2019-09-07 12:58:57,327 INFO L443 ceAbstractionStarter]: For program point L578(lines 578 862) no Hoare annotation was computed. [2019-09-07 12:58:57,327 INFO L443 ceAbstractionStarter]: For program point L760(lines 760 767) no Hoare annotation was computed. [2019-09-07 12:58:57,327 INFO L439 ceAbstractionStarter]: At program point L727(line 727) the Hoare annotation is: (or (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (<= 0 (+ |old(~myStatus~0)| 1073741637))) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|))) (and (= ~s~0 ~NP~0) (= 0 ~pended~0) (= ~myStatus~0 |old(~myStatus~0)|) (<= (+ CdAudio535DeviceControl_~status~5 1073741670) 0))) [2019-09-07 12:58:57,327 INFO L443 ceAbstractionStarter]: For program point L727-1(line 727) no Hoare annotation was computed. [2019-09-07 12:58:57,327 INFO L443 ceAbstractionStarter]: For program point L843(line 843) no Hoare annotation was computed. [2019-09-07 12:58:57,328 INFO L443 ceAbstractionStarter]: For program point L711(lines 711 732) no Hoare annotation was computed. [2019-09-07 12:58:57,328 INFO L443 ceAbstractionStarter]: For program point L678(lines 678 680) no Hoare annotation was computed. [2019-09-07 12:58:57,328 INFO L443 ceAbstractionStarter]: For program point L711-1(lines 711 732) no Hoare annotation was computed. [2019-09-07 12:58:57,328 INFO L439 ceAbstractionStarter]: At program point L579(lines 578 862) the Hoare annotation is: (or (and (= 0 ~pended~0) (= ~s~0 |old(~s~0)|)) (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (<= 0 (+ |old(~myStatus~0)| 1073741637))) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)))) [2019-09-07 12:58:57,328 INFO L443 ceAbstractionStarter]: For program point L596(lines 596 858) no Hoare annotation was computed. [2019-09-07 12:58:57,328 INFO L443 ceAbstractionStarter]: For program point L646(lines 646 650) no Hoare annotation was computed. [2019-09-07 12:58:57,329 INFO L439 ceAbstractionStarter]: At program point L1947(lines 1900 1976) the Hoare annotation is: (let ((.cse9 (+ ~myStatus~0 1073741637)) (.cse17 (= 0 ~routine~0)) (.cse19 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse18 (<= (+ ~NP~0 5) ~MPR3~0))) (let ((.cse2 (= 0 ~pended~0)) (.cse0 (not .cse18)) (.cse12 (not (<= (+ |old(~s~0)| 2) ~SKIP1~0))) (.cse1 (not .cse19)) (.cse16 (and .cse18 .cse19 (= ~s~0 |old(~s~0)|) .cse17 (<= (+ ~s~0 2) ~SKIP1~0))) (.cse3 (not .cse17)) (.cse13 (not (= |old(~s~0)| ~NP~0))) (.cse4 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse5 (not (<= (+ ~SKIP2~0 3) ~IPC~0))) (.cse14 (not (<= 0 .cse9))) (.cse6 (not (= 0 |old(~pended~0)|))) (.cse15 (not (<= 1 ~compRegistered~0)))) (and (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) .cse0 .cse1 (and .cse2 (= ~SKIP1~0 ~s~0)) (not (<= |old(~s~0)| ~SKIP1~0)) .cse3 .cse4 .cse5 (not (<= ~SKIP1~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) .cse6) (or (let ((.cse7 (+ IofCallDriver_~compRetStatus~0 1073741802)) (.cse8 (+ IofCallDriver_~__cil_tmp8~1 1073741802))) (and (= ~s~0 ~MPR1~0) (<= .cse7 0) .cse2 (<= 0 .cse7) (<= .cse8 0) (= ~setEventCalled~0 1) (<= 0 .cse8))) (let ((.cse10 (or .cse0 .cse12 .cse1 (not (= 1 ~routine~0)) .cse13 .cse4 .cse5 .cse14 .cse6 .cse15)) (.cse11 (not (= ~customIrp~0 0)))) (and (or (not (<= .cse9 0)) .cse10 .cse11) (or .cse10 (not (<= 0 ~myStatus~0)) .cse11)))) (or .cse0 (not (= ~myStatus~0 0)) .cse12 .cse1 .cse3 .cse16 .cse13 .cse4 .cse5 .cse6 .cse15) (or .cse0 .cse12 .cse1 (not (<= (+ ~myStatus~0 1) 0)) .cse16 .cse3 .cse13 .cse4 .cse5 .cse14 .cse6 .cse15)))) [2019-09-07 12:58:57,329 INFO L439 ceAbstractionStarter]: At program point L1935(lines 1934 1949) the Hoare annotation is: (let ((.cse9 (+ ~myStatus~0 1073741637)) (.cse17 (= 0 ~routine~0)) (.cse19 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse18 (<= (+ ~NP~0 5) ~MPR3~0))) (let ((.cse2 (= 0 ~pended~0)) (.cse0 (not .cse18)) (.cse12 (not (<= (+ |old(~s~0)| 2) ~SKIP1~0))) (.cse1 (not .cse19)) (.cse16 (and .cse18 .cse19 (= ~s~0 |old(~s~0)|) .cse17 (<= (+ ~s~0 2) ~SKIP1~0))) (.cse3 (not .cse17)) (.cse13 (not (= |old(~s~0)| ~NP~0))) (.cse4 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse5 (not (<= (+ ~SKIP2~0 3) ~IPC~0))) (.cse14 (not (<= 0 .cse9))) (.cse6 (not (= 0 |old(~pended~0)|))) (.cse15 (not (<= 1 ~compRegistered~0)))) (and (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) .cse0 .cse1 (and .cse2 (= ~SKIP1~0 ~s~0)) (not (<= |old(~s~0)| ~SKIP1~0)) .cse3 .cse4 .cse5 (not (<= ~SKIP1~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) .cse6) (or (let ((.cse7 (+ IofCallDriver_~compRetStatus~0 1073741802)) (.cse8 (+ IofCallDriver_~__cil_tmp8~1 1073741802))) (and (= ~s~0 ~MPR1~0) (<= .cse7 0) .cse2 (<= 0 .cse7) (<= .cse8 0) (= ~setEventCalled~0 1) (<= 0 .cse8))) (let ((.cse10 (or .cse0 .cse12 .cse1 (not (= 1 ~routine~0)) .cse13 .cse4 .cse5 .cse14 .cse6 .cse15)) (.cse11 (not (= ~customIrp~0 0)))) (and (or (not (<= .cse9 0)) .cse10 .cse11) (or .cse10 (not (<= 0 ~myStatus~0)) .cse11)))) (or .cse0 (not (= ~myStatus~0 0)) .cse12 .cse1 .cse3 .cse16 .cse13 .cse4 .cse5 .cse6 .cse15) (or .cse0 .cse12 .cse1 (not (<= (+ ~myStatus~0 1) 0)) .cse16 .cse3 .cse13 .cse4 .cse5 .cse14 .cse6 .cse15)))) [2019-09-07 12:58:57,329 INFO L443 ceAbstractionStarter]: For program point L1902(lines 1902 1912) no Hoare annotation was computed. [2019-09-07 12:58:57,329 INFO L443 ceAbstractionStarter]: For program point L1927(lines 1927 1950) no Hoare annotation was computed. [2019-09-07 12:58:57,329 INFO L443 ceAbstractionStarter]: For program point L1956(lines 1956 1973) no Hoare annotation was computed. [2019-09-07 12:58:57,329 INFO L443 ceAbstractionStarter]: For program point L1915(lines 1915 1919) no Hoare annotation was computed. [2019-09-07 12:58:57,329 INFO L443 ceAbstractionStarter]: For program point L1907(lines 1907 1911) no Hoare annotation was computed. [2019-09-07 12:58:57,330 INFO L439 ceAbstractionStarter]: At program point IofCallDriverENTRY(lines 1893 1977) the Hoare annotation is: (let ((.cse14 (+ ~myStatus~0 1073741637))) (let ((.cse19 (<= 1 ~compRegistered~0)) (.cse20 (<= 0 .cse14)) (.cse17 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse18 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse22 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse21 (<= (+ ~NP~0 5) ~MPR3~0))) (let ((.cse0 (not .cse21)) (.cse1 (not (<= (+ |old(~s~0)| 2) ~SKIP1~0))) (.cse3 (not .cse22)) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (not .cse18)) (.cse7 (not .cse17)) (.cse15 (not .cse20)) (.cse8 (not (= 0 |old(~pended~0)|))) (.cse9 (not .cse19)) (.cse10 (= 0 ~pended~0)) (.cse16 (= ~s~0 |old(~s~0)|))) (let ((.cse12 (and .cse10 .cse17 .cse18 .cse16 .cse19 .cse20 .cse21 .cse22 (= ~NP~0 |old(~s~0)|) (= ~routine~0 1) (<= (+ ~s~0 2) ~SKIP1~0))) (.cse11 (or .cse0 .cse1 .cse3 (not (= 1 ~routine~0)) .cse5 .cse6 .cse7 .cse15 .cse8 .cse9)) (.cse13 (not (= ~customIrp~0 0))) (.cse2 (and .cse10 .cse16)) (.cse4 (not (= 0 ~routine~0)))) (and (or .cse0 (not (= ~myStatus~0 0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) .cse0 .cse3 (and .cse10 (= ~SKIP1~0 ~s~0)) (not (<= |old(~s~0)| ~SKIP1~0)) .cse4 .cse6 .cse7 (not (<= ~SKIP1~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) .cse8) (or .cse11 .cse12 (not (<= 0 ~myStatus~0)) .cse13) (or .cse12 (or (not (<= .cse14 0)) .cse11 .cse13)) (or .cse0 .cse1 .cse3 (not (<= (+ ~myStatus~0 1) 0)) .cse2 .cse4 .cse5 .cse6 .cse7 .cse15 .cse8 .cse9)))))) [2019-09-07 12:58:57,330 INFO L443 ceAbstractionStarter]: For program point L1907-2(lines 1902 1912) no Hoare annotation was computed. [2019-09-07 12:58:57,330 INFO L443 ceAbstractionStarter]: For program point L1965(lines 1965 1972) no Hoare annotation was computed. [2019-09-07 12:58:57,330 INFO L443 ceAbstractionStarter]: For program point L1932(lines 1932 1949) no Hoare annotation was computed. [2019-09-07 12:58:57,330 INFO L439 ceAbstractionStarter]: At program point L1928(lines 1927 1950) the Hoare annotation is: (let ((.cse9 (+ ~myStatus~0 1073741637)) (.cse17 (= 0 ~routine~0)) (.cse19 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse18 (<= (+ ~NP~0 5) ~MPR3~0))) (let ((.cse2 (= 0 ~pended~0)) (.cse0 (not .cse18)) (.cse12 (not (<= (+ |old(~s~0)| 2) ~SKIP1~0))) (.cse1 (not .cse19)) (.cse16 (and .cse18 .cse19 (= ~s~0 |old(~s~0)|) .cse17 (<= (+ ~s~0 2) ~SKIP1~0))) (.cse3 (not .cse17)) (.cse13 (not (= |old(~s~0)| ~NP~0))) (.cse4 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse5 (not (<= (+ ~SKIP2~0 3) ~IPC~0))) (.cse14 (not (<= 0 .cse9))) (.cse6 (not (= 0 |old(~pended~0)|))) (.cse15 (not (<= 1 ~compRegistered~0)))) (and (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) .cse0 .cse1 (and .cse2 (= ~SKIP1~0 ~s~0)) (not (<= |old(~s~0)| ~SKIP1~0)) .cse3 .cse4 .cse5 (not (<= ~SKIP1~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) .cse6) (or (let ((.cse7 (+ IofCallDriver_~compRetStatus~0 1073741802)) (.cse8 (+ IofCallDriver_~__cil_tmp8~1 1073741802))) (and (= ~s~0 ~MPR1~0) (<= .cse7 0) .cse2 (<= 0 .cse7) (<= .cse8 0) (= ~setEventCalled~0 1) (<= 0 .cse8))) (let ((.cse10 (or .cse0 .cse12 .cse1 (not (= 1 ~routine~0)) .cse13 .cse4 .cse5 .cse14 .cse6 .cse15)) (.cse11 (not (= ~customIrp~0 0)))) (and (or (not (<= .cse9 0)) .cse10 .cse11) (or .cse10 (not (<= 0 ~myStatus~0)) .cse11)))) (or .cse0 (not (= ~myStatus~0 0)) .cse12 .cse1 .cse3 .cse16 .cse13 .cse4 .cse5 .cse6 .cse15) (or .cse0 .cse12 .cse1 (not (<= (+ ~myStatus~0 1) 0)) .cse16 .cse3 .cse13 .cse4 .cse5 .cse14 .cse6 .cse15)))) [2019-09-07 12:58:57,330 INFO L443 ceAbstractionStarter]: For program point L1957(lines 1957 1963) no Hoare annotation was computed. [2019-09-07 12:58:57,331 INFO L443 ceAbstractionStarter]: For program point IofCallDriverFINAL(lines 1893 1977) no Hoare annotation was computed. [2019-09-07 12:58:57,331 INFO L443 ceAbstractionStarter]: For program point IofCallDriverEXIT(lines 1893 1977) no Hoare annotation was computed. [2019-09-07 12:58:57,331 INFO L439 ceAbstractionStarter]: At program point L1970(line 1970) the Hoare annotation is: (let ((.cse10 (+ ~myStatus~0 1073741637))) (let ((.cse0 (not (<= (+ ~NP~0 5) ~MPR3~0))) (.cse1 (not (<= (+ |old(~s~0)| 2) ~SKIP1~0))) (.cse2 (not (<= (+ ~DC~0 2) ~SKIP2~0))) (.cse4 (not (= |old(~s~0)| ~NP~0))) (.cse5 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse6 (not (<= (+ ~SKIP2~0 3) ~IPC~0))) (.cse7 (not (<= 0 .cse10))) (.cse8 (not (= 0 |old(~pended~0)|))) (.cse9 (not (<= 1 ~compRegistered~0)))) (let ((.cse11 (or .cse0 .cse1 .cse2 (not (= 1 ~routine~0)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9)) (.cse12 (not (= ~customIrp~0 0))) (.cse3 (not (= 0 ~routine~0)))) (and (or .cse0 .cse1 .cse2 (not (<= (+ ~myStatus~0 1) 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or (not (<= .cse10 0)) .cse11 .cse12) (or .cse0 (not (= ~myStatus~0 0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9) (or .cse11 (not (<= 0 ~myStatus~0)) .cse12) (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) .cse0 .cse2 (not (<= |old(~s~0)| ~SKIP1~0)) .cse3 .cse5 .cse6 (not (<= ~SKIP1~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) .cse8))))) [2019-09-07 12:58:57,331 INFO L443 ceAbstractionStarter]: For program point L1970-1(lines 1952 1974) no Hoare annotation was computed. [2019-09-07 12:58:57,331 INFO L439 ceAbstractionStarter]: At program point L1904(line 1904) the Hoare annotation is: (let ((.cse10 (+ ~myStatus~0 1073741637))) (let ((.cse0 (not (<= (+ ~NP~0 5) ~MPR3~0))) (.cse1 (not (<= (+ |old(~s~0)| 2) ~SKIP1~0))) (.cse3 (not (<= (+ ~DC~0 2) ~SKIP2~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse7 (not (<= (+ ~SKIP2~0 3) ~IPC~0))) (.cse13 (not (<= 0 .cse10))) (.cse8 (not (= 0 |old(~pended~0)|))) (.cse9 (not (<= 1 ~compRegistered~0)))) (let ((.cse2 (and (= 0 ~pended~0) (= ~s~0 |old(~s~0)|))) (.cse11 (or .cse0 .cse1 .cse3 (not (= 1 ~routine~0)) .cse5 .cse6 .cse7 .cse13 .cse8 .cse9)) (.cse12 (not (= ~customIrp~0 0))) (.cse4 (not (= 0 ~routine~0)))) (and (or .cse0 (not (= ~myStatus~0 0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or (not (<= .cse10 0)) .cse11 .cse12) (or .cse0 .cse1 .cse3 (not (<= (+ ~myStatus~0 1) 0)) .cse2 .cse4 .cse5 .cse6 .cse7 .cse13 .cse8 .cse9) (or .cse11 (not (<= 0 ~myStatus~0)) .cse12) (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) .cse0 .cse3 (not (<= |old(~s~0)| ~SKIP1~0)) .cse4 .cse6 .cse7 (not (<= ~SKIP1~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) .cse8))))) [2019-09-07 12:58:57,331 INFO L443 ceAbstractionStarter]: For program point L1904-1(line 1904) no Hoare annotation was computed. [2019-09-07 12:58:57,332 INFO L439 ceAbstractionStarter]: At program point L1933(lines 1932 1949) the Hoare annotation is: (let ((.cse9 (+ ~myStatus~0 1073741637)) (.cse17 (= 0 ~routine~0)) (.cse19 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse18 (<= (+ ~NP~0 5) ~MPR3~0))) (let ((.cse2 (= 0 ~pended~0)) (.cse0 (not .cse18)) (.cse12 (not (<= (+ |old(~s~0)| 2) ~SKIP1~0))) (.cse1 (not .cse19)) (.cse16 (and .cse18 .cse19 (= ~s~0 |old(~s~0)|) .cse17 (<= (+ ~s~0 2) ~SKIP1~0))) (.cse3 (not .cse17)) (.cse13 (not (= |old(~s~0)| ~NP~0))) (.cse4 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse5 (not (<= (+ ~SKIP2~0 3) ~IPC~0))) (.cse14 (not (<= 0 .cse9))) (.cse6 (not (= 0 |old(~pended~0)|))) (.cse15 (not (<= 1 ~compRegistered~0)))) (and (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) .cse0 .cse1 (and .cse2 (= ~SKIP1~0 ~s~0)) (not (<= |old(~s~0)| ~SKIP1~0)) .cse3 .cse4 .cse5 (not (<= ~SKIP1~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) .cse6) (or (let ((.cse7 (+ IofCallDriver_~compRetStatus~0 1073741802)) (.cse8 (+ IofCallDriver_~__cil_tmp8~1 1073741802))) (and (= ~s~0 ~MPR1~0) (<= .cse7 0) .cse2 (<= 0 .cse7) (<= .cse8 0) (= ~setEventCalled~0 1) (<= 0 .cse8))) (let ((.cse10 (or .cse0 .cse12 .cse1 (not (= 1 ~routine~0)) .cse13 .cse4 .cse5 .cse14 .cse6 .cse15)) (.cse11 (not (= ~customIrp~0 0)))) (and (or (not (<= .cse9 0)) .cse10 .cse11) (or .cse10 (not (<= 0 ~myStatus~0)) .cse11)))) (or .cse0 (not (= ~myStatus~0 0)) .cse12 .cse1 .cse3 .cse16 .cse13 .cse4 .cse5 .cse6 .cse15) (or .cse0 .cse12 .cse1 (not (<= (+ ~myStatus~0 1) 0)) .cse16 .cse3 .cse13 .cse4 .cse5 .cse14 .cse6 .cse15)))) [2019-09-07 12:58:57,332 INFO L439 ceAbstractionStarter]: At program point L1917(line 1917) the Hoare annotation is: (let ((.cse0 (+ ~myStatus~0 1073741637))) (let ((.cse17 (<= 1 ~compRegistered~0)) (.cse18 (<= 0 .cse0)) (.cse15 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse16 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse20 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse19 (<= (+ ~NP~0 5) ~MPR3~0))) (let ((.cse4 (not .cse19)) (.cse5 (not (<= (+ |old(~s~0)| 2) ~SKIP1~0))) (.cse6 (not .cse20)) (.cse8 (not (= |old(~s~0)| ~NP~0))) (.cse9 (not .cse16)) (.cse10 (not .cse15)) (.cse11 (not .cse18)) (.cse12 (not (= 0 |old(~pended~0)|))) (.cse13 (not .cse17))) (let ((.cse3 (let ((.cse14 (+ IofCallDriver_~compRetStatus~0 1073741802)) (.cse21 (+ IofCallDriver_~__cil_tmp8~1 1073741802))) (and (<= .cse14 0) (= 0 ~pended~0) (= ~s~0 ~NP~0) .cse15 (<= 0 .cse14) .cse16 .cse17 .cse18 .cse19 .cse20 (<= .cse21 0) (= ~NP~0 |old(~s~0)|) (= ~routine~0 1) (<= (+ ~s~0 2) ~SKIP1~0) (= ~setEventCalled~0 1) (<= 0 .cse21)))) (.cse1 (or .cse4 .cse5 .cse6 (not (= 1 ~routine~0)) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13)) (.cse2 (not (= ~customIrp~0 0))) (.cse7 (not (= 0 ~routine~0)))) (and (or (or (not (<= .cse0 0)) .cse1 .cse2) .cse3) (or .cse4 .cse5 .cse6 (not (<= (+ ~myStatus~0 1) 0)) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (or .cse4 (not (= ~myStatus~0 0)) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13) (or .cse3 .cse1 (not (<= 0 ~myStatus~0)) .cse2) (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) .cse4 .cse6 (not (<= |old(~s~0)| ~SKIP1~0)) .cse7 .cse9 .cse10 (not (<= ~SKIP1~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) .cse12)))))) [2019-09-07 12:58:57,332 INFO L439 ceAbstractionStarter]: At program point L1909(line 1909) the Hoare annotation is: (let ((.cse13 (+ ~myStatus~0 1073741637))) (let ((.cse16 (<= 1 ~compRegistered~0)) (.cse17 (<= 0 .cse13)) (.cse14 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse15 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse19 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse18 (<= (+ ~NP~0 5) ~MPR3~0))) (let ((.cse3 (not .cse18)) (.cse4 (not (<= (+ |old(~s~0)| 2) ~SKIP1~0))) (.cse5 (not .cse19)) (.cse7 (not (= |old(~s~0)| ~NP~0))) (.cse8 (not .cse15)) (.cse9 (not .cse14)) (.cse10 (not .cse17)) (.cse11 (not (= 0 |old(~pended~0)|))) (.cse12 (not .cse16))) (let ((.cse1 (and (= 0 ~pended~0) .cse14 .cse15 (= ~s~0 |old(~s~0)|) .cse16 .cse17 .cse18 .cse19 (= ~NP~0 |old(~s~0)|) (= ~routine~0 1) (<= (+ ~s~0 2) ~SKIP1~0))) (.cse0 (or .cse3 .cse4 .cse5 (not (= 1 ~routine~0)) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12)) (.cse2 (not (= ~customIrp~0 0))) (.cse6 (not (= 0 ~routine~0)))) (and (or .cse0 .cse1 (not (<= 0 ~myStatus~0)) .cse2) (or .cse3 .cse4 .cse5 (not (<= (+ ~myStatus~0 1) 0)) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse3 (not (= ~myStatus~0 0)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12) (or .cse1 (or (not (<= .cse13 0)) .cse0 .cse2)) (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) .cse3 .cse5 (not (<= |old(~s~0)| ~SKIP1~0)) .cse6 .cse8 .cse9 (not (<= ~SKIP1~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) .cse11)))))) [2019-09-07 12:58:57,332 INFO L443 ceAbstractionStarter]: For program point L1909-1(line 1909) no Hoare annotation was computed. [2019-09-07 12:58:57,333 INFO L443 ceAbstractionStarter]: For program point L1901(lines 1901 1921) no Hoare annotation was computed. [2019-09-07 12:58:57,333 INFO L443 ceAbstractionStarter]: For program point L1901-1(lines 1900 1976) no Hoare annotation was computed. [2019-09-07 12:58:57,333 INFO L439 ceAbstractionStarter]: At program point CdAudioSendToNextDriverENTRY(lines 365 386) the Hoare annotation is: (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (= 0 ~routine~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= 0 |old(~pended~0)|)) (and (= 0 ~pended~0) (= ~s~0 |old(~s~0)|)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (or (not (= |old(~s~0)| ~NP~0)) (not (= ~compRegistered~0 0)))) [2019-09-07 12:58:57,333 INFO L439 ceAbstractionStarter]: At program point L382(line 382) the Hoare annotation is: (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (= 0 ~routine~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= 0 |old(~pended~0)|)) (and (= 0 ~pended~0) (= ~SKIP1~0 ~s~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (or (not (= |old(~s~0)| ~NP~0)) (not (= ~compRegistered~0 0)))) [2019-09-07 12:58:57,333 INFO L443 ceAbstractionStarter]: For program point L382-1(line 382) no Hoare annotation was computed. [2019-09-07 12:58:57,333 INFO L439 ceAbstractionStarter]: At program point L376(line 376) the Hoare annotation is: (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (= 0 ~routine~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (or (not (= |old(~s~0)| ~NP~0)) (not (= ~compRegistered~0 0)))) [2019-09-07 12:58:57,333 INFO L443 ceAbstractionStarter]: For program point L376-1(lines 372 378) no Hoare annotation was computed. [2019-09-07 12:58:57,334 INFO L443 ceAbstractionStarter]: For program point CdAudioSendToNextDriverFINAL(lines 365 386) no Hoare annotation was computed. [2019-09-07 12:58:57,334 INFO L443 ceAbstractionStarter]: For program point L372(lines 372 378) no Hoare annotation was computed. [2019-09-07 12:58:57,334 INFO L443 ceAbstractionStarter]: For program point CdAudioSendToNextDriverEXIT(lines 365 386) no Hoare annotation was computed. [2019-09-07 12:58:57,334 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2019-09-07 12:58:57,334 INFO L439 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)) [2019-09-07 12:58:57,334 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-09-07 12:58:57,334 INFO L439 ceAbstractionStarter]: At program point L1537(line 1537) the Hoare annotation is: (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (and (= ~s~0 ~NP~0) (= 0 ~pended~0) (<= (+ CdAudioAtapiDeviceControl_~status~7 1073741670) 0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|))) [2019-09-07 12:58:57,334 INFO L443 ceAbstractionStarter]: For program point L1537-1(line 1537) no Hoare annotation was computed. [2019-09-07 12:58:57,335 INFO L443 ceAbstractionStarter]: For program point L1533(lines 1533 1540) no Hoare annotation was computed. [2019-09-07 12:58:57,335 INFO L439 ceAbstractionStarter]: At program point L1530(line 1530) the Hoare annotation is: (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (and (= 0 ~pended~0) (= ~s~0 |old(~s~0)|)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|))) [2019-09-07 12:58:57,335 INFO L443 ceAbstractionStarter]: For program point L1530-1(line 1530) no Hoare annotation was computed. [2019-09-07 12:58:57,335 INFO L443 ceAbstractionStarter]: For program point CdAudioAtapiDeviceControlEXIT(lines 1499 1556) no Hoare annotation was computed. [2019-09-07 12:58:57,335 INFO L443 ceAbstractionStarter]: For program point L1524(lines 1524 1547) no Hoare annotation was computed. [2019-09-07 12:58:57,335 INFO L439 ceAbstractionStarter]: At program point CdAudioAtapiDeviceControlENTRY(lines 1499 1556) the Hoare annotation is: (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (and (= 0 ~pended~0) (= ~s~0 |old(~s~0)|)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|))) [2019-09-07 12:58:57,335 INFO L443 ceAbstractionStarter]: For program point L1524-1(lines 1524 1547) no Hoare annotation was computed. [2019-09-07 12:58:57,335 INFO L439 ceAbstractionStarter]: At program point L1552(line 1552) the Hoare annotation is: (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~DC~0 2) ~SKIP2~0))) [2019-09-07 12:58:57,336 INFO L443 ceAbstractionStarter]: For program point L1552-1(line 1552) no Hoare annotation was computed. [2019-09-07 12:58:57,336 INFO L439 ceAbstractionStarter]: At program point L1544(line 1544) the Hoare annotation is: (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (and (= 0 ~pended~0) (= ~s~0 |old(~s~0)|)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|))) [2019-09-07 12:58:57,336 INFO L443 ceAbstractionStarter]: For program point L1544-1(line 1544) no Hoare annotation was computed. [2019-09-07 12:58:57,336 INFO L443 ceAbstractionStarter]: For program point CdAudioAtapiDeviceControlFINAL(lines 1499 1556) no Hoare annotation was computed. [2019-09-07 12:58:57,336 INFO L439 ceAbstractionStarter]: At program point L353(line 353) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~s~0 |old(~s~0)|) (= 0 ~routine~0)) (let ((.cse0 (not (<= (+ ~NP~0 2) ~SKIP1~0))) (.cse1 (not (<= (+ ~NP~0 5) ~MPR3~0))) (.cse2 (not (<= (+ ~DC~0 2) ~SKIP2~0))) (.cse3 (not (= 0 |old(~routine~0)|))) (.cse4 (not (= |old(~s~0)| ~NP~0))) (.cse5 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse6 (not (<= (+ ~SKIP2~0 3) ~IPC~0))) (.cse7 (not (= |old(~compRegistered~0)| 0))) (.cse8 (not (= 0 |old(~pended~0)|)))) (and (or .cse0 .cse1 .cse2 (not (<= (+ |old(~myStatus~0)| 1) 0)) .cse3 .cse4 .cse5 .cse6 (not (<= 0 (+ |old(~myStatus~0)| 1073741637))) .cse7 .cse8) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8)))) [2019-09-07 12:58:57,336 INFO L439 ceAbstractionStarter]: At program point L320(lines 319 360) the Hoare annotation is: (or (let ((.cse0 (not (<= (+ ~NP~0 2) ~SKIP1~0))) (.cse1 (not (<= (+ ~NP~0 5) ~MPR3~0))) (.cse2 (not (<= (+ ~DC~0 2) ~SKIP2~0))) (.cse3 (not (= 0 |old(~routine~0)|))) (.cse4 (not (= |old(~s~0)| ~NP~0))) (.cse5 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse6 (not (<= (+ ~SKIP2~0 3) ~IPC~0))) (.cse7 (not (= |old(~compRegistered~0)| 0))) (.cse8 (not (= 0 |old(~pended~0)|)))) (and (or .cse0 .cse1 .cse2 (not (<= (+ |old(~myStatus~0)| 1) 0)) .cse3 .cse4 .cse5 .cse6 (not (<= 0 (+ |old(~myStatus~0)| 1073741637))) .cse7 .cse8) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8))) (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~s~0 |old(~s~0)|) (= 0 ~routine~0) (= ~myStatus~0 |old(~myStatus~0)|))) [2019-09-07 12:58:57,337 INFO L443 ceAbstractionStarter]: For program point L353-1(line 353) no Hoare annotation was computed. [2019-09-07 12:58:57,337 INFO L443 ceAbstractionStarter]: For program point L316(lines 316 361) no Hoare annotation was computed. [2019-09-07 12:58:57,337 INFO L443 ceAbstractionStarter]: For program point L347(line 347) no Hoare annotation was computed. [2019-09-07 12:58:57,337 INFO L443 ceAbstractionStarter]: For program point L337(line 337) no Hoare annotation was computed. [2019-09-07 12:58:57,337 INFO L443 ceAbstractionStarter]: For program point L325(lines 325 358) no Hoare annotation was computed. [2019-09-07 12:58:57,337 INFO L439 ceAbstractionStarter]: At program point L356(lines 329 357) the Hoare annotation is: (let ((.cse12 (<= (+ ~NP~0 5) ~MPR3~0))) (let ((.cse0 (= CdAudioDeviceControl_~status~3 ~lowerDriverReturn~0)) (.cse1 (= ~s~0 ~IPC~0)) (.cse13 (and (= 0 ~pended~0) .cse12)) (.cse2 (= 0 ~routine~0))) (or (and .cse0 .cse1 .cse2 (<= 1 ~compRegistered~0)) (let ((.cse3 (not (<= (+ ~NP~0 2) ~SKIP1~0))) (.cse4 (not .cse12)) (.cse5 (not (<= (+ ~DC~0 2) ~SKIP2~0))) (.cse6 (not (= 0 |old(~routine~0)|))) (.cse7 (not (= |old(~s~0)| ~NP~0))) (.cse8 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse9 (not (<= (+ ~SKIP2~0 3) ~IPC~0))) (.cse10 (not (= |old(~compRegistered~0)| 0))) (.cse11 (not (= 0 |old(~pended~0)|)))) (and (or .cse3 .cse4 .cse5 (not (<= (+ |old(~myStatus~0)| 1) 0)) .cse6 .cse7 .cse8 .cse9 (not (<= 0 (+ |old(~myStatus~0)| 1073741637))) .cse10 .cse11) (or .cse3 .cse4 (not (= |old(~myStatus~0)| 0)) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11))) (and (<= CdAudioDeviceControl_~status~3 ~lowerDriverReturn~0) (and .cse13 (= ~s~0 ~SKIP2~0) .cse2) (<= ~lowerDriverReturn~0 CdAudioDeviceControl_~status~3)) (and (and .cse13 .cse2 (= ~s~0 ~DC~0)) (not (= CdAudioDeviceControl_~status~3 259))) (and .cse0 .cse1 .cse13 .cse2)))) [2019-09-07 12:58:57,337 INFO L439 ceAbstractionStarter]: At program point L323(lines 322 359) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~s~0 |old(~s~0)|) (= 0 ~routine~0)) (let ((.cse0 (not (<= (+ ~NP~0 2) ~SKIP1~0))) (.cse1 (not (<= (+ ~NP~0 5) ~MPR3~0))) (.cse2 (not (<= (+ ~DC~0 2) ~SKIP2~0))) (.cse3 (not (= 0 |old(~routine~0)|))) (.cse4 (not (= |old(~s~0)| ~NP~0))) (.cse5 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse6 (not (<= (+ ~SKIP2~0 3) ~IPC~0))) (.cse7 (not (= |old(~compRegistered~0)| 0))) (.cse8 (not (= 0 |old(~pended~0)|)))) (and (or .cse0 .cse1 .cse2 (not (<= (+ |old(~myStatus~0)| 1) 0)) .cse3 .cse4 .cse5 .cse6 (not (<= 0 (+ |old(~myStatus~0)| 1073741637))) .cse7 .cse8) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8)))) [2019-09-07 12:58:57,338 INFO L443 ceAbstractionStarter]: For program point L319(lines 319 360) no Hoare annotation was computed. [2019-09-07 12:58:57,338 INFO L439 ceAbstractionStarter]: At program point L317(lines 316 361) the Hoare annotation is: (or (let ((.cse0 (not (<= (+ ~NP~0 2) ~SKIP1~0))) (.cse1 (not (<= (+ ~NP~0 5) ~MPR3~0))) (.cse2 (not (<= (+ ~DC~0 2) ~SKIP2~0))) (.cse3 (not (= 0 |old(~routine~0)|))) (.cse4 (not (= |old(~s~0)| ~NP~0))) (.cse5 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse6 (not (<= (+ ~SKIP2~0 3) ~IPC~0))) (.cse7 (not (= |old(~compRegistered~0)| 0))) (.cse8 (not (= 0 |old(~pended~0)|)))) (and (or .cse0 .cse1 .cse2 (not (<= (+ |old(~myStatus~0)| 1) 0)) .cse3 .cse4 .cse5 .cse6 (not (<= 0 (+ |old(~myStatus~0)| 1073741637))) .cse7 .cse8) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8))) (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~s~0 |old(~s~0)|) (= 0 ~routine~0) (= ~myStatus~0 |old(~myStatus~0)|))) [2019-09-07 12:58:57,338 INFO L443 ceAbstractionStarter]: For program point L342(line 342) no Hoare annotation was computed. [2019-09-07 12:58:57,338 INFO L443 ceAbstractionStarter]: For program point CdAudioDeviceControlEXIT(lines 311 364) no Hoare annotation was computed. [2019-09-07 12:58:57,338 INFO L439 ceAbstractionStarter]: At program point CdAudioDeviceControlENTRY(lines 311 364) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~s~0 |old(~s~0)|) (= 0 ~routine~0) (= ~myStatus~0 |old(~myStatus~0)|)) (let ((.cse0 (not (<= (+ ~NP~0 2) ~SKIP1~0))) (.cse1 (not (<= (+ ~NP~0 5) ~MPR3~0))) (.cse2 (not (<= (+ ~DC~0 2) ~SKIP2~0))) (.cse3 (not (= 0 |old(~routine~0)|))) (.cse4 (not (= |old(~s~0)| ~NP~0))) (.cse5 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse6 (not (<= (+ ~SKIP2~0 3) ~IPC~0))) (.cse7 (not (= |old(~compRegistered~0)| 0))) (.cse8 (not (= 0 |old(~pended~0)|)))) (and (or .cse0 .cse1 .cse2 (not (<= (+ |old(~myStatus~0)| 1) 0)) .cse3 .cse4 .cse5 .cse6 (not (<= 0 (+ |old(~myStatus~0)| 1073741637))) .cse7 .cse8) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8)))) [2019-09-07 12:58:57,338 INFO L443 ceAbstractionStarter]: For program point L332(line 332) no Hoare annotation was computed. [2019-09-07 12:58:57,339 INFO L439 ceAbstractionStarter]: At program point L328(lines 327 358) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~s~0 |old(~s~0)|) (= 0 ~routine~0)) (let ((.cse0 (not (<= (+ ~NP~0 2) ~SKIP1~0))) (.cse1 (not (<= (+ ~NP~0 5) ~MPR3~0))) (.cse2 (not (<= (+ ~DC~0 2) ~SKIP2~0))) (.cse3 (not (= 0 |old(~routine~0)|))) (.cse4 (not (= |old(~s~0)| ~NP~0))) (.cse5 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse6 (not (<= (+ ~SKIP2~0 3) ~IPC~0))) (.cse7 (not (= |old(~compRegistered~0)| 0))) (.cse8 (not (= 0 |old(~pended~0)|)))) (and (or .cse0 .cse1 .cse2 (not (<= (+ |old(~myStatus~0)| 1) 0)) .cse3 .cse4 .cse5 .cse6 (not (<= 0 (+ |old(~myStatus~0)| 1073741637))) .cse7 .cse8) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8)))) [2019-09-07 12:58:57,339 INFO L439 ceAbstractionStarter]: At program point L326(lines 325 358) the Hoare annotation is: (or (let ((.cse0 (not (<= (+ ~NP~0 2) ~SKIP1~0))) (.cse1 (not (<= (+ ~NP~0 5) ~MPR3~0))) (.cse2 (not (<= (+ ~DC~0 2) ~SKIP2~0))) (.cse3 (not (= 0 |old(~routine~0)|))) (.cse4 (not (= |old(~s~0)| ~NP~0))) (.cse5 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse6 (not (<= (+ ~SKIP2~0 3) ~IPC~0))) (.cse7 (not (= |old(~compRegistered~0)| 0))) (.cse8 (not (= 0 |old(~pended~0)|)))) (and (or .cse0 .cse1 .cse2 (not (<= (+ |old(~myStatus~0)| 1) 0)) .cse3 .cse4 .cse5 .cse6 (not (<= 0 (+ |old(~myStatus~0)| 1073741637))) .cse7 .cse8) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8))) (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~s~0 |old(~s~0)|) (= 0 ~routine~0) (<= (+ ~myStatus~0 1) 0) (= ~myStatus~0 |old(~myStatus~0)|))) [2019-09-07 12:58:57,339 INFO L443 ceAbstractionStarter]: For program point CdAudioDeviceControlFINAL(lines 311 364) no Hoare annotation was computed. [2019-09-07 12:58:57,339 INFO L443 ceAbstractionStarter]: For program point L322(lines 322 359) no Hoare annotation was computed. [2019-09-07 12:58:57,339 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-09-07 12:58:57,339 INFO L439 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= ~s~0 ~MPR1~0) (= ~s~0 ~IPC~0) (= ~myStatus~0 0) (= 0 ~pended~0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (= ~s~0 ~UNLOADED~0) (= 0 ~routine~0) (= ~s~0 ~DC~0) (= 0 ~customIrp~0) (= ~s~0 ~SKIP2~0) (= ~MPR3~0 ~s~0) (= ~SKIP1~0 ~s~0)) [2019-09-07 12:58:57,340 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-09-07 12:58:57,340 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-09-07 12:58:57,340 INFO L439 ceAbstractionStarter]: At program point L1225(line 1225) the Hoare annotation is: (or (and (= ~s~0 ~NP~0) (= 0 ~pended~0) (or (<= 147480 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1) (not (= CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1 CdAudio435DeviceControl_~__cil_tmp42~0))) (<= (+ CdAudio435DeviceControl_~status~6 1073741670) 0)) (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (<= 0 (+ |old(~myStatus~0)| 1073741637))) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)))) [2019-09-07 12:58:57,340 INFO L443 ceAbstractionStarter]: For program point L1225-1(line 1225) no Hoare annotation was computed. [2019-09-07 12:58:57,341 INFO L439 ceAbstractionStarter]: At program point L1060(lines 1059 1474) the Hoare annotation is: (or (and (= 0 ~pended~0) (= ~s~0 |old(~s~0)|) (or (<= 147480 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1) (not (= CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1 CdAudio435DeviceControl_~__cil_tmp42~0)))) (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (<= 0 (+ |old(~myStatus~0)| 1073741637))) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)))) [2019-09-07 12:58:57,341 INFO L443 ceAbstractionStarter]: For program point L1341(lines 1341 1343) no Hoare annotation was computed. [2019-09-07 12:58:57,341 INFO L439 ceAbstractionStarter]: At program point L1275(line 1275) the Hoare annotation is: (or (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (<= 0 (+ |old(~myStatus~0)| 1073741637))) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|))) (and (= 0 ~pended~0) (= ~s~0 |old(~s~0)|) (<= 0 (+ CdAudio435DeviceControl_~__cil_tmp106~1 1073741670)) (<= (+ CdAudio435DeviceControl_~status~6 1073741670) 0) (<= (+ (div CdAudio435DeviceControl_~__cil_tmp106~1 4294967296) 1) 0))) [2019-09-07 12:58:57,341 INFO L443 ceAbstractionStarter]: For program point L1341-2(lines 1341 1343) no Hoare annotation was computed. [2019-09-07 12:58:57,341 INFO L443 ceAbstractionStarter]: For program point L1275-1(line 1275) no Hoare annotation was computed. [2019-09-07 12:58:57,341 INFO L439 ceAbstractionStarter]: At program point L1143(line 1143) the Hoare annotation is: (or (and (= ~s~0 ~NP~0) (= 0 ~pended~0) (<= (+ CdAudio435DeviceControl_~status~6 1073741670) 0)) (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (<= 0 (+ |old(~myStatus~0)| 1073741637))) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)))) [2019-09-07 12:58:57,341 INFO L443 ceAbstractionStarter]: For program point L1143-1(line 1143) no Hoare annotation was computed. [2019-09-07 12:58:57,341 INFO L443 ceAbstractionStarter]: For program point L1077(lines 1077 1470) no Hoare annotation was computed. [2019-09-07 12:58:57,341 INFO L443 ceAbstractionStarter]: For program point L1160(lines 1160 1172) no Hoare annotation was computed. [2019-09-07 12:58:57,342 INFO L443 ceAbstractionStarter]: For program point L1127(lines 1127 1131) no Hoare annotation was computed. [2019-09-07 12:58:57,342 INFO L439 ceAbstractionStarter]: At program point L1309(line 1309) the Hoare annotation is: (or (and (= ~s~0 ~NP~0) (= 0 ~pended~0) (or (<= 147480 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1) (not (= CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1 CdAudio435DeviceControl_~__cil_tmp42~0))) (<= (+ CdAudio435DeviceControl_~status~6 1073741670) 0)) (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (<= 0 (+ |old(~myStatus~0)| 1073741637))) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)))) [2019-09-07 12:58:57,342 INFO L443 ceAbstractionStarter]: For program point L1309-1(line 1309) no Hoare annotation was computed. [2019-09-07 12:58:57,342 INFO L443 ceAbstractionStarter]: For program point CdAudio435DeviceControlEXIT(lines 893 1498) no Hoare annotation was computed. [2019-09-07 12:58:57,342 INFO L439 ceAbstractionStarter]: At program point L1078(lines 1077 1470) the Hoare annotation is: (or (and (= 0 ~pended~0) (= ~s~0 |old(~s~0)|) (or (<= 147480 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1) (not (= CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1 CdAudio435DeviceControl_~__cil_tmp42~0)))) (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (<= 0 (+ |old(~myStatus~0)| 1073741637))) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)))) [2019-09-07 12:58:57,342 INFO L443 ceAbstractionStarter]: For program point L1095(lines 1095 1466) no Hoare annotation was computed. [2019-09-07 12:58:57,342 INFO L439 ceAbstractionStarter]: At program point L1442(line 1442) the Hoare annotation is: (or (and (= ~s~0 ~NP~0) (= 0 ~pended~0) (= 0 CdAudio435DeviceControl_~status~6)) (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (<= 0 (+ |old(~myStatus~0)| 1073741637))) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)))) [2019-09-07 12:58:57,343 INFO L443 ceAbstractionStarter]: For program point L1442-1(line 1442) no Hoare annotation was computed. [2019-09-07 12:58:57,343 INFO L443 ceAbstractionStarter]: For program point CdAudio435DeviceControlFINAL(lines 893 1498) no Hoare annotation was computed. [2019-09-07 12:58:57,343 INFO L439 ceAbstractionStarter]: At program point L1393(line 1393) the Hoare annotation is: (or (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (<= 0 (+ |old(~myStatus~0)| 1073741637))) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|))) (and (= 0 ~pended~0) (= ~s~0 |old(~s~0)|) (<= (+ CdAudio435DeviceControl_~status~6 1073741789) 0))) [2019-09-07 12:58:57,343 INFO L443 ceAbstractionStarter]: For program point L1393-1(line 1393) no Hoare annotation was computed. [2019-09-07 12:58:57,343 INFO L443 ceAbstractionStarter]: For program point L1245(lines 1245 1248) no Hoare annotation was computed. [2019-09-07 12:58:57,343 INFO L443 ceAbstractionStarter]: For program point L1113(lines 1113 1462) no Hoare annotation was computed. [2019-09-07 12:58:57,343 INFO L443 ceAbstractionStarter]: For program point L1014(lines 1014 1484) no Hoare annotation was computed. [2019-09-07 12:58:57,343 INFO L439 ceAbstractionStarter]: At program point L1460(lines 1117 1461) the Hoare annotation is: (let ((.cse0 (= ~s~0 ~NP~0)) (.cse1 (= 0 ~pended~0))) (or (and .cse0 .cse1 (= 0 CdAudio435DeviceControl_~status~6)) (and (<= (+ CdAudio435DeviceControl_~status~6 1073741670) 0) (and .cse0 .cse1)) (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (<= 0 (+ |old(~myStatus~0)| 1073741637))) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|))))) [2019-09-07 12:58:57,343 INFO L443 ceAbstractionStarter]: For program point L1163(lines 1163 1165) no Hoare annotation was computed. [2019-09-07 12:58:57,344 INFO L443 ceAbstractionStarter]: For program point L1163-2(lines 1163 1165) no Hoare annotation was computed. [2019-09-07 12:58:57,344 INFO L439 ceAbstractionStarter]: At program point L1378(line 1378) the Hoare annotation is: (or (and (= 0 ~pended~0) (= ~s~0 |old(~s~0)|) (<= (+ CdAudio435DeviceControl_~status~6 1073741670) 0)) (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (<= 0 (+ |old(~myStatus~0)| 1073741637))) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)))) [2019-09-07 12:58:57,344 INFO L443 ceAbstractionStarter]: For program point L1378-1(line 1378) no Hoare annotation was computed. [2019-09-07 12:58:57,344 INFO L443 ceAbstractionStarter]: For program point L1279(lines 1279 1292) no Hoare annotation was computed. [2019-09-07 12:58:57,344 INFO L439 ceAbstractionStarter]: At program point L1114(lines 1113 1462) the Hoare annotation is: (or (and (= 0 ~pended~0) (= ~s~0 |old(~s~0)|) (or (<= 147480 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1) (not (= CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1 CdAudio435DeviceControl_~__cil_tmp42~0)))) (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (<= 0 (+ |old(~myStatus~0)| 1073741637))) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)))) [2019-09-07 12:58:57,344 INFO L439 ceAbstractionStarter]: At program point L1015(lines 1014 1484) the Hoare annotation is: (or (and (= 0 ~pended~0) (= ~s~0 |old(~s~0)|)) (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (<= 0 (+ |old(~myStatus~0)| 1073741637))) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)))) [2019-09-07 12:58:57,345 INFO L439 ceAbstractionStarter]: At program point L1494(line 1494) the Hoare annotation is: (let ((.cse0 (and (= ~s~0 ~NP~0) (= 0 ~pended~0)))) (or (and (= 0 CdAudio435DeviceControl_~status~6) .cse0) (and (<= (+ CdAudio435DeviceControl_~status~6 1073741670) 0) .cse0) (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (<= 0 (+ |old(~myStatus~0)| 1073741637))) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|))))) [2019-09-07 12:58:57,345 INFO L443 ceAbstractionStarter]: For program point L1494-1(line 1494) no Hoare annotation was computed. [2019-09-07 12:58:57,345 INFO L443 ceAbstractionStarter]: For program point L1428(line 1428) no Hoare annotation was computed. [2019-09-07 12:58:57,345 INFO L439 ceAbstractionStarter]: At program point L1329(line 1329) the Hoare annotation is: (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (<= 0 (+ |old(~myStatus~0)| 1073741637))) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|))) [2019-09-07 12:58:57,345 INFO L439 ceAbstractionStarter]: At program point L1296(lines 1296 1297) the Hoare annotation is: (or (and (= 0 ~pended~0) (= ~s~0 |old(~s~0)|) (or (<= 147480 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1) (not (= CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1 CdAudio435DeviceControl_~__cil_tmp42~0)))) (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (<= 0 (+ |old(~myStatus~0)| 1073741637))) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)))) [2019-09-07 12:58:57,345 INFO L443 ceAbstractionStarter]: For program point L1329-1(line 1329) no Hoare annotation was computed. [2019-09-07 12:58:57,345 INFO L443 ceAbstractionStarter]: For program point L1296-1(lines 1296 1297) no Hoare annotation was computed. [2019-09-07 12:58:57,345 INFO L443 ceAbstractionStarter]: For program point L1230(lines 1230 1233) no Hoare annotation was computed. [2019-09-07 12:58:57,345 INFO L443 ceAbstractionStarter]: For program point L1032(lines 1032 1480) no Hoare annotation was computed. [2019-09-07 12:58:57,346 INFO L443 ceAbstractionStarter]: For program point L1132(lines 1132 1146) no Hoare annotation was computed. [2019-09-07 12:58:57,346 INFO L439 ceAbstractionStarter]: At program point L1033(lines 1023 1482) the Hoare annotation is: (or (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (<= 0 (+ |old(~myStatus~0)| 1073741637))) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|))) (and (let ((.cse0 (= 0 ~pended~0)) (.cse1 (= ~s~0 |old(~s~0)|))) (or (and .cse0 .cse1 (<= 147480 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1)) (and .cse0 .cse1 (not (= CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1 CdAudio435DeviceControl_~__cil_tmp42~0))))) (= ~myStatus~0 |old(~myStatus~0)|))) [2019-09-07 12:58:57,346 INFO L439 ceAbstractionStarter]: At program point L1347(line 1347) the Hoare annotation is: (or (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (<= 0 (+ |old(~myStatus~0)| 1073741637))) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|))) (and (= 0 ~pended~0) (= ~s~0 |old(~s~0)|) (<= (+ CdAudio435DeviceControl_~status~6 1073741789) 0))) [2019-09-07 12:58:57,346 INFO L443 ceAbstractionStarter]: For program point L1347-1(line 1347) no Hoare annotation was computed. [2019-09-07 12:58:57,346 INFO L443 ceAbstractionStarter]: For program point L1182-1(lines 1182 1186) no Hoare annotation was computed. [2019-09-07 12:58:57,346 INFO L439 ceAbstractionStarter]: At program point L1116(lines 1115 1462) the Hoare annotation is: (or (and (= 0 ~pended~0) (= ~s~0 |old(~s~0)|) (or (<= 147480 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1) (not (= CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1 CdAudio435DeviceControl_~__cil_tmp42~0)))) (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (<= 0 (+ |old(~myStatus~0)| 1073741637))) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)))) [2019-09-07 12:58:57,346 INFO L443 ceAbstractionStarter]: For program point L1050(lines 1050 1476) no Hoare annotation was computed. [2019-09-07 12:58:57,347 INFO L443 ceAbstractionStarter]: For program point L1430(lines 1430 1451) no Hoare annotation was computed. [2019-09-07 12:58:57,347 INFO L443 ceAbstractionStarter]: For program point L1265(lines 1265 1278) no Hoare annotation was computed. [2019-09-07 12:58:57,347 INFO L443 ceAbstractionStarter]: For program point L1216(lines 1216 1228) no Hoare annotation was computed. [2019-09-07 12:58:57,347 INFO L439 ceAbstractionStarter]: At program point L1150(lines 1150 1151) the Hoare annotation is: (or (and (= 0 ~pended~0) (= ~s~0 ~NP~0)) (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (<= 0 (+ |old(~myStatus~0)| 1073741637))) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)))) [2019-09-07 12:58:57,347 INFO L443 ceAbstractionStarter]: For program point L1150-1(lines 1150 1151) no Hoare annotation was computed. [2019-09-07 12:58:57,347 INFO L439 ceAbstractionStarter]: At program point L1051(lines 1050 1476) the Hoare annotation is: (or (and (= 0 ~pended~0) (= ~s~0 |old(~s~0)|) (or (<= 147480 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1) (not (= CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1 CdAudio435DeviceControl_~__cil_tmp42~0)))) (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (<= 0 (+ |old(~myStatus~0)| 1073741637))) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)))) [2019-09-07 12:58:57,347 INFO L443 ceAbstractionStarter]: For program point L1068(lines 1068 1472) no Hoare annotation was computed. [2019-09-07 12:58:57,347 INFO L439 ceAbstractionStarter]: At program point L1448(line 1448) the Hoare annotation is: (or (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (<= 0 (+ |old(~myStatus~0)| 1073741637))) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|))) (and (= ~s~0 ~NP~0) (= 0 ~pended~0) (or (<= 147480 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1) (not (= CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1 CdAudio435DeviceControl_~__cil_tmp42~0))))) [2019-09-07 12:58:57,348 INFO L443 ceAbstractionStarter]: For program point L1448-1(line 1448) no Hoare annotation was computed. [2019-09-07 12:58:57,348 INFO L443 ceAbstractionStarter]: For program point L1382(lines 1382 1396) no Hoare annotation was computed. [2019-09-07 12:58:57,348 INFO L443 ceAbstractionStarter]: For program point L1283(lines 1283 1285) no Hoare annotation was computed. [2019-09-07 12:58:57,348 INFO L443 ceAbstractionStarter]: For program point L1283-2(lines 1283 1285) no Hoare annotation was computed. [2019-09-07 12:58:57,348 INFO L443 ceAbstractionStarter]: For program point L1300(lines 1300 1312) no Hoare annotation was computed. [2019-09-07 12:58:57,348 INFO L439 ceAbstractionStarter]: At program point L1069(lines 1068 1472) the Hoare annotation is: (or (and (= 0 ~pended~0) (= ~s~0 |old(~s~0)|) (or (<= 147480 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1) (not (= CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1 CdAudio435DeviceControl_~__cil_tmp42~0)))) (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (<= 0 (+ |old(~myStatus~0)| 1073741637))) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)))) [2019-09-07 12:58:57,348 INFO L439 ceAbstractionStarter]: At program point L1317(line 1317) the Hoare annotation is: (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (<= 0 (+ |old(~myStatus~0)| 1073741637))) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|))) [2019-09-07 12:58:57,348 INFO L443 ceAbstractionStarter]: For program point L1317-1(line 1317) no Hoare annotation was computed. [2019-09-07 12:58:57,348 INFO L443 ceAbstractionStarter]: For program point L1086(lines 1086 1468) no Hoare annotation was computed. [2019-09-07 12:58:57,349 INFO L439 ceAbstractionStarter]: At program point L1400(lines 1400 1401) the Hoare annotation is: (or (and (= 0 ~pended~0) (= ~s~0 |old(~s~0)|) (or (<= 147480 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1) (not (= CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1 CdAudio435DeviceControl_~__cil_tmp42~0)))) (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (<= 0 (+ |old(~myStatus~0)| 1073741637))) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)))) [2019-09-07 12:58:57,349 INFO L443 ceAbstractionStarter]: For program point L1367(lines 1367 1381) no Hoare annotation was computed. [2019-09-07 12:58:57,349 INFO L443 ceAbstractionStarter]: For program point L1400-1(lines 1400 1401) no Hoare annotation was computed. [2019-09-07 12:58:57,349 INFO L439 ceAbstractionStarter]: At program point L1169(line 1169) the Hoare annotation is: (or (and (= ~s~0 ~NP~0) (= 0 ~pended~0) (<= (+ CdAudio435DeviceControl_~status~6 1073741670) 0)) (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (<= 0 (+ |old(~myStatus~0)| 1073741637))) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)))) [2019-09-07 12:58:57,349 INFO L443 ceAbstractionStarter]: For program point L1169-1(line 1169) no Hoare annotation was computed. [2019-09-07 12:58:57,349 INFO L439 ceAbstractionStarter]: At program point L1417(line 1417) the Hoare annotation is: (or (and (= 0 ~pended~0) (= ~s~0 |old(~s~0)|) (or (<= 147480 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1) (not (= CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1 CdAudio435DeviceControl_~__cil_tmp42~0)))) (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (<= 0 (+ |old(~myStatus~0)| 1073741637))) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)))) [2019-09-07 12:58:57,349 INFO L443 ceAbstractionStarter]: For program point L1417-1(line 1417) no Hoare annotation was computed. [2019-09-07 12:58:57,350 INFO L439 ceAbstractionStarter]: At program point L1252(line 1252) the Hoare annotation is: (or (and (= 0 ~pended~0) (= ~s~0 |old(~s~0)|) (or (<= 147480 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1) (not (= CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1 CdAudio435DeviceControl_~__cil_tmp42~0)))) (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (<= 0 (+ |old(~myStatus~0)| 1073741637))) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)))) [2019-09-07 12:58:57,350 INFO L443 ceAbstractionStarter]: For program point L1219(lines 1219 1221) no Hoare annotation was computed. [2019-09-07 12:58:57,350 INFO L443 ceAbstractionStarter]: For program point L1252-1(line 1252) no Hoare annotation was computed. [2019-09-07 12:58:57,350 INFO L443 ceAbstractionStarter]: For program point L1219-2(lines 1219 1221) no Hoare annotation was computed. [2019-09-07 12:58:57,350 INFO L439 ceAbstractionStarter]: At program point CdAudio435DeviceControlENTRY(lines 893 1498) the Hoare annotation is: (or (and (= 0 ~pended~0) (= ~s~0 |old(~s~0)|) (= ~myStatus~0 |old(~myStatus~0)|)) (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (<= 0 (+ |old(~myStatus~0)| 1073741637))) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)))) [2019-09-07 12:58:57,350 INFO L443 ceAbstractionStarter]: For program point L1269(lines 1269 1271) no Hoare annotation was computed. [2019-09-07 12:58:57,350 INFO L443 ceAbstractionStarter]: For program point L1269-2(lines 1269 1271) no Hoare annotation was computed. [2019-09-07 12:58:57,350 INFO L443 ceAbstractionStarter]: For program point L1137(lines 1137 1139) no Hoare annotation was computed. [2019-09-07 12:58:57,350 INFO L443 ceAbstractionStarter]: For program point L1104(lines 1104 1464) no Hoare annotation was computed. [2019-09-07 12:58:57,350 INFO L443 ceAbstractionStarter]: For program point L1137-2(lines 1137 1139) no Hoare annotation was computed. [2019-09-07 12:58:57,351 INFO L443 ceAbstractionStarter]: For program point L1154(lines 1154 1180) no Hoare annotation was computed. [2019-09-07 12:58:57,351 INFO L443 ceAbstractionStarter]: For program point L1154-1(lines 1117 1459) no Hoare annotation was computed. [2019-09-07 12:58:57,351 INFO L443 ceAbstractionStarter]: For program point L1303(lines 1303 1305) no Hoare annotation was computed. [2019-09-07 12:58:57,351 INFO L439 ceAbstractionStarter]: At program point L1237(line 1237) the Hoare annotation is: (or (and (= 0 ~pended~0) (= ~s~0 ~NP~0) (or (<= 147480 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1) (not (= CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1 CdAudio435DeviceControl_~__cil_tmp42~0))) (<= (+ CdAudio435DeviceControl_~status~6 1073741670) 0) (not (= CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1 CdAudio435DeviceControl_~__cil_tmp103~1)) (= ~myStatus~0 |old(~myStatus~0)|)) (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (<= 0 (+ |old(~myStatus~0)| 1073741637))) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)))) [2019-09-07 12:58:57,351 INFO L443 ceAbstractionStarter]: For program point L1303-2(lines 1303 1305) no Hoare annotation was computed. [2019-09-07 12:58:57,351 INFO L443 ceAbstractionStarter]: For program point L1237-1(line 1237) no Hoare annotation was computed. [2019-09-07 12:58:57,351 INFO L439 ceAbstractionStarter]: At program point L1105(lines 1086 1468) the Hoare annotation is: (or (and (= 0 ~pended~0) (= ~s~0 |old(~s~0)|)) (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (<= 0 (+ |old(~myStatus~0)| 1073741637))) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)))) [2019-09-07 12:58:57,351 INFO L443 ceAbstractionStarter]: For program point L1320(lines 1320 1332) no Hoare annotation was computed. [2019-09-07 12:58:57,352 INFO L443 ceAbstractionStarter]: For program point L1254(lines 1254 1261) no Hoare annotation was computed. [2019-09-07 12:58:57,352 INFO L443 ceAbstractionStarter]: For program point L1023(lines 1023 1482) no Hoare annotation was computed. [2019-09-07 12:58:57,352 INFO L443 ceAbstractionStarter]: For program point L1436(lines 1436 1438) no Hoare annotation was computed. [2019-09-07 12:58:57,352 INFO L443 ceAbstractionStarter]: For program point L1403(lines 1403 1410) no Hoare annotation was computed. [2019-09-07 12:58:57,352 INFO L443 ceAbstractionStarter]: For program point L1436-2(lines 1436 1438) no Hoare annotation was computed. [2019-09-07 12:58:57,352 INFO L443 ceAbstractionStarter]: For program point L1337(lines 1337 1350) no Hoare annotation was computed. [2019-09-07 12:58:57,352 INFO L439 ceAbstractionStarter]: At program point L1205(line 1205) the Hoare annotation is: (or (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (<= 0 (+ |old(~myStatus~0)| 1073741637))) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|))) (and (let ((.cse0 (= 0 ~pended~0)) (.cse1 (= ~s~0 |old(~s~0)|))) (or (and .cse0 .cse1 (<= 147480 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1)) (and .cse0 .cse1 (not (= CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1 CdAudio435DeviceControl_~__cil_tmp42~0))))) (= ~myStatus~0 |old(~myStatus~0)|))) [2019-09-07 12:58:57,352 INFO L443 ceAbstractionStarter]: For program point L1205-1(line 1205) no Hoare annotation was computed. [2019-09-07 12:58:57,352 INFO L443 ceAbstractionStarter]: For program point L1387(lines 1387 1389) no Hoare annotation was computed. [2019-09-07 12:58:57,353 INFO L439 ceAbstractionStarter]: At program point L1354(line 1354) the Hoare annotation is: (or (and (= 0 ~pended~0) (= ~s~0 |old(~s~0)|) (or (<= 147480 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1) (not (= CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1 CdAudio435DeviceControl_~__cil_tmp42~0)))) (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (<= 0 (+ |old(~myStatus~0)| 1073741637))) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)))) [2019-09-07 12:58:57,353 INFO L443 ceAbstractionStarter]: For program point L1354-1(line 1354) no Hoare annotation was computed. [2019-09-07 12:58:57,353 INFO L443 ceAbstractionStarter]: For program point L1387-2(lines 1387 1389) no Hoare annotation was computed. [2019-09-07 12:58:57,353 INFO L443 ceAbstractionStarter]: For program point L1404(lines 1404 1406) no Hoare annotation was computed. [2019-09-07 12:58:57,353 INFO L443 ceAbstractionStarter]: For program point L1404-2(lines 1404 1406) no Hoare annotation was computed. [2019-09-07 12:58:57,353 INFO L443 ceAbstractionStarter]: For program point L1239(lines 1239 1241) no Hoare annotation was computed. [2019-09-07 12:58:57,353 INFO L443 ceAbstractionStarter]: For program point L1041(lines 1041 1478) no Hoare annotation was computed. [2019-09-07 12:58:57,353 INFO L439 ceAbstractionStarter]: At program point L1289(line 1289) the Hoare annotation is: (or (and (= 0 ~pended~0) (= ~s~0 |old(~s~0)|) (= 0 CdAudio435DeviceControl_~status~6)) (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (<= 0 (+ |old(~myStatus~0)| 1073741637))) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)))) [2019-09-07 12:58:57,353 INFO L443 ceAbstractionStarter]: For program point L1289-1(line 1289) no Hoare annotation was computed. [2019-09-07 12:58:57,354 INFO L443 ceAbstractionStarter]: For program point L1190(lines 1190 1194) no Hoare annotation was computed. [2019-09-07 12:58:57,354 INFO L443 ceAbstractionStarter]: For program point L1157(lines 1157 1176) no Hoare annotation was computed. [2019-09-07 12:58:57,354 INFO L443 ceAbstractionStarter]: For program point L1190-2(lines 1117 1459) no Hoare annotation was computed. [2019-09-07 12:58:57,354 INFO L443 ceAbstractionStarter]: For program point L1372(lines 1372 1374) no Hoare annotation was computed. [2019-09-07 12:58:57,354 INFO L443 ceAbstractionStarter]: For program point L1372-2(lines 1372 1374) no Hoare annotation was computed. [2019-09-07 12:58:57,354 INFO L443 ceAbstractionStarter]: For program point L1207(lines 1207 1209) no Hoare annotation was computed. [2019-09-07 12:58:57,354 INFO L443 ceAbstractionStarter]: For program point L1207-2(lines 1207 1209) no Hoare annotation was computed. [2019-09-07 12:58:57,354 INFO L439 ceAbstractionStarter]: At program point L1042(lines 1041 1478) the Hoare annotation is: (or (and (= 0 ~pended~0) (= ~s~0 |old(~s~0)|) (or (<= 147480 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1) (not (= CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1 CdAudio435DeviceControl_~__cil_tmp42~0)))) (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (<= 0 (+ |old(~myStatus~0)| 1073741637))) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)))) [2019-09-07 12:58:57,355 INFO L443 ceAbstractionStarter]: For program point L1488(lines 1488 1490) no Hoare annotation was computed. [2019-09-07 12:58:57,355 INFO L443 ceAbstractionStarter]: For program point L1455(line 1455) no Hoare annotation was computed. [2019-09-07 12:58:57,355 INFO L443 ceAbstractionStarter]: For program point L1488-2(lines 1488 1490) no Hoare annotation was computed. [2019-09-07 12:58:57,355 INFO L443 ceAbstractionStarter]: For program point L1356(lines 1356 1359) no Hoare annotation was computed. [2019-09-07 12:58:57,355 INFO L443 ceAbstractionStarter]: For program point L1323(lines 1323 1325) no Hoare annotation was computed. [2019-09-07 12:58:57,355 INFO L443 ceAbstractionStarter]: For program point L1257(lines 1257 1259) no Hoare annotation was computed. [2019-09-07 12:58:57,355 INFO L443 ceAbstractionStarter]: For program point L1323-2(lines 1323 1325) no Hoare annotation was computed. [2019-09-07 12:58:57,355 INFO L439 ceAbstractionStarter]: At program point L1125(line 1125) the Hoare annotation is: (or (and (= 0 ~pended~0) (= ~s~0 |old(~s~0)|)) (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (<= 0 (+ |old(~myStatus~0)| 1073741637))) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)))) [2019-09-07 12:58:57,355 INFO L443 ceAbstractionStarter]: For program point L1125-1(line 1125) no Hoare annotation was computed. [2019-09-07 12:58:57,356 INFO L443 ceAbstractionStarter]: For program point L1059(lines 1059 1474) no Hoare annotation was computed. [2019-09-07 12:58:57,356 INFO L446 ceAbstractionStarter]: At program point CdAudioUnloadENTRY(lines 1673 1679) the Hoare annotation is: true [2019-09-07 12:58:57,356 INFO L443 ceAbstractionStarter]: For program point CdAudioUnloadEXIT(lines 1673 1679) no Hoare annotation was computed. [2019-09-07 12:58:57,356 INFO L443 ceAbstractionStarter]: For program point CdAudioUnloadFINAL(lines 1673 1679) no Hoare annotation was computed. [2019-09-07 12:58:57,356 INFO L443 ceAbstractionStarter]: For program point L1666-1(line 1666) no Hoare annotation was computed. [2019-09-07 12:58:57,356 INFO L443 ceAbstractionStarter]: For program point L1664(lines 1664 1669) no Hoare annotation was computed. [2019-09-07 12:58:57,356 INFO L443 ceAbstractionStarter]: For program point L1664-2(lines 1664 1669) no Hoare annotation was computed. [2019-09-07 12:58:57,356 INFO L439 ceAbstractionStarter]: At program point L1652(line 1652) the Hoare annotation is: (let ((.cse1 (+ ~myStatus~0 1073741637))) (let ((.cse0 (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (= 0 |old(~routine~0)|)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (<= 0 .cse1)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (or (not (= |old(~s~0)| ~NP~0)) (not (= |old(~compRegistered~0)| 0)))))) (and (or .cse0 (not (<= 0 ~myStatus~0)) (not (= |old(~customIrp~0)| 0))) (or (not (<= .cse1 0)) .cse0)))) [2019-09-07 12:58:57,356 INFO L443 ceAbstractionStarter]: For program point L1650(lines 1650 1657) no Hoare annotation was computed. [2019-09-07 12:58:57,356 INFO L443 ceAbstractionStarter]: For program point L1650-1(lines 1645 1658) no Hoare annotation was computed. [2019-09-07 12:58:57,357 INFO L443 ceAbstractionStarter]: For program point CdAudioForwardIrpSynchronousEXIT(lines 1638 1672) no Hoare annotation was computed. [2019-09-07 12:58:57,357 INFO L439 ceAbstractionStarter]: At program point L1661(line 1661) the Hoare annotation is: (let ((.cse5 (+ ~myStatus~0 1073741637))) (let ((.cse0 (not (<= .cse5 0))) (.cse1 (and (= 0 ~pended~0) (= ~s~0 |old(~s~0)|) (<= 1 ~compRegistered~0) (= ~routine~0 1))) (.cse4 (= |old(~customIrp~0)| ~customIrp~0)) (.cse2 (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (= 0 |old(~routine~0)|)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (<= 0 .cse5)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (or (not (= |old(~s~0)| ~NP~0)) (not (= |old(~compRegistered~0)| 0))))) (.cse3 (not (= |old(~customIrp~0)| 0)))) (and (or .cse0 .cse1 .cse2) (or (or .cse0 .cse2 .cse3) .cse4) (or (and .cse1 .cse4) .cse2 (not (<= 0 ~myStatus~0)) .cse3)))) [2019-09-07 12:58:57,357 INFO L443 ceAbstractionStarter]: For program point L1661-1(line 1661) no Hoare annotation was computed. [2019-09-07 12:58:57,357 INFO L439 ceAbstractionStarter]: At program point CdAudioForwardIrpSynchronousENTRY(lines 1638 1672) the Hoare annotation is: (let ((.cse11 (+ ~myStatus~0 1073741637))) (let ((.cse5 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse9 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse7 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse6 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse8 (<= 0 .cse11)) (.cse10 (<= (+ ~DC~0 2) ~SKIP2~0))) (let ((.cse3 (= |old(~customIrp~0)| ~customIrp~0)) (.cse2 (not (= |old(~customIrp~0)| 0))) (.cse0 (not (<= .cse11 0))) (.cse1 (or (not .cse5) (not .cse9) (not (= 0 |old(~routine~0)|)) (not .cse7) (not .cse6) (not .cse8) (not (= 0 |old(~pended~0)|)) (not .cse10) (or (not (= |old(~s~0)| ~NP~0)) (not (= |old(~compRegistered~0)| 0))))) (.cse4 (and .cse5 (= ~s~0 ~NP~0) (= 0 ~pended~0) (= 0 ~compRegistered~0) .cse6 .cse7 (= 0 ~routine~0) .cse8 .cse9 .cse10))) (and (or (or .cse0 .cse1 .cse2) .cse3) (or .cse1 (and .cse4 .cse3) (not (<= 0 ~myStatus~0)) .cse2) (or .cse0 .cse1 .cse4))))) [2019-09-07 12:58:57,357 INFO L439 ceAbstractionStarter]: At program point L1647(line 1647) the Hoare annotation is: (let ((.cse1 (+ ~myStatus~0 1073741637))) (let ((.cse0 (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (= 0 |old(~routine~0)|)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (<= 0 .cse1)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (or (not (= |old(~s~0)| ~NP~0)) (not (= |old(~compRegistered~0)| 0)))))) (and (or .cse0 (not (<= 0 ~myStatus~0)) (not (= |old(~customIrp~0)| 0))) (or (not (<= .cse1 0)) .cse0)))) [2019-09-07 12:58:57,358 INFO L443 ceAbstractionStarter]: For program point L1645(lines 1645 1658) no Hoare annotation was computed. [2019-09-07 12:58:57,358 INFO L443 ceAbstractionStarter]: For program point CdAudioForwardIrpSynchronousFINAL(lines 1638 1672) no Hoare annotation was computed. [2019-09-07 12:58:57,358 INFO L439 ceAbstractionStarter]: At program point L1666(line 1666) the Hoare annotation is: (let ((.cse18 (+ ~myStatus~0 1073741637))) (let ((.cse7 (<= 259 CdAudioForwardIrpSynchronous_~status~8)) (.cse8 (= 0 ~pended~0)) (.cse11 (<= 1 ~compRegistered~0)) (.cse15 (= ~NP~0 |old(~s~0)|)) (.cse16 (= ~routine~0 1)) (.cse17 (= ~setEventCalled~0 1)) (.cse6 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse13 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse10 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse9 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse12 (<= 0 .cse18)) (.cse14 (<= (+ ~DC~0 2) ~SKIP2~0))) (let ((.cse1 (not (<= 0 ~myStatus~0))) (.cse2 (not (= |old(~customIrp~0)| 0))) (.cse3 (not (<= .cse18 0))) (.cse0 (or (not .cse6) (not .cse13) (not (= 0 |old(~routine~0)|)) (not .cse10) (not .cse9) (not .cse12) (not (= 0 |old(~pended~0)|)) (not .cse14) (or (not (= |old(~s~0)| ~NP~0)) (not (= |old(~compRegistered~0)| 0))))) (.cse5 (and .cse7 .cse8 .cse9 .cse10 (= ~s~0 |old(~s~0)|) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (<= (+ ~s~0 2) ~SKIP1~0) .cse17)) (.cse4 (and (and .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (= ~MPR3~0 ~s~0)))) (and (or (= |old(~customIrp~0)| ~customIrp~0) (and (or .cse0 .cse1 .cse2) (or .cse3 .cse0 .cse2))) (or .cse4 .cse0 .cse1 .cse2 .cse5) (or .cse3 .cse0 .cse5 .cse4))))) [2019-09-07 12:58:57,358 INFO L446 ceAbstractionStarter]: At program point ZwCloseENTRY(lines 2127 2147) the Hoare annotation is: true [2019-09-07 12:58:57,358 INFO L446 ceAbstractionStarter]: At program point L2136(lines 2135 2145) the Hoare annotation is: true [2019-09-07 12:58:57,358 INFO L446 ceAbstractionStarter]: At program point L2134(lines 2133 2145) the Hoare annotation is: true [2019-09-07 12:58:57,358 INFO L443 ceAbstractionStarter]: For program point ZwCloseFINAL(lines 2127 2147) no Hoare annotation was computed. [2019-09-07 12:58:57,358 INFO L443 ceAbstractionStarter]: For program point L2133(lines 2133 2145) no Hoare annotation was computed. [2019-09-07 12:58:57,358 INFO L443 ceAbstractionStarter]: For program point ZwCloseEXIT(lines 2127 2147) no Hoare annotation was computed. [2019-09-07 12:58:57,456 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.09 12:58:57 BoogieIcfgContainer [2019-09-07 12:58:57,456 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-07 12:58:57,457 INFO L168 Benchmark]: Toolchain (without parser) took 85530.32 ms. Allocated memory was 142.1 MB in the beginning and 975.2 MB in the end (delta: 833.1 MB). Free memory was 87.8 MB in the beginning and 439.5 MB in the end (delta: -351.7 MB). Peak memory consumption was 831.3 MB. Max. memory is 7.1 GB. [2019-09-07 12:58:57,458 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 142.1 MB. Free memory is still 107.8 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-09-07 12:58:57,458 INFO L168 Benchmark]: CACSL2BoogieTranslator took 870.46 ms. Allocated memory was 142.1 MB in the beginning and 202.4 MB in the end (delta: 60.3 MB). Free memory was 87.4 MB in the beginning and 156.2 MB in the end (delta: -68.8 MB). Peak memory consumption was 26.2 MB. Max. memory is 7.1 GB. [2019-09-07 12:58:57,458 INFO L168 Benchmark]: Boogie Preprocessor took 144.60 ms. Allocated memory is still 202.4 MB. Free memory was 156.2 MB in the beginning and 150.9 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 7.1 GB. [2019-09-07 12:58:57,459 INFO L168 Benchmark]: RCFGBuilder took 1593.44 ms. Allocated memory was 202.4 MB in the beginning and 231.2 MB in the end (delta: 28.8 MB). Free memory was 150.9 MB in the beginning and 124.5 MB in the end (delta: 26.3 MB). Peak memory consumption was 76.1 MB. Max. memory is 7.1 GB. [2019-09-07 12:58:57,459 INFO L168 Benchmark]: TraceAbstraction took 82914.14 ms. Allocated memory was 231.2 MB in the beginning and 975.2 MB in the end (delta: 744.0 MB). Free memory was 124.5 MB in the beginning and 439.5 MB in the end (delta: -315.0 MB). Peak memory consumption was 778.9 MB. Max. memory is 7.1 GB. [2019-09-07 12:58:57,461 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 142.1 MB. Free memory is still 107.8 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 870.46 ms. Allocated memory was 142.1 MB in the beginning and 202.4 MB in the end (delta: 60.3 MB). Free memory was 87.4 MB in the beginning and 156.2 MB in the end (delta: -68.8 MB). Peak memory consumption was 26.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 144.60 ms. Allocated memory is still 202.4 MB. Free memory was 156.2 MB in the beginning and 150.9 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1593.44 ms. Allocated memory was 202.4 MB in the beginning and 231.2 MB in the end (delta: 28.8 MB). Free memory was 150.9 MB in the beginning and 124.5 MB in the end (delta: 26.3 MB). Peak memory consumption was 76.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 82914.14 ms. Allocated memory was 231.2 MB in the beginning and 975.2 MB in the end (delta: 744.0 MB). Free memory was 124.5 MB in the beginning and 439.5 MB in the end (delta: -315.0 MB). Peak memory consumption was 778.9 MB. Max. memory is 7.1 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: ((((((((((((((((((((s == IPC && status == lowerDriverReturn) && status == 0) && 0 == pended && NP + 5 <= MPR3) || !(\old(myStatus) == 0)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(DC))) || !(0 == \old(routine))) || !(\old(compRegistered) == 0)) || (((((s == IPC && status == lowerDriverReturn) && DC + 5 <= IPC) && SKIP2 + 3 <= IPC) && 0 == pended && NP + 5 <= MPR3) && SKIP1 + 2 <= MPR1)) || (((status == lowerDriverReturn && s == SKIP2) && status == 0) && 0 == pended && NP + 5 <= MPR3)) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || (((((status == lowerDriverReturn && s == SKIP2) && SKIP2 + 3 <= IPC) && DC + 2 <= SKIP2) && 0 == pended && NP + 5 <= MPR3) && SKIP1 + 2 <= MPR1)) || !(\old(s) == \old(NP))) || !(0 == \old(pended))) || ((((((((s == IPC && NP + 2 <= SKIP1) && status == lowerDriverReturn) && NP + 5 <= MPR3) && SKIP2 + 3 <= IPC) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && 0 == routine) && 1 <= compRegistered)) || !(\old(s) == \old(MPR3))) || ((((((NP + 2 <= SKIP1 && SKIP2 + 3 <= IPC) && DC + 2 <= SKIP2) && 0 == pended && NP + 5 <= MPR3) && SKIP1 + 2 <= MPR1) && s == DC) && !(status == 259))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0) - InvariantResult [Line: 569]: Loop Invariant Derived loop invariant: (0 == pended && s == \old(s)) || ((((((((!(NP + 2 <= SKIP1) || !(NP + 5 <= MPR3)) || !(DC + 2 <= SKIP2)) || !(0 == routine)) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(0 <= \old(myStatus) + 1073741637)) || !(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(DC))) || !(0 == \old(routine))) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || !(\old(s) == \old(NP))) || !(0 == \old(pended))) || (((((((0 == pended && NP + 5 <= MPR3) && s == NP) && 0 == compRegistered) && SKIP2 + 3 <= IPC) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && 0 == routine)) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0) - InvariantResult [Line: 636]: Loop Invariant Derived loop invariant: ((s == NP && 0 == pended) && status + 1073741670 <= 0) || ((((((((!(NP + 2 <= SKIP1) || !(NP + 5 <= MPR3)) || !(DC + 2 <= SKIP2)) || !(0 == routine)) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(0 <= \old(myStatus) + 1073741637)) || !(compRegistered == 0)) || !(0 == \old(pended)) - InvariantResult [Line: 1059]: Loop Invariant Derived loop invariant: ((0 == pended && s == \old(s)) && (147480 <= currentIrpStack__Parameters__DeviceIoControl__IoControlCode || !(currentIrpStack__Parameters__DeviceIoControl__IoControlCode == __cil_tmp42))) || ((((((((!(NP + 2 <= SKIP1) || !(NP + 5 <= MPR3)) || !(DC + 2 <= SKIP2)) || !(0 == routine)) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(0 <= \old(myStatus) + 1073741637)) || !(compRegistered == 0)) || !(0 == \old(pended)) - InvariantResult [Line: 2074]: Loop Invariant Derived loop invariant: (((((((!(NP + 5 <= MPR3) || !(0 == routine)) || (0 == pended && SKIP1 == s)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || !(0 == \old(pended))) || !(DC + 2 <= SKIP2) - InvariantResult [Line: 1077]: Loop Invariant Derived loop invariant: ((0 == pended && s == \old(s)) && (147480 <= currentIrpStack__Parameters__DeviceIoControl__IoControlCode || !(currentIrpStack__Parameters__DeviceIoControl__IoControlCode == __cil_tmp42))) || ((((((((!(NP + 2 <= SKIP1) || !(NP + 5 <= MPR3)) || !(DC + 2 <= SKIP2)) || !(0 == routine)) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(0 <= \old(myStatus) + 1073741637)) || !(compRegistered == 0)) || !(0 == \old(pended)) - InvariantResult [Line: 1824]: Loop Invariant Derived loop invariant: ((((((((((((((((((!(\old(myStatus) == 0) || s == UNLOADED) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || (((((s == IPC && status == lowerDriverReturn) && DC + 5 <= IPC) && SKIP2 + 3 <= IPC) && SKIP1 + 2 <= MPR1) && NP + 5 <= MPR3 && 0 == pended)) || (((((status == lowerDriverReturn && s == SKIP2) && SKIP2 + 3 <= IPC) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && NP + 5 <= MPR3 && 0 == pended)) || !(\old(s) == \old(DC))) || !(0 == \old(routine))) || !(\old(compRegistered) == 0)) || (((status == lowerDriverReturn && s == SKIP2) && status == 0) && NP + 5 <= MPR3 && 0 == pended)) || ((((((((s == IPC && NP + 2 <= SKIP1) && status == lowerDriverReturn) && NP + 5 <= MPR3) && SKIP2 + 3 <= IPC) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && 0 == routine) && 1 <= compRegistered)) || (((s == IPC && status == lowerDriverReturn) && status == 0) && NP + 5 <= MPR3 && 0 == pended)) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || !(\old(s) == \old(NP))) || !(0 == \old(pended))) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || ((((((NP + 2 <= SKIP1 && SKIP2 + 3 <= IPC) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && s == DC) && NP + 5 <= MPR3 && 0 == pended) && !(status == 259))) || !(\old(customIrp) == 0) - InvariantResult [Line: 1934]: Loop Invariant Derived loop invariant: ((((((((((((!(NP + 2 <= SKIP1) || !(NP + 5 <= MPR3)) || !(DC + 2 <= SKIP2)) || (0 == pended && SKIP1 == s)) || !(\old(s) <= SKIP1)) || !(0 == routine)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(SKIP1 <= \old(s))) || !(compRegistered == 0)) || !(0 == \old(pended))) && (((((((s == MPR1 && compRetStatus + 1073741802 <= 0) && 0 == pended) && 0 <= compRetStatus + 1073741802) && __cil_tmp8 + 1073741802 <= 0) && setEventCalled == 1) && 0 <= __cil_tmp8 + 1073741802) || (((!(myStatus + 1073741637 <= 0) || ((((((((!(NP + 5 <= MPR3) || !(\old(s) + 2 <= SKIP1)) || !(DC + 2 <= SKIP2)) || !(1 == routine)) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(0 <= myStatus + 1073741637)) || !(0 == \old(pended))) || !(1 <= compRegistered)) || !(customIrp == 0)) && (((((((((((!(NP + 5 <= MPR3) || !(\old(s) + 2 <= SKIP1)) || !(DC + 2 <= SKIP2)) || !(1 == routine)) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(0 <= myStatus + 1073741637)) || !(0 == \old(pended))) || !(1 <= compRegistered)) || !(0 <= myStatus)) || !(customIrp == 0))))) && ((((((((((!(NP + 5 <= MPR3) || !(myStatus == 0)) || !(\old(s) + 2 <= SKIP1)) || !(DC + 2 <= SKIP2)) || !(0 == routine)) || ((((NP + 5 <= MPR3 && DC + 2 <= SKIP2) && s == \old(s)) && 0 == routine) && s + 2 <= SKIP1)) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(0 == \old(pended))) || !(1 <= compRegistered))) && (((((((((((!(NP + 5 <= MPR3) || !(\old(s) + 2 <= SKIP1)) || !(DC + 2 <= SKIP2)) || !(myStatus + 1 <= 0)) || ((((NP + 5 <= MPR3 && DC + 2 <= SKIP2) && s == \old(s)) && 0 == routine) && s + 2 <= SKIP1)) || !(0 == routine)) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(0 <= myStatus + 1073741637)) || !(0 == \old(pended))) || !(1 <= compRegistered)) - InvariantResult [Line: 634]: Loop Invariant Derived loop invariant: (((((((((!(NP + 2 <= SKIP1) || !(NP + 5 <= MPR3)) || !(DC + 2 <= SKIP2)) || !(0 == routine)) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(0 <= \old(myStatus) + 1073741637)) || !(compRegistered == 0)) || !(0 == \old(pended))) || (s == NP && 0 == pended) - InvariantResult [Line: 2029]: Loop Invariant Derived loop invariant: (((((s == NP || ((((((!(NP + 2 <= SKIP1) || (!(NP + 5 <= MPR3) || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(0 <= myStatus + 1073741637)) || !(0 == pended)) || !(DC + 2 <= SKIP2)) && ((((!(\old(s) == MPR3) || (((!(\old(setEventCalled) == 1) || !(NP + 2 <= SKIP1)) || !(0 <= myStatus + 1073741637)) || !(DC + 2 <= SKIP2)) || (!(SKIP1 + 2 <= MPR1) || !(SKIP2 + 3 <= IPC)) || ((!(NP + 5 <= MPR3) || !(0 == pended)) || !(1 <= compRegistered)) || !(1 == routine)) || !(\old(customIrp) == 0)) || !(myStatus + 1073741637 <= 0)) || ((((((((((NP + 2 <= SKIP1 && 0 == pended) && s == NP) && SKIP2 + 3 <= IPC) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && 0 <= myStatus + 1073741637) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && routine == 1) && \old(customIrp) == customIrp))) && ((\old(customIrp) == customIrp || !(myStatus == 0)) || (((!(0 <= myStatus) || ((((((!(NP + 2 <= SKIP1) || (!(NP + 5 <= MPR3) || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(0 <= myStatus + 1073741637)) || !(0 == pended)) || !(DC + 2 <= SKIP2)) || !(\old(customIrp) == 0)) && ((!(myStatus + 1073741637 <= 0) || ((((((!(NP + 2 <= SKIP1) || (!(NP + 5 <= MPR3) || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(0 <= myStatus + 1073741637)) || !(0 == pended)) || !(DC + 2 <= SKIP2)) || !(\old(customIrp) == 0))))) && (((s == \old(s) && setEventCalled == 1) && \old(customIrp) == customIrp) || (((!(myStatus + 1073741637 <= 0) || (((((((((!(\old(setEventCalled) == 1) || !(\old(s) + 2 <= SKIP1)) || !(NP + 5 <= MPR3)) || !(DC + 2 <= SKIP2)) || !(1 == routine)) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(0 <= myStatus + 1073741637)) || !(0 == pended)) || !(1 <= compRegistered)) || !(\old(customIrp) == 0)) && ((((((((((((!(\old(setEventCalled) == 1) || !(\old(s) + 2 <= SKIP1)) || !(NP + 5 <= MPR3)) || !(DC + 2 <= SKIP2)) || !(1 == routine)) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(0 <= myStatus + 1073741637)) || !(0 == pended)) || !(1 <= compRegistered)) || !(0 <= myStatus)) || !(\old(customIrp) == 0))))) && ((!(myStatus + 1073741637 <= 0) || \old(customIrp) == customIrp) || (((!(0 <= myStatus) || ((((((!(NP + 2 <= SKIP1) || (!(NP + 5 <= MPR3) || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(0 <= myStatus + 1073741637)) || !(0 == pended)) || !(DC + 2 <= SKIP2)) || !(\old(customIrp) == 0)) && ((!(myStatus + 1073741637 <= 0) || ((((((!(NP + 2 <= SKIP1) || (!(NP + 5 <= MPR3) || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(0 <= myStatus + 1073741637)) || !(0 == pended)) || !(DC + 2 <= SKIP2)) || !(\old(customIrp) == 0))))) && ((((((((((((((NP + 2 <= SKIP1 && 0 == pended) && s == NP) && SKIP2 + 3 <= IPC) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && 0 <= myStatus + 1073741637) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && routine == 1) && \old(customIrp) == customIrp) || !(\old(s) == MPR3)) || (((!(\old(setEventCalled) == 1) || !(NP + 2 <= SKIP1)) || !(0 <= myStatus + 1073741637)) || !(DC + 2 <= SKIP2)) || (!(SKIP1 + 2 <= MPR1) || !(SKIP2 + 3 <= IPC)) || ((!(NP + 5 <= MPR3) || !(0 == pended)) || !(1 <= compRegistered)) || !(1 == routine)) || !(0 <= myStatus)) || !(\old(customIrp) == 0)) - InvariantResult [Line: 1927]: Loop Invariant Derived loop invariant: ((((((((((((!(NP + 2 <= SKIP1) || !(NP + 5 <= MPR3)) || !(DC + 2 <= SKIP2)) || (0 == pended && SKIP1 == s)) || !(\old(s) <= SKIP1)) || !(0 == routine)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(SKIP1 <= \old(s))) || !(compRegistered == 0)) || !(0 == \old(pended))) && (((((((s == MPR1 && compRetStatus + 1073741802 <= 0) && 0 == pended) && 0 <= compRetStatus + 1073741802) && __cil_tmp8 + 1073741802 <= 0) && setEventCalled == 1) && 0 <= __cil_tmp8 + 1073741802) || (((!(myStatus + 1073741637 <= 0) || ((((((((!(NP + 5 <= MPR3) || !(\old(s) + 2 <= SKIP1)) || !(DC + 2 <= SKIP2)) || !(1 == routine)) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(0 <= myStatus + 1073741637)) || !(0 == \old(pended))) || !(1 <= compRegistered)) || !(customIrp == 0)) && (((((((((((!(NP + 5 <= MPR3) || !(\old(s) + 2 <= SKIP1)) || !(DC + 2 <= SKIP2)) || !(1 == routine)) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(0 <= myStatus + 1073741637)) || !(0 == \old(pended))) || !(1 <= compRegistered)) || !(0 <= myStatus)) || !(customIrp == 0))))) && ((((((((((!(NP + 5 <= MPR3) || !(myStatus == 0)) || !(\old(s) + 2 <= SKIP1)) || !(DC + 2 <= SKIP2)) || !(0 == routine)) || ((((NP + 5 <= MPR3 && DC + 2 <= SKIP2) && s == \old(s)) && 0 == routine) && s + 2 <= SKIP1)) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(0 == \old(pended))) || !(1 <= compRegistered))) && (((((((((((!(NP + 5 <= MPR3) || !(\old(s) + 2 <= SKIP1)) || !(DC + 2 <= SKIP2)) || !(myStatus + 1 <= 0)) || ((((NP + 5 <= MPR3 && DC + 2 <= SKIP2) && s == \old(s)) && 0 == routine) && s + 2 <= SKIP1)) || !(0 == routine)) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(0 <= myStatus + 1073741637)) || !(0 == \old(pended))) || !(1 <= compRegistered)) - InvariantResult [Line: 587]: Loop Invariant Derived loop invariant: (0 == pended && s == \old(s)) || ((((((((!(NP + 2 <= SKIP1) || !(NP + 5 <= MPR3)) || !(DC + 2 <= SKIP2)) || !(0 == routine)) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(0 <= \old(myStatus) + 1073741637)) || !(compRegistered == 0)) || !(0 == \old(pended)) - InvariantResult [Line: 2081]: Loop Invariant Derived loop invariant: (((((((!(NP + 5 <= MPR3) || !(0 == routine)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || !(0 == \old(pended))) || (0 == pended && SKIP1 == s)) || !(DC + 2 <= SKIP2) - InvariantResult [Line: 1041]: Loop Invariant Derived loop invariant: ((0 == pended && s == \old(s)) && (147480 <= currentIrpStack__Parameters__DeviceIoControl__IoControlCode || !(currentIrpStack__Parameters__DeviceIoControl__IoControlCode == __cil_tmp42))) || ((((((((!(NP + 2 <= SKIP1) || !(NP + 5 <= MPR3)) || !(DC + 2 <= SKIP2)) || !(0 == routine)) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(0 <= \old(myStatus) + 1073741637)) || !(compRegistered == 0)) || !(0 == \old(pended)) - InvariantResult [Line: 161]: Loop Invariant Derived loop invariant: (!(myStatus + 1073741637 <= 0) || ((((((((!(NP + 2 <= SKIP1) || !(NP + 5 <= MPR3)) || !(DC + 2 <= SKIP2)) || !(0 == \old(routine))) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(0 <= myStatus + 1073741637)) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) && ((((((((((((!(NP + 2 <= SKIP1) || !(NP + 5 <= MPR3)) || !(DC + 2 <= SKIP2)) || !(0 == \old(routine))) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(0 <= myStatus + 1073741637)) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || ((((0 == pended && s == NP) && 1 <= compRegistered) && routine == 1) && \old(customIrp) == customIrp)) || !(0 <= myStatus)) || !(\old(customIrp) == 0)) - InvariantResult [Line: 605]: Loop Invariant Derived loop invariant: (0 == pended && s == \old(s)) || ((((((((!(NP + 2 <= SKIP1) || !(NP + 5 <= MPR3)) || !(DC + 2 <= SKIP2)) || !(0 == routine)) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(0 <= \old(myStatus) + 1073741637)) || !(compRegistered == 0)) || !(0 == \old(pended)) - InvariantResult [Line: 1900]: Loop Invariant Derived loop invariant: ((((((((((((!(NP + 2 <= SKIP1) || !(NP + 5 <= MPR3)) || !(DC + 2 <= SKIP2)) || (0 == pended && SKIP1 == s)) || !(\old(s) <= SKIP1)) || !(0 == routine)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(SKIP1 <= \old(s))) || !(compRegistered == 0)) || !(0 == \old(pended))) && (((((((s == MPR1 && compRetStatus + 1073741802 <= 0) && 0 == pended) && 0 <= compRetStatus + 1073741802) && __cil_tmp8 + 1073741802 <= 0) && setEventCalled == 1) && 0 <= __cil_tmp8 + 1073741802) || (((!(myStatus + 1073741637 <= 0) || ((((((((!(NP + 5 <= MPR3) || !(\old(s) + 2 <= SKIP1)) || !(DC + 2 <= SKIP2)) || !(1 == routine)) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(0 <= myStatus + 1073741637)) || !(0 == \old(pended))) || !(1 <= compRegistered)) || !(customIrp == 0)) && (((((((((((!(NP + 5 <= MPR3) || !(\old(s) + 2 <= SKIP1)) || !(DC + 2 <= SKIP2)) || !(1 == routine)) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(0 <= myStatus + 1073741637)) || !(0 == \old(pended))) || !(1 <= compRegistered)) || !(0 <= myStatus)) || !(customIrp == 0))))) && ((((((((((!(NP + 5 <= MPR3) || !(myStatus == 0)) || !(\old(s) + 2 <= SKIP1)) || !(DC + 2 <= SKIP2)) || !(0 == routine)) || ((((NP + 5 <= MPR3 && DC + 2 <= SKIP2) && s == \old(s)) && 0 == routine) && s + 2 <= SKIP1)) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(0 == \old(pended))) || !(1 <= compRegistered))) && (((((((((((!(NP + 5 <= MPR3) || !(\old(s) + 2 <= SKIP1)) || !(DC + 2 <= SKIP2)) || !(myStatus + 1 <= 0)) || ((((NP + 5 <= MPR3 && DC + 2 <= SKIP2) && s == \old(s)) && 0 == routine) && s + 2 <= SKIP1)) || !(0 == routine)) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(0 <= myStatus + 1073741637)) || !(0 == \old(pended))) || !(1 <= compRegistered)) - InvariantResult [Line: 2027]: Loop Invariant Derived loop invariant: (((((s == NP || ((((((!(NP + 2 <= SKIP1) || (!(NP + 5 <= MPR3) || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(0 <= myStatus + 1073741637)) || !(0 == pended)) || !(DC + 2 <= SKIP2)) && ((((!(\old(s) == MPR3) || (((!(\old(setEventCalled) == 1) || !(NP + 2 <= SKIP1)) || !(0 <= myStatus + 1073741637)) || !(DC + 2 <= SKIP2)) || (!(SKIP1 + 2 <= MPR1) || !(SKIP2 + 3 <= IPC)) || ((!(NP + 5 <= MPR3) || !(0 == pended)) || !(1 <= compRegistered)) || !(1 == routine)) || !(\old(customIrp) == 0)) || !(myStatus + 1073741637 <= 0)) || ((((((((((NP + 2 <= SKIP1 && 0 == pended) && s == NP) && SKIP2 + 3 <= IPC) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && 0 <= myStatus + 1073741637) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && routine == 1) && \old(customIrp) == customIrp))) && ((\old(customIrp) == customIrp || !(myStatus == 0)) || (((!(0 <= myStatus) || ((((((!(NP + 2 <= SKIP1) || (!(NP + 5 <= MPR3) || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(0 <= myStatus + 1073741637)) || !(0 == pended)) || !(DC + 2 <= SKIP2)) || !(\old(customIrp) == 0)) && ((!(myStatus + 1073741637 <= 0) || ((((((!(NP + 2 <= SKIP1) || (!(NP + 5 <= MPR3) || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(0 <= myStatus + 1073741637)) || !(0 == pended)) || !(DC + 2 <= SKIP2)) || !(\old(customIrp) == 0))))) && (((s == \old(s) && setEventCalled == 1) && \old(customIrp) == customIrp) || (((!(myStatus + 1073741637 <= 0) || (((((((((!(\old(setEventCalled) == 1) || !(\old(s) + 2 <= SKIP1)) || !(NP + 5 <= MPR3)) || !(DC + 2 <= SKIP2)) || !(1 == routine)) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(0 <= myStatus + 1073741637)) || !(0 == pended)) || !(1 <= compRegistered)) || !(\old(customIrp) == 0)) && ((((((((((((!(\old(setEventCalled) == 1) || !(\old(s) + 2 <= SKIP1)) || !(NP + 5 <= MPR3)) || !(DC + 2 <= SKIP2)) || !(1 == routine)) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(0 <= myStatus + 1073741637)) || !(0 == pended)) || !(1 <= compRegistered)) || !(0 <= myStatus)) || !(\old(customIrp) == 0))))) && ((!(myStatus + 1073741637 <= 0) || \old(customIrp) == customIrp) || (((!(0 <= myStatus) || ((((((!(NP + 2 <= SKIP1) || (!(NP + 5 <= MPR3) || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(0 <= myStatus + 1073741637)) || !(0 == pended)) || !(DC + 2 <= SKIP2)) || !(\old(customIrp) == 0)) && ((!(myStatus + 1073741637 <= 0) || ((((((!(NP + 2 <= SKIP1) || (!(NP + 5 <= MPR3) || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(0 <= myStatus + 1073741637)) || !(0 == pended)) || !(DC + 2 <= SKIP2)) || !(\old(customIrp) == 0))))) && ((((((((((((((NP + 2 <= SKIP1 && 0 == pended) && s == NP) && SKIP2 + 3 <= IPC) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && 0 <= myStatus + 1073741637) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && routine == 1) && \old(customIrp) == customIrp) || !(\old(s) == MPR3)) || (((!(\old(setEventCalled) == 1) || !(NP + 2 <= SKIP1)) || !(0 <= myStatus + 1073741637)) || !(DC + 2 <= SKIP2)) || (!(SKIP1 + 2 <= MPR1) || !(SKIP2 + 3 <= IPC)) || ((!(NP + 5 <= MPR3) || !(0 == pended)) || !(1 <= compRegistered)) || !(1 == routine)) || !(0 <= myStatus)) || !(\old(customIrp) == 0)) - InvariantResult [Line: 171]: Loop Invariant Derived loop invariant: ((((((((((((!(NP + 2 <= SKIP1) || !(NP + 5 <= MPR3)) || !(DC + 2 <= SKIP2)) || !(0 == \old(routine))) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(0 <= myStatus + 1073741637)) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(0 <= myStatus)) || !(\old(customIrp) == 0)) || ((((0 == pended && s == NP) && 1 <= compRegistered) && routine == 1) && \old(customIrp) == customIrp)) && (!(myStatus + 1073741637 <= 0) || ((((((((!(NP + 2 <= SKIP1) || !(NP + 5 <= MPR3)) || !(DC + 2 <= SKIP2)) || !(0 == \old(routine))) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(0 <= myStatus + 1073741637)) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) - InvariantResult [Line: 553]: Loop Invariant Derived loop invariant: (0 == pended && s == \old(s)) || ((((((((!(NP + 2 <= SKIP1) || !(NP + 5 <= MPR3)) || !(DC + 2 <= SKIP2)) || !(0 == routine)) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(0 <= \old(myStatus) + 1073741637)) || !(compRegistered == 0)) || !(0 == \old(pended)) - InvariantResult [Line: 325]: Loop Invariant Derived loop invariant: (((((((((((!(NP + 2 <= SKIP1) || !(NP + 5 <= MPR3)) || !(DC + 2 <= SKIP2)) || !(\old(myStatus) + 1 <= 0)) || !(0 == \old(routine))) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(0 <= \old(myStatus) + 1073741637)) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) && (((((((((!(NP + 2 <= SKIP1) || !(NP + 5 <= MPR3)) || !(\old(myStatus) == 0)) || !(DC + 2 <= SKIP2)) || !(0 == \old(routine))) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(\old(compRegistered) == 0)) || !(0 == \old(pended)))) || (((((0 == pended && 0 == compRegistered) && s == \old(s)) && 0 == routine) && myStatus + 1 <= 0) && myStatus == \old(myStatus)) - InvariantResult [Line: 1117]: Loop Invariant Derived loop invariant: (((s == NP && 0 == pended) && 0 == status) || (status + 1073741670 <= 0 && s == NP && 0 == pended)) || ((((((((!(NP + 2 <= SKIP1) || !(NP + 5 <= MPR3)) || !(DC + 2 <= SKIP2)) || !(0 == routine)) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(0 <= \old(myStatus) + 1073741637)) || !(compRegistered == 0)) || !(0 == \old(pended)) - InvariantResult [Line: 1785]: Loop Invariant Derived loop invariant: ((((((((((((((myStatus == 0 && ((((((((((((((NP + 2 <= SKIP1 && 0 == pended) && s == NP) && 0 == compRegistered) && SKIP2 + 3 <= IPC) && SKIP1 + 2 <= MPR1) && 0 == routine) && 0 <= myStatus + 1073741637) && !(myStatus == 0)) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) || (((((((((NP + 2 <= SKIP1 && 0 == pended) && s == NP) && 0 == compRegistered) && SKIP2 + 3 <= IPC) && SKIP1 + 2 <= MPR1) && 0 == routine) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && myStatus == \old(myStatus))) && \old(customIrp) == customIrp) && 0 <= myStatus) || (((((((((((((NP + 2 <= SKIP1 && 0 == pended) && s == NP) && 0 == compRegistered) && SKIP2 + 3 <= IPC) && SKIP1 + 2 <= MPR1) && 0 == routine) && 0 <= myStatus + 1073741637) && !(myStatus == 0)) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) || (((((((((NP + 2 <= SKIP1 && 0 == pended) && s == NP) && 0 == compRegistered) && SKIP2 + 3 <= IPC) && SKIP1 + 2 <= MPR1) && 0 == routine) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && myStatus == \old(myStatus))) && myStatus + 1073741637 <= 0) && \old(customIrp) == customIrp))) || !(\old(myStatus) == 0)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(DC))) || !(0 == \old(routine))) || (((((((((((((((NP + 2 <= SKIP1 && 0 == pended) && s == NP) && 0 == compRegistered) && SKIP2 + 3 <= IPC) && SKIP1 + 2 <= MPR1) && 0 == routine) && 0 <= myStatus + 1073741637) && !(myStatus == 0)) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) || (((((((((NP + 2 <= SKIP1 && 0 == pended) && s == NP) && 0 == compRegistered) && SKIP2 + 3 <= IPC) && SKIP1 + 2 <= MPR1) && 0 == routine) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && myStatus == \old(myStatus))) && \old(customIrp) == customIrp) && 0 <= myStatus) || (((((((((((((NP + 2 <= SKIP1 && 0 == pended) && s == NP) && 0 == compRegistered) && SKIP2 + 3 <= IPC) && SKIP1 + 2 <= MPR1) && 0 == routine) && 0 <= myStatus + 1073741637) && !(myStatus == 0)) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) || (((((((((NP + 2 <= SKIP1 && 0 == pended) && s == NP) && 0 == compRegistered) && SKIP2 + 3 <= IPC) && SKIP1 + 2 <= MPR1) && 0 == routine) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && myStatus == \old(myStatus))) && myStatus + 1073741637 <= 0) && \old(customIrp) == customIrp)) && myStatus + 1073741637 <= 0)) || !(\old(compRegistered) == 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: 1086]: Loop Invariant Derived loop invariant: (0 == pended && s == \old(s)) || ((((((((!(NP + 2 <= SKIP1) || !(NP + 5 <= MPR3)) || !(DC + 2 <= SKIP2)) || !(0 == routine)) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(0 <= \old(myStatus) + 1073741637)) || !(compRegistered == 0)) || !(0 == \old(pended)) - InvariantResult [Line: 2135]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1115]: Loop Invariant Derived loop invariant: ((0 == pended && s == \old(s)) && (147480 <= currentIrpStack__Parameters__DeviceIoControl__IoControlCode || !(currentIrpStack__Parameters__DeviceIoControl__IoControlCode == __cil_tmp42))) || ((((((((!(NP + 2 <= SKIP1) || !(NP + 5 <= MPR3)) || !(DC + 2 <= SKIP2)) || !(0 == routine)) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(0 <= \old(myStatus) + 1073741637)) || !(compRegistered == 0)) || !(0 == \old(pended)) - InvariantResult [Line: 1792]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 240]: Loop Invariant Derived loop invariant: (((((!(\old(myStatus) + 1073741637 <= 0) || ((((((((!(NP + 2 <= SKIP1) || !(NP + 5 <= MPR3)) || !(DC + 2 <= SKIP2)) || !(0 == \old(routine))) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(0 <= \old(myStatus) + 1073741637)) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(customIrp) == 0)) && (((((((((((!(NP + 2 <= SKIP1) || !(NP + 5 <= MPR3)) || !(DC + 2 <= SKIP2)) || !(0 == \old(routine))) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(0 <= \old(myStatus) + 1073741637)) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(0 <= \old(myStatus))) || !(\old(customIrp) == 0))) || (((((((((NP + 2 <= SKIP1 && 0 == pended) && s == NP) && 0 == compRegistered) && SKIP2 + 3 <= IPC) && SKIP1 + 2 <= MPR1) && s == \old(s)) && 0 == routine) && NP + 5 <= MPR3) && DC + 2 <= SKIP2)) || !(\old(myStatus) + 1073741637 <= 0)) && (((((!(\old(myStatus) + 1073741637 <= 0) || ((((((((!(NP + 2 <= SKIP1) || !(NP + 5 <= MPR3)) || !(DC + 2 <= SKIP2)) || !(0 == \old(routine))) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(0 <= \old(myStatus) + 1073741637)) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(customIrp) == 0)) && (((((((((((!(NP + 2 <= SKIP1) || !(NP + 5 <= MPR3)) || !(DC + 2 <= SKIP2)) || !(0 == \old(routine))) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(0 <= \old(myStatus) + 1073741637)) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(0 <= \old(myStatus))) || !(\old(customIrp) == 0))) || (((((((((NP + 2 <= SKIP1 && 0 == pended) && s == NP) && 0 == compRegistered) && SKIP2 + 3 <= IPC) && SKIP1 + 2 <= MPR1) && s == \old(s)) && 0 == routine) && NP + 5 <= MPR3) && DC + 2 <= SKIP2)) || !(\old(myStatus) == 0)) - InvariantResult [Line: 2005]: Loop Invariant Derived loop invariant: (((((((!(myStatus == 0) || (((!(0 <= myStatus) || ((((((!(NP + 2 <= SKIP1) || (!(NP + 5 <= MPR3) || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(0 <= myStatus + 1073741637)) || !(0 == pended)) || !(DC + 2 <= SKIP2)) || !(\old(customIrp) == 0)) && ((!(myStatus + 1073741637 <= 0) || ((((((!(NP + 2 <= SKIP1) || (!(NP + 5 <= MPR3) || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(0 <= myStatus + 1073741637)) || !(0 == pended)) || !(DC + 2 <= SKIP2)) || !(\old(customIrp) == 0)))) || \old(customIrp) == customIrp) && (((!(\old(s) == MPR3) || (((!(\old(setEventCalled) == 1) || !(NP + 2 <= SKIP1)) || !(0 <= myStatus + 1073741637)) || !(DC + 2 <= SKIP2)) || (!(SKIP1 + 2 <= MPR1) || !(SKIP2 + 3 <= IPC)) || ((!(NP + 5 <= MPR3) || !(0 == pended)) || !(1 <= compRegistered)) || !(1 == routine)) || !(0 <= myStatus)) || !(\old(customIrp) == 0))) && (((!(myStatus + 1073741637 <= 0) || !(\old(s) == MPR3)) || (((!(\old(setEventCalled) == 1) || !(NP + 2 <= SKIP1)) || !(0 <= myStatus + 1073741637)) || !(DC + 2 <= SKIP2)) || (!(SKIP1 + 2 <= MPR1) || !(SKIP2 + 3 <= IPC)) || ((!(NP + 5 <= MPR3) || !(0 == pended)) || !(1 <= compRegistered)) || !(1 == routine)) || !(\old(customIrp) == 0))) && (((((((((((((((0 == pended && SKIP2 + 3 <= IPC) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && 0 <= myStatus + 1073741637) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP == \old(s)) && routine == 1) && s + 2 <= SKIP1) && setEventCalled == 1) && s == \old(s)) && \old(customIrp) == customIrp) || (((((((((!(\old(setEventCalled) == 1) || !(\old(s) + 2 <= SKIP1)) || !(NP + 5 <= MPR3)) || !(DC + 2 <= SKIP2)) || !(1 == routine)) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(0 <= myStatus + 1073741637)) || !(0 == pended)) || !(1 <= compRegistered)) || !(0 <= myStatus)) || !(\old(customIrp) == 0))) && (s == \old(s) || ((((((!(NP + 2 <= SKIP1) || (!(NP + 5 <= MPR3) || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(0 <= myStatus + 1073741637)) || !(0 == pended)) || !(DC + 2 <= SKIP2))) && ((!(myStatus + 1073741637 <= 0) || \old(customIrp) == customIrp) || (((!(0 <= myStatus) || ((((((!(NP + 2 <= SKIP1) || (!(NP + 5 <= MPR3) || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(0 <= myStatus + 1073741637)) || !(0 == pended)) || !(DC + 2 <= SKIP2)) || !(\old(customIrp) == 0)) && ((!(myStatus + 1073741637 <= 0) || ((((((!(NP + 2 <= SKIP1) || (!(NP + 5 <= MPR3) || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(0 <= myStatus + 1073741637)) || !(0 == pended)) || !(DC + 2 <= SKIP2)) || !(\old(customIrp) == 0))))) && (((!(myStatus + 1073741637 <= 0) || (((((((((!(\old(setEventCalled) == 1) || !(\old(s) + 2 <= SKIP1)) || !(NP + 5 <= MPR3)) || !(DC + 2 <= SKIP2)) || !(1 == routine)) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(0 <= myStatus + 1073741637)) || !(0 == pended)) || !(1 <= compRegistered)) || !(\old(customIrp) == 0)) || ((((((((((((0 == pended && SKIP2 + 3 <= IPC) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && 0 <= myStatus + 1073741637) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP == \old(s)) && routine == 1) && s + 2 <= SKIP1) && setEventCalled == 1) && s == \old(s)) && \old(customIrp) == customIrp)) - InvariantResult [Line: 1842]: Loop Invariant Derived loop invariant: (((((((((((((((!(\old(myStatus) == 0) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || (((((SKIP2 + 3 <= IPC && status == lowerDriverReturn && NP + 5 <= MPR3) && SKIP1 + 2 <= MPR1) || (s == DC && (NP + 5 <= MPR3 && SKIP2 + 3 <= IPC) && SKIP1 + 2 <= MPR1)) && DC + 5 <= IPC) && IPC <= s)) || (SKIP2 <= s && (((SKIP2 + 3 <= IPC && status == lowerDriverReturn && NP + 5 <= MPR3) && SKIP1 + 2 <= MPR1) || (s == DC && (NP + 5 <= MPR3 && SKIP2 + 3 <= IPC) && SKIP1 + 2 <= MPR1)) && DC + 2 <= SKIP2)) || !(\old(s) == \old(DC))) || !(0 == \old(routine))) || !(\old(compRegistered) == 0)) || ((status == lowerDriverReturn && status == 0) && NP + 5 <= MPR3)) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || !(\old(s) == \old(NP))) || (!(status == 259) && NP + 2 <= SKIP1 && (((SKIP2 + 3 <= IPC && status == lowerDriverReturn && NP + 5 <= MPR3) && SKIP1 + 2 <= MPR1) || (s == DC && (NP + 5 <= MPR3 && SKIP2 + 3 <= IPC) && SKIP1 + 2 <= MPR1)) && 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: ((((((((((((!(NP + 2 <= SKIP1) || !(NP + 5 <= MPR3)) || !(DC + 2 <= SKIP2)) || (0 == pended && SKIP1 == s)) || !(\old(s) <= SKIP1)) || !(0 == routine)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(SKIP1 <= \old(s))) || !(compRegistered == 0)) || !(0 == \old(pended))) && (((((((s == MPR1 && compRetStatus + 1073741802 <= 0) && 0 == pended) && 0 <= compRetStatus + 1073741802) && __cil_tmp8 + 1073741802 <= 0) && setEventCalled == 1) && 0 <= __cil_tmp8 + 1073741802) || (((!(myStatus + 1073741637 <= 0) || ((((((((!(NP + 5 <= MPR3) || !(\old(s) + 2 <= SKIP1)) || !(DC + 2 <= SKIP2)) || !(1 == routine)) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(0 <= myStatus + 1073741637)) || !(0 == \old(pended))) || !(1 <= compRegistered)) || !(customIrp == 0)) && (((((((((((!(NP + 5 <= MPR3) || !(\old(s) + 2 <= SKIP1)) || !(DC + 2 <= SKIP2)) || !(1 == routine)) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(0 <= myStatus + 1073741637)) || !(0 == \old(pended))) || !(1 <= compRegistered)) || !(0 <= myStatus)) || !(customIrp == 0))))) && ((((((((((!(NP + 5 <= MPR3) || !(myStatus == 0)) || !(\old(s) + 2 <= SKIP1)) || !(DC + 2 <= SKIP2)) || !(0 == routine)) || ((((NP + 5 <= MPR3 && DC + 2 <= SKIP2) && s == \old(s)) && 0 == routine) && s + 2 <= SKIP1)) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(0 == \old(pended))) || !(1 <= compRegistered))) && (((((((((((!(NP + 5 <= MPR3) || !(\old(s) + 2 <= SKIP1)) || !(DC + 2 <= SKIP2)) || !(myStatus + 1 <= 0)) || ((((NP + 5 <= MPR3 && DC + 2 <= SKIP2) && s == \old(s)) && 0 == routine) && s + 2 <= SKIP1)) || !(0 == routine)) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(0 <= myStatus + 1073741637)) || !(0 == \old(pended))) || !(1 <= compRegistered)) - InvariantResult [Line: 560]: Loop Invariant Derived loop invariant: (((((((((!(NP + 2 <= SKIP1) || !(NP + 5 <= MPR3)) || !(DC + 2 <= SKIP2)) || !(0 == routine)) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(0 <= \old(myStatus) + 1073741637)) || !(compRegistered == 0)) || !(0 == \old(pended))) || ((0 == pended && s == \old(s)) && myStatus == \old(myStatus)) - InvariantResult [Line: 1050]: Loop Invariant Derived loop invariant: ((0 == pended && s == \old(s)) && (147480 <= currentIrpStack__Parameters__DeviceIoControl__IoControlCode || !(currentIrpStack__Parameters__DeviceIoControl__IoControlCode == __cil_tmp42))) || ((((((((!(NP + 2 <= SKIP1) || !(NP + 5 <= MPR3)) || !(DC + 2 <= SKIP2)) || !(0 == routine)) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(0 <= \old(myStatus) + 1073741637)) || !(compRegistered == 0)) || !(0 == \old(pended)) - InvariantResult [Line: 329]: Loop Invariant Derived loop invariant: ((((((status == lowerDriverReturn && s == IPC) && 0 == routine) && 1 <= compRegistered) || (((((((((((!(NP + 2 <= SKIP1) || !(NP + 5 <= MPR3)) || !(DC + 2 <= SKIP2)) || !(\old(myStatus) + 1 <= 0)) || !(0 == \old(routine))) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(0 <= \old(myStatus) + 1073741637)) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) && (((((((((!(NP + 2 <= SKIP1) || !(NP + 5 <= MPR3)) || !(\old(myStatus) == 0)) || !(DC + 2 <= SKIP2)) || !(0 == \old(routine))) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))))) || ((status <= lowerDriverReturn && ((0 == pended && NP + 5 <= MPR3) && s == SKIP2) && 0 == routine) && lowerDriverReturn <= status)) || ((((0 == pended && NP + 5 <= MPR3) && 0 == routine) && s == DC) && !(status == 259))) || (((status == lowerDriverReturn && s == IPC) && 0 == pended && NP + 5 <= MPR3) && 0 == routine) - InvariantResult [Line: 1068]: Loop Invariant Derived loop invariant: ((0 == pended && s == \old(s)) && (147480 <= currentIrpStack__Parameters__DeviceIoControl__IoControlCode || !(currentIrpStack__Parameters__DeviceIoControl__IoControlCode == __cil_tmp42))) || ((((((((!(NP + 2 <= SKIP1) || !(NP + 5 <= MPR3)) || !(DC + 2 <= SKIP2)) || !(0 == routine)) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(0 <= \old(myStatus) + 1073741637)) || !(compRegistered == 0)) || !(0 == \old(pended)) - InvariantResult [Line: 322]: Loop Invariant Derived loop invariant: (((0 == pended && 0 == compRegistered) && s == \old(s)) && 0 == routine) || (((((((((((!(NP + 2 <= SKIP1) || !(NP + 5 <= MPR3)) || !(DC + 2 <= SKIP2)) || !(\old(myStatus) + 1 <= 0)) || !(0 == \old(routine))) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(0 <= \old(myStatus) + 1073741637)) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) && (((((((((!(NP + 2 <= SKIP1) || !(NP + 5 <= MPR3)) || !(\old(myStatus) == 0)) || !(DC + 2 <= SKIP2)) || !(0 == \old(routine))) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(\old(compRegistered) == 0)) || !(0 == \old(pended)))) - InvariantResult [Line: 235]: Loop Invariant Derived loop invariant: ((((!(\old(myStatus) + 1073741637 <= 0) || ((((((((!(NP + 2 <= SKIP1) || !(NP + 5 <= MPR3)) || !(DC + 2 <= SKIP2)) || !(0 == \old(routine))) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(0 <= \old(myStatus) + 1073741637)) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(customIrp) == 0)) && (((((((((((!(NP + 2 <= SKIP1) || !(NP + 5 <= MPR3)) || !(DC + 2 <= SKIP2)) || !(0 == \old(routine))) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(0 <= \old(myStatus) + 1073741637)) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(0 <= \old(myStatus))) || !(\old(customIrp) == 0))) || !(\old(myStatus) + 1073741637 <= 0)) && (((((!(\old(myStatus) + 1073741637 <= 0) || ((((((((!(NP + 2 <= SKIP1) || !(NP + 5 <= MPR3)) || !(DC + 2 <= SKIP2)) || !(0 == \old(routine))) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(0 <= \old(myStatus) + 1073741637)) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(customIrp) == 0)) && (((((((((((!(NP + 2 <= SKIP1) || !(NP + 5 <= MPR3)) || !(DC + 2 <= SKIP2)) || !(0 == \old(routine))) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(0 <= \old(myStatus) + 1073741637)) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(0 <= \old(myStatus))) || !(\old(customIrp) == 0))) || !(\old(myStatus) == 0)) || (((((0 == pended && 0 == compRegistered) && s == \old(s)) && 0 == routine) && myStatus == \old(myStatus)) && \old(customIrp) == customIrp)) - InvariantResult [Line: 1023]: Loop Invariant Derived loop invariant: (((((((((!(NP + 2 <= SKIP1) || !(NP + 5 <= MPR3)) || !(DC + 2 <= SKIP2)) || !(0 == routine)) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(0 <= \old(myStatus) + 1073741637)) || !(compRegistered == 0)) || !(0 == \old(pended))) || ((((0 == pended && s == \old(s)) && 147480 <= currentIrpStack__Parameters__DeviceIoControl__IoControlCode) || ((0 == pended && s == \old(s)) && !(currentIrpStack__Parameters__DeviceIoControl__IoControlCode == __cil_tmp42))) && myStatus == \old(myStatus)) - InvariantResult [Line: 2079]: Loop Invariant Derived loop invariant: (((((((!(NP + 5 <= MPR3) || !(0 == routine)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || !(0 == \old(pended))) || (0 == pended && SKIP1 == s)) || !(DC + 2 <= SKIP2) - InvariantResult [Line: 596]: Loop Invariant Derived loop invariant: (0 == pended && s == \old(s)) || ((((((((!(NP + 2 <= SKIP1) || !(NP + 5 <= MPR3)) || !(DC + 2 <= SKIP2)) || !(0 == routine)) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(0 <= \old(myStatus) + 1073741637)) || !(compRegistered == 0)) || !(0 == \old(pended)) - InvariantResult [Line: 578]: Loop Invariant Derived loop invariant: (0 == pended && s == \old(s)) || ((((((((!(NP + 2 <= SKIP1) || !(NP + 5 <= MPR3)) || !(DC + 2 <= SKIP2)) || !(0 == routine)) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(0 <= \old(myStatus) + 1073741637)) || !(compRegistered == 0)) || !(0 == \old(pended)) - InvariantResult [Line: 1780]: Loop Invariant Derived loop invariant: (((((((((((((!(\old(myStatus) == 0) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(DC))) || !(0 == \old(routine))) || !(\old(compRegistered) == 0)) || ((((((((((NP + 2 <= SKIP1 && 0 == pended) && s == NP) && 0 == compRegistered) && SKIP2 + 3 <= IPC) && SKIP1 + 2 <= MPR1) && 0 == routine) && myStatus + 1 <= 0) && 0 <= myStatus + 1073741637) && NP + 5 <= MPR3) && DC + 2 <= SKIP2)) || !(\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)) || (((((((((NP + 2 <= SKIP1 && 0 == pended) && s == NP) && 0 == compRegistered) && SKIP2 + 3 <= IPC) && SKIP1 + 2 <= MPR1) && 0 == routine) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && myStatus == \old(myStatus)) - InvariantResult [Line: 1113]: Loop Invariant Derived loop invariant: ((0 == pended && s == \old(s)) && (147480 <= currentIrpStack__Parameters__DeviceIoControl__IoControlCode || !(currentIrpStack__Parameters__DeviceIoControl__IoControlCode == __cil_tmp42))) || ((((((((!(NP + 2 <= SKIP1) || !(NP + 5 <= MPR3)) || !(DC + 2 <= SKIP2)) || !(0 == routine)) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(0 <= \old(myStatus) + 1073741637)) || !(compRegistered == 0)) || !(0 == \old(pended)) - InvariantResult [Line: 711]: Loop Invariant Derived loop invariant: (((s == NP && 0 == pended) && myStatus == \old(myStatus)) && status + 1073741670 <= 0) || ((((((((!(NP + 2 <= SKIP1) || !(NP + 5 <= MPR3)) || !(DC + 2 <= SKIP2)) || !(0 == routine)) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(0 <= \old(myStatus) + 1073741637)) || !(compRegistered == 0)) || !(0 == \old(pended)) - InvariantResult [Line: 319]: Loop Invariant Derived loop invariant: (((((((((((!(NP + 2 <= SKIP1) || !(NP + 5 <= MPR3)) || !(DC + 2 <= SKIP2)) || !(\old(myStatus) + 1 <= 0)) || !(0 == \old(routine))) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(0 <= \old(myStatus) + 1073741637)) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) && (((((((((!(NP + 2 <= SKIP1) || !(NP + 5 <= MPR3)) || !(\old(myStatus) == 0)) || !(DC + 2 <= SKIP2)) || !(0 == \old(routine))) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(\old(compRegistered) == 0)) || !(0 == \old(pended)))) || ((((0 == pended && 0 == compRegistered) && s == \old(s)) && 0 == routine) && myStatus == \old(myStatus)) - InvariantResult [Line: 1014]: Loop Invariant Derived loop invariant: (0 == pended && s == \old(s)) || ((((((((!(NP + 2 <= SKIP1) || !(NP + 5 <= MPR3)) || !(DC + 2 <= SKIP2)) || !(0 == routine)) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(0 <= \old(myStatus) + 1073741637)) || !(compRegistered == 0)) || !(0 == \old(pended)) - InvariantResult [Line: 263]: Loop Invariant Derived loop invariant: (((((!(\old(myStatus) + 1073741637 <= 0) || ((((((((!(NP + 2 <= SKIP1) || !(NP + 5 <= MPR3)) || !(DC + 2 <= SKIP2)) || !(0 == \old(routine))) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(0 <= \old(myStatus) + 1073741637)) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(customIrp) == 0)) && (((((((((((!(NP + 2 <= SKIP1) || !(NP + 5 <= MPR3)) || !(DC + 2 <= SKIP2)) || !(0 == \old(routine))) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(0 <= \old(myStatus) + 1073741637)) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(0 <= \old(myStatus))) || !(\old(customIrp) == 0))) || !(\old(myStatus) == 0)) || (((((((((((((NP + 2 <= SKIP1 && s == NP) && 0 == pended) && 0 == compRegistered) && SKIP2 + 3 <= IPC) && SKIP1 + 2 <= MPR1) && 0 == routine) && s == \old(s)) && 0 <= myStatus + 1073741637) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && setPagable <= 0) && \old(customIrp) == customIrp) && myStatus == \old(myStatus))) && (((((!(\old(myStatus) + 1073741637 <= 0) || ((((((((!(NP + 2 <= SKIP1) || !(NP + 5 <= MPR3)) || !(DC + 2 <= SKIP2)) || !(0 == \old(routine))) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(0 <= \old(myStatus) + 1073741637)) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(customIrp) == 0)) && (((((((((((!(NP + 2 <= SKIP1) || !(NP + 5 <= MPR3)) || !(DC + 2 <= SKIP2)) || !(0 == \old(routine))) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(0 <= \old(myStatus) + 1073741637)) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(0 <= \old(myStatus))) || !(\old(customIrp) == 0))) || (((((((((((((NP + 2 <= SKIP1 && s == NP) && 0 == pended) && 0 == compRegistered) && SKIP2 + 3 <= IPC) && SKIP1 + 2 <= MPR1) && 0 == routine) && s == \old(s)) && 0 <= myStatus + 1073741637) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && setPagable <= 0) && \old(customIrp) == customIrp) && myStatus == \old(myStatus))) || !(\old(myStatus) + 1073741637 <= 0)) - InvariantResult [Line: 2133]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1832]: Loop Invariant Derived loop invariant: (((((((((((((((((!(\old(myStatus) == 0) || s == UNLOADED) || (((((s == IPC && status == lowerDriverReturn) && DC + 5 <= IPC) && SKIP2 + 3 <= IPC) && SKIP1 + 2 <= MPR1) && NP + 5 <= MPR3)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || (((s == IPC && status == lowerDriverReturn) && status == 0) && NP + 5 <= MPR3)) || !(\old(s) == \old(DC))) || !(0 == \old(routine))) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || (!(status == 259) && ((((NP + 2 <= SKIP1 && SKIP2 + 3 <= IPC) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && s == DC) && NP + 5 <= MPR3)) || (((status == lowerDriverReturn && s == SKIP2) && status == 0) && NP + 5 <= MPR3)) || !(\old(s) == \old(NP))) || !(0 == \old(pended))) || (((((status == lowerDriverReturn && s == SKIP2) && SKIP2 + 3 <= IPC) && DC + 2 <= SKIP2) && 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: ((((((((((((((NP + 2 <= SKIP1 && 0 == pended) && s == NP) && 0 == compRegistered) && SKIP2 + 3 <= IPC) && SKIP1 + 2 <= MPR1) && s == \old(s)) && 0 == routine) && 0 <= myStatus + 1073741637) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && \old(customIrp) == customIrp) && myStatus == \old(myStatus)) || (((!(\old(myStatus) + 1073741637 <= 0) || ((((((((!(NP + 2 <= SKIP1) || !(NP + 5 <= MPR3)) || !(DC + 2 <= SKIP2)) || !(0 == \old(routine))) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(0 <= \old(myStatus) + 1073741637)) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(customIrp) == 0)) && (((((((((((!(NP + 2 <= SKIP1) || !(NP + 5 <= MPR3)) || !(DC + 2 <= SKIP2)) || !(0 == \old(routine))) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(0 <= \old(myStatus) + 1073741637)) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(0 <= \old(myStatus))) || !(\old(customIrp) == 0)))) || !(\old(myStatus) == 0)) && (((((!(\old(myStatus) + 1073741637 <= 0) || ((((((((!(NP + 2 <= SKIP1) || !(NP + 5 <= MPR3)) || !(DC + 2 <= SKIP2)) || !(0 == \old(routine))) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(0 <= \old(myStatus) + 1073741637)) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(customIrp) == 0)) && (((((((((((!(NP + 2 <= SKIP1) || !(NP + 5 <= MPR3)) || !(DC + 2 <= SKIP2)) || !(0 == \old(routine))) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(0 <= \old(myStatus) + 1073741637)) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(0 <= \old(myStatus))) || !(\old(customIrp) == 0))) || !(\old(myStatus) + 1073741637 <= 0)) || ((((((((((((NP + 2 <= SKIP1 && 0 == pended) && s == NP) && 0 == compRegistered) && SKIP2 + 3 <= IPC) && SKIP1 + 2 <= MPR1) && s == \old(s)) && 0 == routine) && 0 <= myStatus + 1073741637) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && \old(customIrp) == customIrp) && myStatus == \old(myStatus))) - InvariantResult [Line: 316]: Loop Invariant Derived loop invariant: (((((((((((!(NP + 2 <= SKIP1) || !(NP + 5 <= MPR3)) || !(DC + 2 <= SKIP2)) || !(\old(myStatus) + 1 <= 0)) || !(0 == \old(routine))) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(0 <= \old(myStatus) + 1073741637)) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) && (((((((((!(NP + 2 <= SKIP1) || !(NP + 5 <= MPR3)) || !(\old(myStatus) == 0)) || !(DC + 2 <= SKIP2)) || !(0 == \old(routine))) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(\old(compRegistered) == 0)) || !(0 == \old(pended)))) || ((((0 == pended && 0 == compRegistered) && s == \old(s)) && 0 == routine) && myStatus == \old(myStatus)) - InvariantResult [Line: 632]: Loop Invariant Derived loop invariant: (0 == pended && s == \old(s)) || ((((((((!(NP + 2 <= SKIP1) || !(NP + 5 <= MPR3)) || !(DC + 2 <= SKIP2)) || !(0 == routine)) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(0 <= \old(myStatus) + 1073741637)) || !(compRegistered == 0)) || !(0 == \old(pended)) - InvariantResult [Line: 327]: Loop Invariant Derived loop invariant: (((0 == pended && 0 == compRegistered) && s == \old(s)) && 0 == routine) || (((((((((((!(NP + 2 <= SKIP1) || !(NP + 5 <= MPR3)) || !(DC + 2 <= SKIP2)) || !(\old(myStatus) + 1 <= 0)) || !(0 == \old(routine))) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(0 <= \old(myStatus) + 1073741637)) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) && (((((((((!(NP + 2 <= SKIP1) || !(NP + 5 <= MPR3)) || !(\old(myStatus) == 0)) || !(DC + 2 <= SKIP2)) || !(0 == \old(routine))) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(\old(compRegistered) == 0)) || !(0 == \old(pended)))) - InvariantResult [Line: 2050]: Loop Invariant Derived loop invariant: (((((((!(NP + 5 <= MPR3) || !(SKIP1 == \old(s))) || (0 == pended && SKIP1 == s)) || !(DC + 2 <= SKIP2)) || !(0 == routine)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(compRegistered == 0)) || !(0 == \old(pended)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 30 procedures, 515 locations, 1 error locations. SAFE Result, 82.7s OverallTime, 83 OverallIterations, 2 TraceHistogramMax, 25.6s AutomataDifference, 0.0s DeadEndRemovalTime, 43.6s HoareAnnotationTime, HoareTripleCheckerStatistics: 44324 SDtfs, 17779 SDslu, 202513 SDs, 0 SdLazy, 20886 SolverSat, 3098 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 15.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 987 GetRequests, 309 SyntacticMatches, 5 SemanticMatches, 673 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 336 ImplicationChecksByTransitivity, 5.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=944occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 3.9s AutomataMinimizationTime, 83 MinimizatonAttempts, 2743 StatesRemovedByMinimization, 48 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 171 LocationsWithAnnotation, 1664 PreInvPairs, 1919 NumberOfFragments, 23963 HoareAnnotationTreeSize, 1664 FomulaSimplifications, 23184916 FormulaSimplificationTreeSizeReduction, 2.6s HoareSimplificationTime, 171 FomulaSimplificationsInter, 1451659 FormulaSimplificationTreeSizeReductionInter, 40.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 6.3s InterpolantComputationTime, 5513 NumberOfCodeBlocks, 5513 NumberOfCodeBlocksAsserted, 84 NumberOfCheckSat, 5429 ConstructedInterpolants, 0 QuantifiedInterpolants, 746882 SizeOfPredicates, 0 NumberOfNonLiveVariables, 921 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 84 InterpolantComputations, 83 PerfectInterpolantSequences, 67/74 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...