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 --abstractinterpretationv2.abstract.domain IntervalDomain --traceabstraction.trace.refinement.strategy TAIPAN --traceabstraction.abstract.interpretation.mode USE_PREDICATES -i ../../../trunk/examples/svcomp/ntdrivers-simplified/kbfiltr_simpl1.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 01:07:09,911 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 01:07:09,913 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 01:07:09,930 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 01:07:09,931 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 01:07:09,933 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 01:07:09,934 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 01:07:09,943 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 01:07:09,947 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 01:07:09,950 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 01:07:09,951 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 01:07:09,953 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 01:07:09,953 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 01:07:09,955 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 01:07:09,957 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 01:07:09,958 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 01:07:09,960 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 01:07:09,961 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 01:07:09,963 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 01:07:09,967 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 01:07:09,971 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 01:07:09,972 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 01:07:09,973 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 01:07:09,973 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 01:07:09,975 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 01:07:09,975 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 01:07:09,976 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 01:07:09,977 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 01:07:09,979 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 01:07:09,979 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 01:07:09,980 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 01:07:09,981 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 01:07:09,982 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 01:07:09,983 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 01:07:09,984 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 01:07:09,984 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 01:07:09,985 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 01:07:09,985 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 01:07:09,985 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 01:07:09,987 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 01:07:09,990 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 01:07:09,991 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-10-15 01:07:10,020 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 01:07:10,022 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 01:07:10,023 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 01:07:10,023 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 01:07:10,023 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 01:07:10,024 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 01:07:10,024 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 01:07:10,024 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 01:07:10,024 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 01:07:10,024 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 01:07:10,025 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 01:07:10,025 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 01:07:10,025 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 01:07:10,025 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 01:07:10,025 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 01:07:10,026 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 01:07:10,026 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 01:07:10,026 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 01:07:10,026 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 01:07:10,026 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 01:07:10,027 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 01:07:10,027 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:07:10,027 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 01:07:10,032 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 01:07:10,032 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 01:07:10,032 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 01:07:10,032 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 01:07:10,032 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 01:07:10,033 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES [2019-10-15 01:07:10,302 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 01:07:10,321 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 01:07:10,325 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 01:07:10,326 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 01:07:10,326 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 01:07:10,327 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ntdrivers-simplified/kbfiltr_simpl1.cil.c [2019-10-15 01:07:10,392 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e43bfd805/b0d5fec88b6e4dfab07eceb2f696f833/FLAG422eb63df [2019-10-15 01:07:10,856 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 01:07:10,859 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers-simplified/kbfiltr_simpl1.cil.c [2019-10-15 01:07:10,880 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e43bfd805/b0d5fec88b6e4dfab07eceb2f696f833/FLAG422eb63df [2019-10-15 01:07:11,211 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e43bfd805/b0d5fec88b6e4dfab07eceb2f696f833 [2019-10-15 01:07:11,221 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 01:07:11,223 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 01:07:11,224 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 01:07:11,224 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 01:07:11,227 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 01:07:11,228 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:07:11" (1/1) ... [2019-10-15 01:07:11,231 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7fb0478c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:07:11, skipping insertion in model container [2019-10-15 01:07:11,231 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:07:11" (1/1) ... [2019-10-15 01:07:11,238 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 01:07:11,281 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 01:07:11,508 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:07:11,515 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 01:07:11,669 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:07:11,689 INFO L192 MainTranslator]: Completed translation [2019-10-15 01:07:11,689 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:07:11 WrapperNode [2019-10-15 01:07:11,689 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 01:07:11,690 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 01:07:11,690 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 01:07:11,690 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 01:07:11,700 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:07:11" (1/1) ... [2019-10-15 01:07:11,700 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:07:11" (1/1) ... [2019-10-15 01:07:11,709 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:07:11" (1/1) ... [2019-10-15 01:07:11,709 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:07:11" (1/1) ... [2019-10-15 01:07:11,721 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:07:11" (1/1) ... [2019-10-15 01:07:11,730 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:07:11" (1/1) ... [2019-10-15 01:07:11,733 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:07:11" (1/1) ... [2019-10-15 01:07:11,737 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 01:07:11,738 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 01:07:11,738 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 01:07:11,738 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 01:07:11,739 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:07:11" (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-10-15 01:07:11,797 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 01:07:11,797 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 01:07:11,797 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2019-10-15 01:07:11,797 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2019-10-15 01:07:11,797 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_PnP [2019-10-15 01:07:11,797 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 01:07:11,798 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2019-10-15 01:07:11,798 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2019-10-15 01:07:11,798 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2019-10-15 01:07:11,798 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2019-10-15 01:07:11,798 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2019-10-15 01:07:11,798 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_Complete [2019-10-15 01:07:11,799 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2019-10-15 01:07:11,799 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 01:07:11,799 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-15 01:07:11,799 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-15 01:07:11,799 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-10-15 01:07:11,800 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-10-15 01:07:11,800 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_PnP [2019-10-15 01:07:11,800 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2019-10-15 01:07:11,800 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2019-10-15 01:07:11,800 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2019-10-15 01:07:11,800 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_Complete [2019-10-15 01:07:11,801 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2019-10-15 01:07:11,801 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2019-10-15 01:07:11,801 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2019-10-15 01:07:11,801 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2019-10-15 01:07:11,801 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 01:07:11,801 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2019-10-15 01:07:11,801 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 01:07:11,801 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 01:07:12,067 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-15 01:07:12,181 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##14: assume !false; [2019-10-15 01:07:12,181 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##13: assume false; [2019-10-15 01:07:12,183 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-15 01:07:12,239 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##8: assume false; [2019-10-15 01:07:12,240 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##9: assume !false; [2019-10-15 01:07:12,259 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-15 01:07:12,293 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2019-10-15 01:07:12,294 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2019-10-15 01:07:12,313 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-15 01:07:12,450 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##43: assume false; [2019-10-15 01:07:12,450 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##44: assume !false; [2019-10-15 01:07:12,457 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 01:07:12,457 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-15 01:07:12,459 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:07:12 BoogieIcfgContainer [2019-10-15 01:07:12,459 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 01:07:12,460 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 01:07:12,461 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 01:07:12,463 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 01:07:12,463 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 01:07:11" (1/3) ... [2019-10-15 01:07:12,464 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60932edc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:07:12, skipping insertion in model container [2019-10-15 01:07:12,464 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:07:11" (2/3) ... [2019-10-15 01:07:12,464 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60932edc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:07:12, skipping insertion in model container [2019-10-15 01:07:12,464 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:07:12" (3/3) ... [2019-10-15 01:07:12,466 INFO L109 eAbstractionObserver]: Analyzing ICFG kbfiltr_simpl1.cil.c [2019-10-15 01:07:12,476 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 01:07:12,484 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 01:07:12,495 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 01:07:12,523 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 01:07:12,523 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 01:07:12,524 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 01:07:12,524 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 01:07:12,524 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 01:07:12,524 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 01:07:12,524 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 01:07:12,525 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 01:07:12,547 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states. [2019-10-15 01:07:12,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-15 01:07:12,553 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:07:12,553 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:07:12,555 INFO L410 AbstractCegarLoop]: === Iteration 1 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:07:12,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:07:12,559 INFO L82 PathProgramCache]: Analyzing trace with hash -1530382191, now seen corresponding path program 1 times [2019-10-15 01:07:12,567 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:07:12,568 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829251201] [2019-10-15 01:07:12,568 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:12,568 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:12,568 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:07:12,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:12,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:07:12,804 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829251201] [2019-10-15 01:07:12,806 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:07:12,806 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:07:12,806 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133001576] [2019-10-15 01:07:12,811 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:07:12,813 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:07:12,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:07:12,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:07:12,829 INFO L87 Difference]: Start difference. First operand 151 states. Second operand 3 states. [2019-10-15 01:07:12,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:07:12,935 INFO L93 Difference]: Finished difference Result 286 states and 438 transitions. [2019-10-15 01:07:12,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:07:12,937 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-10-15 01:07:12,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:07:12,949 INFO L225 Difference]: With dead ends: 286 [2019-10-15 01:07:12,950 INFO L226 Difference]: Without dead ends: 140 [2019-10-15 01:07:12,955 INFO L600 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-10-15 01:07:12,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-10-15 01:07:13,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2019-10-15 01:07:13,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-10-15 01:07:13,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 190 transitions. [2019-10-15 01:07:13,014 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 190 transitions. Word has length 20 [2019-10-15 01:07:13,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:07:13,014 INFO L462 AbstractCegarLoop]: Abstraction has 140 states and 190 transitions. [2019-10-15 01:07:13,014 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:07:13,015 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 190 transitions. [2019-10-15 01:07:13,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-15 01:07:13,016 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:07:13,016 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 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-10-15 01:07:13,016 INFO L410 AbstractCegarLoop]: === Iteration 2 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:07:13,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:07:13,017 INFO L82 PathProgramCache]: Analyzing trace with hash 1141575010, now seen corresponding path program 1 times [2019-10-15 01:07:13,017 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:07:13,018 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885340447] [2019-10-15 01:07:13,018 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:13,018 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:13,018 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:07:13,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:13,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:07:13,237 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885340447] [2019-10-15 01:07:13,237 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:07:13,237 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:07:13,237 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168770338] [2019-10-15 01:07:13,239 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:07:13,239 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:07:13,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:07:13,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:07:13,240 INFO L87 Difference]: Start difference. First operand 140 states and 190 transitions. Second operand 3 states. [2019-10-15 01:07:13,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:07:13,367 INFO L93 Difference]: Finished difference Result 258 states and 346 transitions. [2019-10-15 01:07:13,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:07:13,368 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-10-15 01:07:13,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:07:13,374 INFO L225 Difference]: With dead ends: 258 [2019-10-15 01:07:13,374 INFO L226 Difference]: Without dead ends: 202 [2019-10-15 01:07:13,378 INFO L600 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-10-15 01:07:13,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2019-10-15 01:07:13,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 189. [2019-10-15 01:07:13,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-10-15 01:07:13,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 252 transitions. [2019-10-15 01:07:13,422 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 252 transitions. Word has length 26 [2019-10-15 01:07:13,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:07:13,423 INFO L462 AbstractCegarLoop]: Abstraction has 189 states and 252 transitions. [2019-10-15 01:07:13,423 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:07:13,423 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 252 transitions. [2019-10-15 01:07:13,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-15 01:07:13,424 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:07:13,424 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 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-10-15 01:07:13,425 INFO L410 AbstractCegarLoop]: === Iteration 3 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:07:13,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:07:13,425 INFO L82 PathProgramCache]: Analyzing trace with hash 1029098174, now seen corresponding path program 1 times [2019-10-15 01:07:13,425 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:07:13,426 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645406894] [2019-10-15 01:07:13,426 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:13,426 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:13,426 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:07:13,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:13,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:07:13,582 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645406894] [2019-10-15 01:07:13,582 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:07:13,583 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:07:13,583 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538900492] [2019-10-15 01:07:13,583 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:07:13,584 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:07:13,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:07:13,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:07:13,585 INFO L87 Difference]: Start difference. First operand 189 states and 252 transitions. Second operand 4 states. [2019-10-15 01:07:13,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:07:13,660 INFO L93 Difference]: Finished difference Result 310 states and 406 transitions. [2019-10-15 01:07:13,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:07:13,661 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2019-10-15 01:07:13,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:07:13,663 INFO L225 Difference]: With dead ends: 310 [2019-10-15 01:07:13,663 INFO L226 Difference]: Without dead ends: 248 [2019-10-15 01:07:13,664 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:07:13,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2019-10-15 01:07:13,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 211. [2019-10-15 01:07:13,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2019-10-15 01:07:13,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 282 transitions. [2019-10-15 01:07:13,712 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 282 transitions. Word has length 27 [2019-10-15 01:07:13,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:07:13,712 INFO L462 AbstractCegarLoop]: Abstraction has 211 states and 282 transitions. [2019-10-15 01:07:13,713 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:07:13,713 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 282 transitions. [2019-10-15 01:07:13,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-10-15 01:07:13,715 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:07:13,715 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-15 01:07:13,715 INFO L410 AbstractCegarLoop]: === Iteration 4 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:07:13,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:07:13,716 INFO L82 PathProgramCache]: Analyzing trace with hash 742933031, now seen corresponding path program 1 times [2019-10-15 01:07:13,716 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:07:13,716 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451097415] [2019-10-15 01:07:13,716 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:13,717 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:13,717 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:07:13,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:13,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-10-15 01:07:13,824 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451097415] [2019-10-15 01:07:13,824 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:07:13,824 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:07:13,824 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367111888] [2019-10-15 01:07:13,825 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:07:13,825 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:07:13,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:07:13,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:07:13,826 INFO L87 Difference]: Start difference. First operand 211 states and 282 transitions. Second operand 4 states. [2019-10-15 01:07:13,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:07:13,988 INFO L93 Difference]: Finished difference Result 214 states and 284 transitions. [2019-10-15 01:07:13,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:07:13,989 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2019-10-15 01:07:13,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:07:13,992 INFO L225 Difference]: With dead ends: 214 [2019-10-15 01:07:13,992 INFO L226 Difference]: Without dead ends: 211 [2019-10-15 01:07:13,995 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 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-10-15 01:07:13,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-10-15 01:07:14,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2019-10-15 01:07:14,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2019-10-15 01:07:14,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 281 transitions. [2019-10-15 01:07:14,020 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 281 transitions. Word has length 37 [2019-10-15 01:07:14,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:07:14,021 INFO L462 AbstractCegarLoop]: Abstraction has 211 states and 281 transitions. [2019-10-15 01:07:14,021 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:07:14,021 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 281 transitions. [2019-10-15 01:07:14,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-10-15 01:07:14,023 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:07:14,024 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-15 01:07:14,024 INFO L410 AbstractCegarLoop]: === Iteration 5 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:07:14,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:07:14,024 INFO L82 PathProgramCache]: Analyzing trace with hash 324263340, now seen corresponding path program 1 times [2019-10-15 01:07:14,025 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:07:14,025 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805780846] [2019-10-15 01:07:14,025 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:14,025 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:14,025 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:07:14,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:14,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:07:14,102 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805780846] [2019-10-15 01:07:14,102 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:07:14,102 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:07:14,102 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886467280] [2019-10-15 01:07:14,103 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:07:14,103 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:07:14,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:07:14,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:07:14,104 INFO L87 Difference]: Start difference. First operand 211 states and 281 transitions. Second operand 4 states. [2019-10-15 01:07:14,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:07:14,206 INFO L93 Difference]: Finished difference Result 268 states and 349 transitions. [2019-10-15 01:07:14,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:07:14,207 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2019-10-15 01:07:14,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:07:14,210 INFO L225 Difference]: With dead ends: 268 [2019-10-15 01:07:14,210 INFO L226 Difference]: Without dead ends: 202 [2019-10-15 01:07:14,210 INFO L600 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-10-15 01:07:14,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2019-10-15 01:07:14,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 184. [2019-10-15 01:07:14,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2019-10-15 01:07:14,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 243 transitions. [2019-10-15 01:07:14,233 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 243 transitions. Word has length 45 [2019-10-15 01:07:14,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:07:14,235 INFO L462 AbstractCegarLoop]: Abstraction has 184 states and 243 transitions. [2019-10-15 01:07:14,235 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:07:14,236 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 243 transitions. [2019-10-15 01:07:14,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-10-15 01:07:14,244 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:07:14,248 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-15 01:07:14,248 INFO L410 AbstractCegarLoop]: === Iteration 6 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:07:14,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:07:14,249 INFO L82 PathProgramCache]: Analyzing trace with hash 726030577, now seen corresponding path program 1 times [2019-10-15 01:07:14,249 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:07:14,250 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334415289] [2019-10-15 01:07:14,250 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:14,256 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:14,256 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:07:14,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:14,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:07:14,334 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334415289] [2019-10-15 01:07:14,335 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:07:14,335 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:07:14,335 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197285828] [2019-10-15 01:07:14,336 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:07:14,336 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:07:14,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:07:14,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:07:14,337 INFO L87 Difference]: Start difference. First operand 184 states and 243 transitions. Second operand 3 states. [2019-10-15 01:07:14,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:07:14,399 INFO L93 Difference]: Finished difference Result 243 states and 318 transitions. [2019-10-15 01:07:14,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:07:14,400 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-10-15 01:07:14,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:07:14,402 INFO L225 Difference]: With dead ends: 243 [2019-10-15 01:07:14,402 INFO L226 Difference]: Without dead ends: 182 [2019-10-15 01:07:14,403 INFO L600 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-10-15 01:07:14,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-10-15 01:07:14,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2019-10-15 01:07:14,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2019-10-15 01:07:14,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 239 transitions. [2019-10-15 01:07:14,419 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 239 transitions. Word has length 51 [2019-10-15 01:07:14,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:07:14,420 INFO L462 AbstractCegarLoop]: Abstraction has 182 states and 239 transitions. [2019-10-15 01:07:14,420 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:07:14,420 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 239 transitions. [2019-10-15 01:07:14,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-10-15 01:07:14,423 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:07:14,423 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-15 01:07:14,423 INFO L410 AbstractCegarLoop]: === Iteration 7 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:07:14,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:07:14,423 INFO L82 PathProgramCache]: Analyzing trace with hash 572107035, now seen corresponding path program 1 times [2019-10-15 01:07:14,424 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:07:14,424 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376445865] [2019-10-15 01:07:14,424 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:14,424 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:14,424 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:07:14,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:14,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:07:14,494 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376445865] [2019-10-15 01:07:14,495 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:07:14,495 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:07:14,495 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33536766] [2019-10-15 01:07:14,496 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:07:14,496 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:07:14,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:07:14,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:07:14,496 INFO L87 Difference]: Start difference. First operand 182 states and 239 transitions. Second operand 3 states. [2019-10-15 01:07:14,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:07:14,526 INFO L93 Difference]: Finished difference Result 191 states and 250 transitions. [2019-10-15 01:07:14,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:07:14,527 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-10-15 01:07:14,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:07:14,528 INFO L225 Difference]: With dead ends: 191 [2019-10-15 01:07:14,528 INFO L226 Difference]: Without dead ends: 91 [2019-10-15 01:07:14,529 INFO L600 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-10-15 01:07:14,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-10-15 01:07:14,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2019-10-15 01:07:14,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-10-15 01:07:14,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 102 transitions. [2019-10-15 01:07:14,546 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 102 transitions. Word has length 50 [2019-10-15 01:07:14,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:07:14,546 INFO L462 AbstractCegarLoop]: Abstraction has 91 states and 102 transitions. [2019-10-15 01:07:14,546 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:07:14,547 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 102 transitions. [2019-10-15 01:07:14,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-15 01:07:14,547 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:07:14,548 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-15 01:07:14,548 INFO L410 AbstractCegarLoop]: === Iteration 8 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:07:14,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:07:14,549 INFO L82 PathProgramCache]: Analyzing trace with hash -1516710605, now seen corresponding path program 1 times [2019-10-15 01:07:14,550 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:07:14,550 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138958233] [2019-10-15 01:07:14,550 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:14,550 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:14,550 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:07:14,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:14,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:07:14,640 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138958233] [2019-10-15 01:07:14,640 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:07:14,640 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:07:14,640 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014151176] [2019-10-15 01:07:14,641 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:07:14,641 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:07:14,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:07:14,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:07:14,642 INFO L87 Difference]: Start difference. First operand 91 states and 102 transitions. Second operand 6 states. [2019-10-15 01:07:14,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:07:14,694 INFO L93 Difference]: Finished difference Result 142 states and 164 transitions. [2019-10-15 01:07:14,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:07:14,694 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 59 [2019-10-15 01:07:14,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:07:14,695 INFO L225 Difference]: With dead ends: 142 [2019-10-15 01:07:14,695 INFO L226 Difference]: Without dead ends: 101 [2019-10-15 01:07:14,696 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:07:14,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-10-15 01:07:14,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 97. [2019-10-15 01:07:14,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-10-15 01:07:14,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 108 transitions. [2019-10-15 01:07:14,707 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 108 transitions. Word has length 59 [2019-10-15 01:07:14,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:07:14,708 INFO L462 AbstractCegarLoop]: Abstraction has 97 states and 108 transitions. [2019-10-15 01:07:14,708 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:07:14,708 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 108 transitions. [2019-10-15 01:07:14,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-15 01:07:14,709 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:07:14,709 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-15 01:07:14,710 INFO L410 AbstractCegarLoop]: === Iteration 9 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:07:14,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:07:14,710 INFO L82 PathProgramCache]: Analyzing trace with hash -367309916, now seen corresponding path program 1 times [2019-10-15 01:07:14,710 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:07:14,710 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032396121] [2019-10-15 01:07:14,710 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:14,711 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:14,711 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:07:14,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:14,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:07:14,812 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032396121] [2019-10-15 01:07:14,813 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:07:14,813 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:07:14,813 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15299238] [2019-10-15 01:07:14,813 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:07:14,814 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:07:14,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:07:14,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:07:14,817 INFO L87 Difference]: Start difference. First operand 97 states and 108 transitions. Second operand 6 states. [2019-10-15 01:07:14,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:07:14,868 INFO L93 Difference]: Finished difference Result 107 states and 118 transitions. [2019-10-15 01:07:14,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:07:14,869 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 59 [2019-10-15 01:07:14,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:07:14,871 INFO L225 Difference]: With dead ends: 107 [2019-10-15 01:07:14,871 INFO L226 Difference]: Without dead ends: 100 [2019-10-15 01:07:14,872 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:07:14,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-10-15 01:07:14,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 98. [2019-10-15 01:07:14,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-10-15 01:07:14,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 109 transitions. [2019-10-15 01:07:14,883 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 109 transitions. Word has length 59 [2019-10-15 01:07:14,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:07:14,884 INFO L462 AbstractCegarLoop]: Abstraction has 98 states and 109 transitions. [2019-10-15 01:07:14,884 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:07:14,884 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 109 transitions. [2019-10-15 01:07:14,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-15 01:07:14,885 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:07:14,885 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-15 01:07:14,885 INFO L410 AbstractCegarLoop]: === Iteration 10 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:07:14,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:07:14,885 INFO L82 PathProgramCache]: Analyzing trace with hash 857146700, now seen corresponding path program 1 times [2019-10-15 01:07:14,886 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:07:14,886 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237702229] [2019-10-15 01:07:14,886 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:14,886 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:14,887 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:07:14,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:14,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:07:14,942 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237702229] [2019-10-15 01:07:14,943 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:07:14,943 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:07:14,944 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260667258] [2019-10-15 01:07:14,944 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:07:14,945 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:07:14,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:07:14,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:07:14,945 INFO L87 Difference]: Start difference. First operand 98 states and 109 transitions. Second operand 3 states. [2019-10-15 01:07:14,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:07:14,970 INFO L93 Difference]: Finished difference Result 187 states and 207 transitions. [2019-10-15 01:07:14,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:07:14,971 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-10-15 01:07:14,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:07:14,973 INFO L225 Difference]: With dead ends: 187 [2019-10-15 01:07:14,973 INFO L226 Difference]: Without dead ends: 180 [2019-10-15 01:07:14,973 INFO L600 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-10-15 01:07:14,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-10-15 01:07:14,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 168. [2019-10-15 01:07:14,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-10-15 01:07:14,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 188 transitions. [2019-10-15 01:07:14,985 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 188 transitions. Word has length 60 [2019-10-15 01:07:14,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:07:14,986 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 188 transitions. [2019-10-15 01:07:14,986 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:07:14,986 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 188 transitions. [2019-10-15 01:07:14,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-15 01:07:14,987 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:07:14,987 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-15 01:07:14,987 INFO L410 AbstractCegarLoop]: === Iteration 11 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:07:14,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:07:14,987 INFO L82 PathProgramCache]: Analyzing trace with hash -1662813234, now seen corresponding path program 1 times [2019-10-15 01:07:14,988 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:07:14,988 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133088252] [2019-10-15 01:07:14,988 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:14,988 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:14,988 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:07:15,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:15,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:07:15,100 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133088252] [2019-10-15 01:07:15,100 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:07:15,100 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:07:15,101 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145976801] [2019-10-15 01:07:15,101 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:07:15,102 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:07:15,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:07:15,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:07:15,102 INFO L87 Difference]: Start difference. First operand 168 states and 188 transitions. Second operand 5 states. [2019-10-15 01:07:15,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:07:15,205 INFO L93 Difference]: Finished difference Result 216 states and 246 transitions. [2019-10-15 01:07:15,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:07:15,206 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 60 [2019-10-15 01:07:15,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:07:15,208 INFO L225 Difference]: With dead ends: 216 [2019-10-15 01:07:15,208 INFO L226 Difference]: Without dead ends: 152 [2019-10-15 01:07:15,208 INFO L600 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-10-15 01:07:15,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-10-15 01:07:15,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2019-10-15 01:07:15,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-10-15 01:07:15,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 168 transitions. [2019-10-15 01:07:15,220 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 168 transitions. Word has length 60 [2019-10-15 01:07:15,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:07:15,220 INFO L462 AbstractCegarLoop]: Abstraction has 152 states and 168 transitions. [2019-10-15 01:07:15,220 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:07:15,220 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 168 transitions. [2019-10-15 01:07:15,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-10-15 01:07:15,221 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:07:15,221 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-15 01:07:15,222 INFO L410 AbstractCegarLoop]: === Iteration 12 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:07:15,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:07:15,222 INFO L82 PathProgramCache]: Analyzing trace with hash 1935953947, now seen corresponding path program 1 times [2019-10-15 01:07:15,222 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:07:15,223 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473785619] [2019-10-15 01:07:15,223 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:15,223 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:15,223 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:07:15,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:15,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:07:15,258 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473785619] [2019-10-15 01:07:15,259 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:07:15,259 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:07:15,259 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208520724] [2019-10-15 01:07:15,259 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:07:15,259 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:07:15,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:07:15,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:07:15,260 INFO L87 Difference]: Start difference. First operand 152 states and 168 transitions. Second operand 3 states. [2019-10-15 01:07:15,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:07:15,282 INFO L93 Difference]: Finished difference Result 212 states and 240 transitions. [2019-10-15 01:07:15,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:07:15,283 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2019-10-15 01:07:15,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:07:15,284 INFO L225 Difference]: With dead ends: 212 [2019-10-15 01:07:15,284 INFO L226 Difference]: Without dead ends: 164 [2019-10-15 01:07:15,285 INFO L600 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-10-15 01:07:15,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-10-15 01:07:15,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 158. [2019-10-15 01:07:15,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-10-15 01:07:15,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 174 transitions. [2019-10-15 01:07:15,296 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 174 transitions. Word has length 62 [2019-10-15 01:07:15,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:07:15,297 INFO L462 AbstractCegarLoop]: Abstraction has 158 states and 174 transitions. [2019-10-15 01:07:15,297 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:07:15,297 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 174 transitions. [2019-10-15 01:07:15,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-10-15 01:07:15,298 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:07:15,298 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-15 01:07:15,298 INFO L410 AbstractCegarLoop]: === Iteration 13 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:07:15,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:07:15,299 INFO L82 PathProgramCache]: Analyzing trace with hash 1349147933, now seen corresponding path program 1 times [2019-10-15 01:07:15,299 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:07:15,299 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386523492] [2019-10-15 01:07:15,299 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:15,299 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:15,299 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:07:15,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:15,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:07:15,335 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386523492] [2019-10-15 01:07:15,335 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:07:15,336 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:07:15,336 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615497329] [2019-10-15 01:07:15,336 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:07:15,336 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:07:15,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:07:15,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:07:15,337 INFO L87 Difference]: Start difference. First operand 158 states and 174 transitions. Second operand 3 states. [2019-10-15 01:07:15,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:07:15,374 INFO L93 Difference]: Finished difference Result 178 states and 197 transitions. [2019-10-15 01:07:15,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:07:15,374 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2019-10-15 01:07:15,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:07:15,377 INFO L225 Difference]: With dead ends: 178 [2019-10-15 01:07:15,378 INFO L226 Difference]: Without dead ends: 173 [2019-10-15 01:07:15,378 INFO L600 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-10-15 01:07:15,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-10-15 01:07:15,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 162. [2019-10-15 01:07:15,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2019-10-15 01:07:15,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 177 transitions. [2019-10-15 01:07:15,395 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 177 transitions. Word has length 62 [2019-10-15 01:07:15,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:07:15,395 INFO L462 AbstractCegarLoop]: Abstraction has 162 states and 177 transitions. [2019-10-15 01:07:15,395 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:07:15,395 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 177 transitions. [2019-10-15 01:07:15,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-10-15 01:07:15,403 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:07:15,403 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-15 01:07:15,404 INFO L410 AbstractCegarLoop]: === Iteration 14 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:07:15,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:07:15,404 INFO L82 PathProgramCache]: Analyzing trace with hash 475938380, now seen corresponding path program 1 times [2019-10-15 01:07:15,404 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:07:15,405 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672585410] [2019-10-15 01:07:15,405 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:15,405 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:15,405 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:07:15,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:15,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:07:15,484 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672585410] [2019-10-15 01:07:15,485 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:07:15,485 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-15 01:07:15,485 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250282272] [2019-10-15 01:07:15,485 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-15 01:07:15,486 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:07:15,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-15 01:07:15,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:07:15,486 INFO L87 Difference]: Start difference. First operand 162 states and 177 transitions. Second operand 7 states. [2019-10-15 01:07:15,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:07:15,536 INFO L93 Difference]: Finished difference Result 184 states and 198 transitions. [2019-10-15 01:07:15,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:07:15,537 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 62 [2019-10-15 01:07:15,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:07:15,539 INFO L225 Difference]: With dead ends: 184 [2019-10-15 01:07:15,539 INFO L226 Difference]: Without dead ends: 162 [2019-10-15 01:07:15,540 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:07:15,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-10-15 01:07:15,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2019-10-15 01:07:15,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2019-10-15 01:07:15,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 173 transitions. [2019-10-15 01:07:15,552 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 173 transitions. Word has length 62 [2019-10-15 01:07:15,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:07:15,552 INFO L462 AbstractCegarLoop]: Abstraction has 162 states and 173 transitions. [2019-10-15 01:07:15,552 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-15 01:07:15,552 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 173 transitions. [2019-10-15 01:07:15,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-10-15 01:07:15,553 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:07:15,553 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-15 01:07:15,554 INFO L410 AbstractCegarLoop]: === Iteration 15 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:07:15,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:07:15,554 INFO L82 PathProgramCache]: Analyzing trace with hash -1363732376, now seen corresponding path program 1 times [2019-10-15 01:07:15,554 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:07:15,554 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773942208] [2019-10-15 01:07:15,555 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:15,555 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:15,555 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:07:15,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:15,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-10-15 01:07:15,750 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773942208] [2019-10-15 01:07:15,750 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:07:15,750 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-15 01:07:15,751 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23070349] [2019-10-15 01:07:15,751 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-15 01:07:15,752 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:07:15,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-15 01:07:15,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-10-15 01:07:15,753 INFO L87 Difference]: Start difference. First operand 162 states and 173 transitions. Second operand 11 states. [2019-10-15 01:07:16,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:07:16,032 INFO L93 Difference]: Finished difference Result 176 states and 186 transitions. [2019-10-15 01:07:16,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-15 01:07:16,033 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 63 [2019-10-15 01:07:16,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:07:16,034 INFO L225 Difference]: With dead ends: 176 [2019-10-15 01:07:16,034 INFO L226 Difference]: Without dead ends: 151 [2019-10-15 01:07:16,037 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2019-10-15 01:07:16,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2019-10-15 01:07:16,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 140. [2019-10-15 01:07:16,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-10-15 01:07:16,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 149 transitions. [2019-10-15 01:07:16,054 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 149 transitions. Word has length 63 [2019-10-15 01:07:16,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:07:16,054 INFO L462 AbstractCegarLoop]: Abstraction has 140 states and 149 transitions. [2019-10-15 01:07:16,054 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-15 01:07:16,054 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 149 transitions. [2019-10-15 01:07:16,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-10-15 01:07:16,055 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:07:16,055 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-15 01:07:16,056 INFO L410 AbstractCegarLoop]: === Iteration 16 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:07:16,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:07:16,057 INFO L82 PathProgramCache]: Analyzing trace with hash 359859562, now seen corresponding path program 1 times [2019-10-15 01:07:16,057 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:07:16,057 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89454376] [2019-10-15 01:07:16,057 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:16,057 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:16,057 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:07:16,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:16,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:07:16,177 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89454376] [2019-10-15 01:07:16,177 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:07:16,180 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:07:16,180 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858893588] [2019-10-15 01:07:16,181 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:07:16,181 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:07:16,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:07:16,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:07:16,181 INFO L87 Difference]: Start difference. First operand 140 states and 149 transitions. Second operand 5 states. [2019-10-15 01:07:16,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:07:16,289 INFO L93 Difference]: Finished difference Result 165 states and 176 transitions. [2019-10-15 01:07:16,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:07:16,289 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 63 [2019-10-15 01:07:16,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:07:16,291 INFO L225 Difference]: With dead ends: 165 [2019-10-15 01:07:16,291 INFO L226 Difference]: Without dead ends: 133 [2019-10-15 01:07:16,291 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:07:16,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-10-15 01:07:16,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2019-10-15 01:07:16,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-10-15 01:07:16,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 138 transitions. [2019-10-15 01:07:16,305 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 138 transitions. Word has length 63 [2019-10-15 01:07:16,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:07:16,306 INFO L462 AbstractCegarLoop]: Abstraction has 133 states and 138 transitions. [2019-10-15 01:07:16,306 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:07:16,306 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 138 transitions. [2019-10-15 01:07:16,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-10-15 01:07:16,307 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:07:16,307 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-15 01:07:16,307 INFO L410 AbstractCegarLoop]: === Iteration 17 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:07:16,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:07:16,307 INFO L82 PathProgramCache]: Analyzing trace with hash -1291919834, now seen corresponding path program 1 times [2019-10-15 01:07:16,307 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:07:16,308 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553988280] [2019-10-15 01:07:16,308 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:16,308 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:16,308 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:07:16,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:16,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:07:16,400 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553988280] [2019-10-15 01:07:16,400 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:07:16,400 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:07:16,400 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191663016] [2019-10-15 01:07:16,401 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:07:16,401 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:07:16,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:07:16,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:07:16,401 INFO L87 Difference]: Start difference. First operand 133 states and 138 transitions. Second operand 6 states. [2019-10-15 01:07:16,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:07:16,434 INFO L93 Difference]: Finished difference Result 144 states and 149 transitions. [2019-10-15 01:07:16,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:07:16,434 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 63 [2019-10-15 01:07:16,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:07:16,435 INFO L225 Difference]: With dead ends: 144 [2019-10-15 01:07:16,436 INFO L226 Difference]: Without dead ends: 133 [2019-10-15 01:07:16,436 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:07:16,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-10-15 01:07:16,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2019-10-15 01:07:16,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-10-15 01:07:16,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 136 transitions. [2019-10-15 01:07:16,447 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 136 transitions. Word has length 63 [2019-10-15 01:07:16,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:07:16,448 INFO L462 AbstractCegarLoop]: Abstraction has 133 states and 136 transitions. [2019-10-15 01:07:16,448 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:07:16,448 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 136 transitions. [2019-10-15 01:07:16,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-10-15 01:07:16,449 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:07:16,449 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-15 01:07:16,449 INFO L410 AbstractCegarLoop]: === Iteration 18 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:07:16,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:07:16,450 INFO L82 PathProgramCache]: Analyzing trace with hash 1154361885, now seen corresponding path program 1 times [2019-10-15 01:07:16,450 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:07:16,450 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515824575] [2019-10-15 01:07:16,450 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:16,450 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:16,450 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:07:16,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:16,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-10-15 01:07:16,521 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515824575] [2019-10-15 01:07:16,522 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:07:16,522 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:07:16,522 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476245563] [2019-10-15 01:07:16,523 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:07:16,523 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:07:16,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:07:16,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:07:16,523 INFO L87 Difference]: Start difference. First operand 133 states and 136 transitions. Second operand 6 states. [2019-10-15 01:07:16,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:07:16,624 INFO L93 Difference]: Finished difference Result 133 states and 136 transitions. [2019-10-15 01:07:16,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:07:16,625 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 74 [2019-10-15 01:07:16,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:07:16,625 INFO L225 Difference]: With dead ends: 133 [2019-10-15 01:07:16,625 INFO L226 Difference]: Without dead ends: 0 [2019-10-15 01:07:16,626 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:07:16,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-15 01:07:16,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-15 01:07:16,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-15 01:07:16,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-15 01:07:16,627 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 74 [2019-10-15 01:07:16,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:07:16,627 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-15 01:07:16,627 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:07:16,627 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-15 01:07:16,627 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-15 01:07:16,632 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-15 01:07:16,919 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 40 [2019-10-15 01:07:17,027 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 41 [2019-10-15 01:07:17,252 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 43 [2019-10-15 01:07:17,551 WARN L191 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 52 [2019-10-15 01:07:17,758 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 47 [2019-10-15 01:07:17,894 WARN L191 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 40 [2019-10-15 01:07:18,085 WARN L191 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 53 [2019-10-15 01:07:18,308 WARN L191 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 48 [2019-10-15 01:07:18,618 WARN L191 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 60 [2019-10-15 01:07:18,824 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 43 [2019-10-15 01:07:18,935 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 40 [2019-10-15 01:07:19,061 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 40 [2019-10-15 01:07:19,235 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 45 [2019-10-15 01:07:19,380 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 40 [2019-10-15 01:07:19,507 WARN L191 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 45 [2019-10-15 01:07:19,717 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 40 [2019-10-15 01:07:19,902 WARN L191 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 51 [2019-10-15 01:07:20,017 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 40 [2019-10-15 01:07:20,201 WARN L191 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2019-10-15 01:07:20,614 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 39 [2019-10-15 01:07:20,845 WARN L191 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 44 [2019-10-15 01:07:20,957 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 43 [2019-10-15 01:07:21,380 WARN L191 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 47 [2019-10-15 01:07:21,494 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 45 [2019-10-15 01:07:21,562 INFO L446 ceAbstractionStarter]: At program point KeSetEventENTRY(lines 514 521) the Hoare annotation is: true [2019-10-15 01:07:21,563 INFO L443 ceAbstractionStarter]: For program point KeSetEventFINAL(lines 514 521) no Hoare annotation was computed. [2019-10-15 01:07:21,563 INFO L443 ceAbstractionStarter]: For program point KeSetEventEXIT(lines 514 521) no Hoare annotation was computed. [2019-10-15 01:07:21,563 INFO L446 ceAbstractionStarter]: At program point KbFilter_CompleteENTRY(lines 564 574) the Hoare annotation is: true [2019-10-15 01:07:21,563 INFO L446 ceAbstractionStarter]: At program point L570(line 570) the Hoare annotation is: true [2019-10-15 01:07:21,563 INFO L443 ceAbstractionStarter]: For program point L570-1(line 570) no Hoare annotation was computed. [2019-10-15 01:07:21,563 INFO L443 ceAbstractionStarter]: For program point KbFilter_CompleteFINAL(lines 564 574) no Hoare annotation was computed. [2019-10-15 01:07:21,564 INFO L443 ceAbstractionStarter]: For program point KbFilter_CompleteEXIT(lines 564 574) no Hoare annotation was computed. [2019-10-15 01:07:21,564 INFO L443 ceAbstractionStarter]: For program point stub_driver_initEXIT(lines 36 49) no Hoare annotation was computed. [2019-10-15 01:07:21,564 INFO L439 ceAbstractionStarter]: At program point stub_driver_initENTRY(lines 36 49) the Hoare annotation is: (or (not (<= 0 |old(~compRegistered~0)|)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= ~SKIP1~0 3)) (= 1 |old(~pended~0)|) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~NP~0 1)) (not (<= 3 ~SKIP1~0)) (not (<= |old(~compRegistered~0)| 0)) (and (<= 0 ~compRegistered~0) (<= 1 ~s~0) (not (= 1 ~pended~0)) (<= ~s~0 1) (<= ~compRegistered~0 0)) (not (<= |old(~s~0)| ~NP~0)) (not (<= 1 |old(~s~0)|))) [2019-10-15 01:07:21,564 INFO L443 ceAbstractionStarter]: For program point stub_driver_initFINAL(lines 36 49) no Hoare annotation was computed. [2019-10-15 01:07:21,564 INFO L443 ceAbstractionStarter]: For program point _BLAST_initFINAL(lines 50 71) no Hoare annotation was computed. [2019-10-15 01:07:21,564 INFO L439 ceAbstractionStarter]: At program point _BLAST_initENTRY(lines 50 71) the Hoare annotation is: (or (not (<= 0 |old(~compRegistered~0)|)) (= 1 |old(~pended~0)|) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (<= |old(~MPR3~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (<= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (and (= ~s~0 ~MPR1~0) (= ~s~0 ~NP~0) (<= 0 ~compRegistered~0) (<= ~MPR3~0 0) (not (= 1 ~pended~0)) (= ~MPR3~0 ~s~0) (<= 0 ~MPR3~0) (<= ~compRegistered~0 0) (= ~SKIP1~0 ~s~0)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (<= 0 |old(~MPR3~0)|))) [2019-10-15 01:07:21,565 INFO L443 ceAbstractionStarter]: For program point _BLAST_initEXIT(lines 50 71) no Hoare annotation was computed. [2019-10-15 01:07:21,565 INFO L446 ceAbstractionStarter]: At program point errorFnENTRY(lines 576 583) the Hoare annotation is: true [2019-10-15 01:07:21,565 INFO L443 ceAbstractionStarter]: For program point errorFnFINAL(lines 576 583) no Hoare annotation was computed. [2019-10-15 01:07:21,565 INFO L443 ceAbstractionStarter]: For program point errorFnEXIT(lines 576 583) no Hoare annotation was computed. [2019-10-15 01:07:21,565 INFO L443 ceAbstractionStarter]: For program point errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION(line 580) no Hoare annotation was computed. [2019-10-15 01:07:21,565 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 287 421) no Hoare annotation was computed. [2019-10-15 01:07:21,566 INFO L439 ceAbstractionStarter]: At program point L399(line 399) the Hoare annotation is: (or (not (<= 0 |old(~compRegistered~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (= 1 |old(~pended~0)|) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (<= |old(~MPR3~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (<= 0 |old(~MPR3~0)|)) (not (<= |old(~compRegistered~0)| 0))) [2019-10-15 01:07:21,566 INFO L443 ceAbstractionStarter]: For program point L358(line 358) no Hoare annotation was computed. [2019-10-15 01:07:21,566 INFO L439 ceAbstractionStarter]: At program point L383(lines 376 416) the Hoare annotation is: (or (not (<= 0 |old(~compRegistered~0)|)) (= 1 |old(~pended~0)|) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (<= |old(~MPR3~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (<= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (and (not (= 1 ~pended~0)) (and (<= ~SKIP1~0 3) (<= 3 ~SKIP1~0))) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (<= 0 |old(~MPR3~0)|))) [2019-10-15 01:07:21,568 INFO L443 ceAbstractionStarter]: For program point L408(lines 408 410) no Hoare annotation was computed. [2019-10-15 01:07:21,569 INFO L439 ceAbstractionStarter]: At program point L375(lines 368 417) the Hoare annotation is: (or (not (<= 0 |old(~compRegistered~0)|)) (= 1 |old(~pended~0)|) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (<= |old(~MPR3~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (<= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (and (not (= 1 ~pended~0)) (and (<= ~SKIP1~0 3) (<= 3 ~SKIP1~0))) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (<= 0 |old(~MPR3~0)|))) [2019-10-15 01:07:21,569 INFO L443 ceAbstractionStarter]: For program point L384(lines 368 417) no Hoare annotation was computed. [2019-10-15 01:07:21,569 INFO L443 ceAbstractionStarter]: For program point L351(lines 351 366) no Hoare annotation was computed. [2019-10-15 01:07:21,569 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 287 421) no Hoare annotation was computed. [2019-10-15 01:07:21,569 INFO L443 ceAbstractionStarter]: For program point L385(lines 385 414) no Hoare annotation was computed. [2019-10-15 01:07:21,570 INFO L439 ceAbstractionStarter]: At program point L352(lines 351 366) the Hoare annotation is: (or (not (<= 0 |old(~compRegistered~0)|)) (and (<= 0 ~compRegistered~0) (<= 1 ~s~0) (<= (+ ~NP~0 4) ~MPR1~0) (<= ~s~0 ~NP~0) (not (= 1 ~pended~0)) (<= (+ ~NP~0 5) ~MPR3~0) (<= 0 main_~status~1) (<= ~NP~0 1) (<= ~SKIP1~0 3) (<= 3 ~SKIP1~0) (<= ~compRegistered~0 0)) (= 1 |old(~pended~0)|) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (<= |old(~MPR3~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (<= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (<= 0 |old(~MPR3~0)|))) [2019-10-15 01:07:21,570 INFO L439 ceAbstractionStarter]: At program point mainENTRY(lines 287 421) the Hoare annotation is: (or (not (<= 0 |old(~compRegistered~0)|)) (= 1 |old(~pended~0)|) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (<= |old(~MPR3~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (<= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (and (= ~s~0 ~MPR1~0) (= ~s~0 ~NP~0) (<= 0 ~compRegistered~0) (<= ~MPR3~0 0) (not (= 1 ~pended~0)) (= ~MPR3~0 ~s~0) (<= 0 ~MPR3~0) (<= ~compRegistered~0 0) (= ~SKIP1~0 ~s~0)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (<= 0 |old(~MPR3~0)|))) [2019-10-15 01:07:21,570 INFO L443 ceAbstractionStarter]: For program point L377(lines 377 381) no Hoare annotation was computed. [2019-10-15 01:07:21,570 INFO L443 ceAbstractionStarter]: For program point L369(lines 369 373) no Hoare annotation was computed. [2019-10-15 01:07:21,570 INFO L443 ceAbstractionStarter]: For program point L336(lines 322 367) no Hoare annotation was computed. [2019-10-15 01:07:21,570 INFO L443 ceAbstractionStarter]: For program point L386(lines 386 413) no Hoare annotation was computed. [2019-10-15 01:07:21,571 INFO L439 ceAbstractionStarter]: At program point L320(line 320) the Hoare annotation is: (or (and (= ~s~0 ~MPR1~0) (= ~s~0 ~NP~0) (<= 0 ~compRegistered~0) (<= ~MPR3~0 0) (not (= 1 ~pended~0)) (<= 0 main_~status~1) (= ~MPR3~0 ~s~0) (<= 0 ~MPR3~0) (<= ~compRegistered~0 0) (= ~SKIP1~0 ~s~0)) (not (<= 0 |old(~compRegistered~0)|)) (= 1 |old(~pended~0)|) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (<= |old(~MPR3~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (<= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (<= 0 |old(~MPR3~0)|))) [2019-10-15 01:07:21,571 INFO L443 ceAbstractionStarter]: For program point L320-1(lines 296 420) no Hoare annotation was computed. [2019-10-15 01:07:21,571 INFO L443 ceAbstractionStarter]: For program point L403(lines 403 411) no Hoare annotation was computed. [2019-10-15 01:07:21,571 INFO L439 ceAbstractionStarter]: At program point L395(lines 386 413) the Hoare annotation is: (or (not (<= 0 |old(~compRegistered~0)|)) (= 1 |old(~pended~0)|) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (<= |old(~MPR3~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (<= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (and (not (= 1 ~pended~0)) (and (<= ~SKIP1~0 3) (<= 3 ~SKIP1~0))) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (<= 0 |old(~MPR3~0)|))) [2019-10-15 01:07:21,571 INFO L443 ceAbstractionStarter]: For program point L387(lines 387 393) no Hoare annotation was computed. [2019-10-15 01:07:21,571 INFO L439 ceAbstractionStarter]: At program point L354(lines 353 366) the Hoare annotation is: (or (not (<= 0 |old(~compRegistered~0)|)) (= 1 |old(~pended~0)|) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (<= |old(~MPR3~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (<= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (<= 0 main_~status~1) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (<= 0 |old(~MPR3~0)|))) [2019-10-15 01:07:21,572 INFO L443 ceAbstractionStarter]: For program point L404(lines 404 406) no Hoare annotation was computed. [2019-10-15 01:07:21,572 INFO L443 ceAbstractionStarter]: For program point L388(lines 388 390) no Hoare annotation was computed. [2019-10-15 01:07:21,572 INFO L439 ceAbstractionStarter]: At program point L322(lines 296 420) the Hoare annotation is: (or (not (<= 0 |old(~compRegistered~0)|)) (= 1 |old(~pended~0)|) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (<= |old(~MPR3~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (<= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (and (not (= 1 ~pended~0)) (and (<= ~SKIP1~0 3) (<= 3 ~SKIP1~0))) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (<= 0 |old(~MPR3~0)|))) [2019-10-15 01:07:21,572 INFO L443 ceAbstractionStarter]: For program point L339-1(lines 338 348) no Hoare annotation was computed. [2019-10-15 01:07:21,572 INFO L443 ceAbstractionStarter]: For program point L397(lines 397 401) no Hoare annotation was computed. [2019-10-15 01:07:21,572 INFO L443 ceAbstractionStarter]: For program point L331(lines 331 334) no Hoare annotation was computed. [2019-10-15 01:07:21,573 INFO L439 ceAbstractionStarter]: At program point L331-2(lines 331 334) the Hoare annotation is: (or (not (<= 0 |old(~compRegistered~0)|)) (and (<= 0 ~compRegistered~0) (<= 1 ~s~0) (<= (+ ~NP~0 4) ~MPR1~0) (<= ~s~0 ~NP~0) (not (= 1 ~pended~0)) (<= (+ ~NP~0 5) ~MPR3~0) (<= 0 main_~status~1) (<= ~NP~0 1) (<= ~SKIP1~0 3) (<= 3 ~SKIP1~0) (<= ~compRegistered~0 0)) (= 1 |old(~pended~0)|) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (<= |old(~MPR3~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (<= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (<= 0 |old(~MPR3~0)|))) [2019-10-15 01:07:21,573 INFO L443 ceAbstractionStarter]: For program point L444(lines 444 447) no Hoare annotation was computed. [2019-10-15 01:07:21,573 INFO L443 ceAbstractionStarter]: For program point L444-1(lines 444 447) no Hoare annotation was computed. [2019-10-15 01:07:21,573 INFO L443 ceAbstractionStarter]: For program point L478(lines 478 495) no Hoare annotation was computed. [2019-10-15 01:07:21,574 INFO L439 ceAbstractionStarter]: At program point L445(line 445) the Hoare annotation is: (let ((.cse0 (not (<= ~SKIP1~0 3))) (.cse1 (= 1 ~pended~0)) (.cse2 (not (<= 3 ~SKIP1~0)))) (and (or (not (<= 0 ~compRegistered~0)) .cse0 .cse1 (not (= ~SKIP1~0 |old(~s~0)|)) .cse2 (not (<= ~compRegistered~0 0))) (or (not (<= (+ ~NP~0 5) ~MPR3~0)) .cse0 .cse1 (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~NP~0 1)) .cse2 (and (<= 1 ~s~0) (<= ~s~0 1)) (not (<= 1 ~compRegistered~0)) (not (<= |old(~s~0)| ~NP~0)) (not (<= 1 |old(~s~0)|))))) [2019-10-15 01:07:21,574 INFO L443 ceAbstractionStarter]: For program point L445-1(line 445) no Hoare annotation was computed. [2019-10-15 01:07:21,574 INFO L439 ceAbstractionStarter]: At program point L470(lines 443 498) the Hoare annotation is: (let ((.cse0 (not (<= ~SKIP1~0 3))) (.cse1 (= 1 ~pended~0)) (.cse2 (not (<= 3 ~SKIP1~0)))) (and (let ((.cse3 (= ~s~0 ~MPR1~0))) (or (not (<= (+ ~NP~0 5) ~MPR3~0)) .cse0 .cse1 (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~NP~0 1)) .cse2 (and .cse3 (= 259 IofCallDriver_~returnVal2~0) (<= 1 ~setEventCalled~0) (<= ~setEventCalled~0 1)) (and .cse3 (= 0 IofCallDriver_~returnVal2~0)) (and .cse3 (<= (+ IofCallDriver_~returnVal2~0 1073741823) 0)) (not (<= 1 ~compRegistered~0)) (not (<= |old(~s~0)| ~NP~0)) (not (<= 1 |old(~s~0)|)))) (or (not (<= 0 ~compRegistered~0)) (= ~SKIP1~0 ~s~0) .cse0 .cse1 (not (= ~SKIP1~0 |old(~s~0)|)) .cse2 (not (<= ~compRegistered~0 0))))) [2019-10-15 01:07:21,574 INFO L439 ceAbstractionStarter]: At program point IofCallDriverENTRY(lines 436 499) the Hoare annotation is: (let ((.cse0 (not (<= ~SKIP1~0 3))) (.cse1 (= 1 ~pended~0)) (.cse2 (not (<= 3 ~SKIP1~0)))) (and (or (not (<= (+ ~NP~0 5) ~MPR3~0)) .cse0 .cse1 (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~NP~0 1)) .cse2 (and (<= 1 ~s~0) (<= ~s~0 1)) (not (<= 1 ~compRegistered~0)) (not (<= |old(~s~0)| ~NP~0)) (not (<= 1 |old(~s~0)|))) (or (not (<= 0 ~compRegistered~0)) (= ~SKIP1~0 ~s~0) .cse0 .cse1 (not (= ~SKIP1~0 |old(~s~0)|)) .cse2 (not (<= ~compRegistered~0 0))))) [2019-10-15 01:07:21,575 INFO L439 ceAbstractionStarter]: At program point L458(lines 457 472) the Hoare annotation is: (let ((.cse0 (not (<= ~SKIP1~0 3))) (.cse1 (= 1 ~pended~0)) (.cse2 (not (<= 3 ~SKIP1~0)))) (and (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (and (= ~s~0 ~MPR1~0) (<= 1 ~setEventCalled~0) (<= ~setEventCalled~0 1)) .cse0 .cse1 (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~NP~0 1)) .cse2 (not (<= 1 ~compRegistered~0)) (not (<= |old(~s~0)| ~NP~0)) (not (<= 1 |old(~s~0)|))) (or (not (<= 0 ~compRegistered~0)) (= ~SKIP1~0 ~s~0) .cse0 .cse1 (not (= ~SKIP1~0 |old(~s~0)|)) .cse2 (not (<= ~compRegistered~0 0))))) [2019-10-15 01:07:21,575 INFO L443 ceAbstractionStarter]: For program point L487(lines 487 494) no Hoare annotation was computed. [2019-10-15 01:07:21,575 INFO L443 ceAbstractionStarter]: For program point L450(lines 450 473) no Hoare annotation was computed. [2019-10-15 01:07:21,575 INFO L443 ceAbstractionStarter]: For program point IofCallDriverFINAL(lines 436 499) no Hoare annotation was computed. [2019-10-15 01:07:21,575 INFO L443 ceAbstractionStarter]: For program point L479(lines 479 485) no Hoare annotation was computed. [2019-10-15 01:07:21,575 INFO L439 ceAbstractionStarter]: At program point L446(line 446) the Hoare annotation is: (let ((.cse0 (not (<= ~SKIP1~0 3))) (.cse1 (= 1 ~pended~0)) (.cse2 (not (<= 3 ~SKIP1~0)))) (and (or (not (<= 0 ~compRegistered~0)) .cse0 .cse1 (not (= ~SKIP1~0 |old(~s~0)|)) .cse2 (not (<= ~compRegistered~0 0))) (or (not (<= (+ ~NP~0 5) ~MPR3~0)) .cse0 .cse1 (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~NP~0 1)) .cse2 (and (<= 1 ~s~0) (<= ~s~0 1) (<= 1 ~setEventCalled~0) (<= ~setEventCalled~0 1)) (not (<= 1 ~compRegistered~0)) (not (<= |old(~s~0)| ~NP~0)) (not (<= 1 |old(~s~0)|))))) [2019-10-15 01:07:21,575 INFO L443 ceAbstractionStarter]: For program point IofCallDriverEXIT(lines 436 499) no Hoare annotation was computed. [2019-10-15 01:07:21,576 INFO L439 ceAbstractionStarter]: At program point L492(line 492) the Hoare annotation is: (let ((.cse0 (not (<= ~SKIP1~0 3))) (.cse1 (= 1 ~pended~0)) (.cse2 (not (<= 3 ~SKIP1~0)))) (and (or (not (<= (+ ~NP~0 5) ~MPR3~0)) .cse0 .cse1 (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= 1 ~compRegistered~0)) (not (<= |old(~s~0)| ~NP~0)) (not (<= ~NP~0 1)) .cse2 (not (<= 1 |old(~s~0)|))) (or (not (<= 0 ~compRegistered~0)) .cse0 .cse1 (not (= ~SKIP1~0 |old(~s~0)|)) .cse2 (not (<= ~compRegistered~0 0))))) [2019-10-15 01:07:21,576 INFO L443 ceAbstractionStarter]: For program point L492-1(lines 474 496) no Hoare annotation was computed. [2019-10-15 01:07:21,576 INFO L443 ceAbstractionStarter]: For program point L455(lines 455 472) no Hoare annotation was computed. [2019-10-15 01:07:21,576 INFO L439 ceAbstractionStarter]: At program point L451(lines 450 473) the Hoare annotation is: (let ((.cse0 (not (<= ~SKIP1~0 3))) (.cse1 (= 1 ~pended~0)) (.cse2 (not (<= 3 ~SKIP1~0)))) (and (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (= ~s~0 ~MPR1~0) .cse0 .cse1 (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~NP~0 1)) .cse2 (not (<= 1 ~compRegistered~0)) (not (<= |old(~s~0)| ~NP~0)) (not (<= 1 |old(~s~0)|))) (or (not (<= 0 ~compRegistered~0)) (= ~SKIP1~0 ~s~0) .cse0 .cse1 (not (= ~SKIP1~0 |old(~s~0)|)) .cse2 (not (<= ~compRegistered~0 0))))) [2019-10-15 01:07:21,576 INFO L439 ceAbstractionStarter]: At program point L456(lines 455 472) the Hoare annotation is: (let ((.cse0 (not (<= ~SKIP1~0 3))) (.cse1 (= 1 ~pended~0)) (.cse2 (not (<= 3 ~SKIP1~0)))) (and (or (not (<= (+ ~NP~0 5) ~MPR3~0)) .cse0 .cse1 (not (<= (+ ~NP~0 4) ~MPR1~0)) (= ~s~0 ~MPR1~0) (not (<= ~NP~0 1)) .cse2 (not (<= 1 ~compRegistered~0)) (not (<= |old(~s~0)| ~NP~0)) (not (<= 1 |old(~s~0)|))) (or (not (<= 0 ~compRegistered~0)) (= ~SKIP1~0 ~s~0) .cse0 .cse1 (not (= ~SKIP1~0 |old(~s~0)|)) .cse2 (not (<= ~compRegistered~0 0))))) [2019-10-15 01:07:21,576 INFO L439 ceAbstractionStarter]: At program point L430(line 430) the Hoare annotation is: (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= ~SKIP1~0 3)) (= 1 ~pended~0) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~NP~0 1)) (not (<= 3 ~SKIP1~0)) (not (<= 1 ~setEventCalled~0)) (not (<= 1 ~compRegistered~0)) (not (<= |old(~s~0)| ~NP~0)) (not (<= 1 |old(~s~0)|)) (not (<= ~setEventCalled~0 1))) [2019-10-15 01:07:21,577 INFO L443 ceAbstractionStarter]: For program point L430-1(lines 422 435) no Hoare annotation was computed. [2019-10-15 01:07:21,577 INFO L439 ceAbstractionStarter]: At program point stubMoreProcessingRequiredENTRY(lines 422 435) the Hoare annotation is: (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= ~SKIP1~0 3)) (= 1 ~pended~0) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~NP~0 1)) (not (<= 3 ~SKIP1~0)) (and (<= 1 ~s~0) (<= ~s~0 1)) (not (<= 1 ~setEventCalled~0)) (not (<= 1 ~compRegistered~0)) (not (<= |old(~s~0)| ~NP~0)) (not (<= 1 |old(~s~0)|)) (not (<= ~setEventCalled~0 1))) [2019-10-15 01:07:21,577 INFO L443 ceAbstractionStarter]: For program point stubMoreProcessingRequiredEXIT(lines 422 435) no Hoare annotation was computed. [2019-10-15 01:07:21,577 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2019-10-15 01:07:21,577 INFO L439 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (= ~s~0 |old(~s~0)|) [2019-10-15 01:07:21,577 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-15 01:07:21,577 INFO L443 ceAbstractionStarter]: For program point KeWaitForSingleObjectEXIT(lines 522 563) no Hoare annotation was computed. [2019-10-15 01:07:21,578 INFO L439 ceAbstractionStarter]: At program point L535(lines 527 546) the Hoare annotation is: (let ((.cse0 (not (<= (+ ~NP~0 5) ~MPR3~0))) (.cse1 (not (<= ~SKIP1~0 3))) (.cse2 (= 1 ~pended~0)) (.cse5 (not (<= (+ ~NP~0 4) ~MPR1~0))) (.cse3 (not (<= 1 ~compRegistered~0))) (.cse4 (not (<= 3 ~SKIP1~0)))) (and (or .cse0 (= ~s~0 ~NP~0) (or (not (= |old(~s~0)| ~NP~0)) .cse1 .cse2 .cse3 .cse4) .cse5) (or .cse0 (not (<= 1 |old(~setEventCalled~0)|)) (not (<= 1 ~NP~0)) .cse1 .cse2 .cse5 (not (= |old(~s~0)| ~MPR3~0)) .cse3 (not (<= ~NP~0 1)) .cse4 (not (<= |old(~setEventCalled~0)| 1))))) [2019-10-15 01:07:21,578 INFO L443 ceAbstractionStarter]: For program point L527(lines 527 546) no Hoare annotation was computed. [2019-10-15 01:07:21,578 INFO L439 ceAbstractionStarter]: At program point L552(lines 551 561) the Hoare annotation is: (let ((.cse2 (= 1 ~pended~0)) (.cse9 (<= 3 ~SKIP1~0)) (.cse7 (<= 1 ~compRegistered~0)) (.cse8 (<= ~SKIP1~0 3))) (let ((.cse0 (not (<= (+ ~NP~0 5) ~MPR3~0))) (.cse1 (not .cse8)) (.cse4 (not .cse7)) (.cse6 (not .cse9)) (.cse3 (not (<= (+ ~NP~0 4) ~MPR1~0))) (.cse5 (and (not .cse2) (= ~s~0 ~NP~0) .cse7 .cse8 .cse9))) (and (or .cse0 (not (<= 1 |old(~setEventCalled~0)|)) (not (<= 1 ~NP~0)) .cse1 .cse2 .cse3 (not (= |old(~s~0)| ~MPR3~0)) .cse4 (not (<= ~NP~0 1)) .cse5 .cse6 (not (<= |old(~setEventCalled~0)| 1))) (or .cse0 (or (not (= |old(~s~0)| ~NP~0)) .cse1 .cse2 .cse4 .cse6) .cse3 .cse5)))) [2019-10-15 01:07:21,578 INFO L439 ceAbstractionStarter]: At program point L550(lines 549 561) the Hoare annotation is: (let ((.cse2 (= 1 ~pended~0)) (.cse9 (<= 3 ~SKIP1~0)) (.cse7 (<= 1 ~compRegistered~0)) (.cse8 (<= ~SKIP1~0 3))) (let ((.cse0 (not (<= (+ ~NP~0 5) ~MPR3~0))) (.cse1 (not .cse8)) (.cse4 (not .cse7)) (.cse6 (not .cse9)) (.cse3 (not (<= (+ ~NP~0 4) ~MPR1~0))) (.cse5 (and (not .cse2) (= ~s~0 ~NP~0) .cse7 .cse8 .cse9))) (and (or .cse0 (not (<= 1 |old(~setEventCalled~0)|)) (not (<= 1 ~NP~0)) .cse1 .cse2 .cse3 (not (= |old(~s~0)| ~MPR3~0)) .cse4 (not (<= ~NP~0 1)) .cse5 .cse6 (not (<= |old(~setEventCalled~0)| 1))) (or .cse0 (or (not (= |old(~s~0)| ~NP~0)) .cse1 .cse2 .cse4 .cse6) .cse3 .cse5)))) [2019-10-15 01:07:21,578 INFO L439 ceAbstractionStarter]: At program point L542(line 542) the Hoare annotation is: (let ((.cse0 (not (<= (+ ~NP~0 5) ~MPR3~0))) (.cse1 (not (<= ~SKIP1~0 3))) (.cse2 (= 1 ~pended~0)) (.cse5 (not (<= (+ ~NP~0 4) ~MPR1~0))) (.cse3 (not (<= 1 ~compRegistered~0))) (.cse4 (not (<= 3 ~SKIP1~0)))) (and (or .cse0 (or (not (= |old(~s~0)| ~NP~0)) .cse1 .cse2 .cse3 .cse4) .cse5) (or .cse0 (not (<= 1 |old(~setEventCalled~0)|)) (not (<= 1 ~NP~0)) .cse1 .cse2 .cse5 (not (= |old(~s~0)| ~MPR3~0)) .cse3 (not (<= ~NP~0 1)) .cse4 (not (<= |old(~setEventCalled~0)| 1))))) [2019-10-15 01:07:21,578 INFO L443 ceAbstractionStarter]: For program point KeWaitForSingleObjectFINAL(lines 522 563) no Hoare annotation was computed. [2019-10-15 01:07:21,579 INFO L443 ceAbstractionStarter]: For program point L540(lines 540 544) no Hoare annotation was computed. [2019-10-15 01:07:21,579 INFO L443 ceAbstractionStarter]: For program point L540-1(lines 527 546) no Hoare annotation was computed. [2019-10-15 01:07:21,579 INFO L443 ceAbstractionStarter]: For program point L528(lines 528 533) no Hoare annotation was computed. [2019-10-15 01:07:21,579 INFO L439 ceAbstractionStarter]: At program point KeWaitForSingleObjectENTRY(lines 522 563) the Hoare annotation is: (let ((.cse0 (not (<= (+ ~NP~0 5) ~MPR3~0))) (.cse1 (not (<= ~SKIP1~0 3))) (.cse2 (= 1 ~pended~0)) (.cse5 (not (<= (+ ~NP~0 4) ~MPR1~0))) (.cse3 (not (<= 1 ~compRegistered~0))) (.cse4 (not (<= 3 ~SKIP1~0)))) (and (or .cse0 (= ~s~0 ~NP~0) (or (not (= |old(~s~0)| ~NP~0)) .cse1 .cse2 .cse3 .cse4) .cse5) (or .cse0 (not (<= 1 |old(~setEventCalled~0)|)) (not (<= 1 ~NP~0)) (and (= ~MPR3~0 ~s~0) (<= 1 ~setEventCalled~0) (<= ~setEventCalled~0 1)) .cse1 .cse2 .cse5 (not (= |old(~s~0)| ~MPR3~0)) .cse3 (not (<= ~NP~0 1)) .cse4 (not (<= |old(~setEventCalled~0)| 1))))) [2019-10-15 01:07:21,579 INFO L443 ceAbstractionStarter]: For program point L549(lines 549 561) no Hoare annotation was computed. [2019-10-15 01:07:21,580 INFO L439 ceAbstractionStarter]: At program point L508(line 508) the Hoare annotation is: (or (not (= |old(~s~0)| ~NP~0)) (not (<= ~SKIP1~0 3)) (= 1 ~pended~0) (not (<= 1 ~compRegistered~0)) (not (<= 3 ~SKIP1~0))) [2019-10-15 01:07:21,580 INFO L443 ceAbstractionStarter]: For program point L508-1(lines 500 513) no Hoare annotation was computed. [2019-10-15 01:07:21,580 INFO L439 ceAbstractionStarter]: At program point IofCompleteRequestENTRY(lines 500 513) the Hoare annotation is: (or (not (= |old(~s~0)| ~NP~0)) (not (<= ~SKIP1~0 3)) (= 1 ~pended~0) (= ~s~0 ~NP~0) (not (<= 1 ~compRegistered~0)) (not (<= 3 ~SKIP1~0))) [2019-10-15 01:07:21,580 INFO L443 ceAbstractionStarter]: For program point L504(lines 504 510) no Hoare annotation was computed. [2019-10-15 01:07:21,581 INFO L443 ceAbstractionStarter]: For program point IofCompleteRequestEXIT(lines 500 513) no Hoare annotation was computed. [2019-10-15 01:07:21,581 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-15 01:07:21,581 INFO L439 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= ~s~0 ~MPR1~0) (not (= 1 ~pended~0)) (= ~s~0 ~NP~0) (<= 0 ~compRegistered~0) (= ~MPR3~0 ~s~0) (<= ~MPR3~0 0) (<= 0 ~MPR3~0) (<= ~compRegistered~0 0) (= ~SKIP1~0 ~s~0)) [2019-10-15 01:07:21,581 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-15 01:07:21,581 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-15 01:07:21,581 INFO L439 ceAbstractionStarter]: At program point L225(lines 225 226) the Hoare annotation is: (or (not (<= 0 |old(~compRegistered~0)|)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= ~SKIP1~0 3)) (= 1 ~pended~0) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~NP~0 1)) (not (<= 3 ~SKIP1~0)) (not (<= |old(~compRegistered~0)| 0)) (and (<= 0 ~compRegistered~0) (<= ~compRegistered~0 0) (= ~SKIP1~0 ~s~0)) (not (<= |old(~s~0)| ~NP~0)) (not (<= 1 |old(~s~0)|))) [2019-10-15 01:07:21,581 INFO L443 ceAbstractionStarter]: For program point L225-1(lines 225 226) no Hoare annotation was computed. [2019-10-15 01:07:21,581 INFO L439 ceAbstractionStarter]: At program point L250(line 250) the Hoare annotation is: (or (not (<= 0 |old(~compRegistered~0)|)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= ~SKIP1~0 3)) (= 1 ~pended~0) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~NP~0 1)) (not (<= 3 ~SKIP1~0)) (not (<= |old(~compRegistered~0)| 0)) (not (<= |old(~s~0)| ~NP~0)) (not (<= 1 |old(~s~0)|))) [2019-10-15 01:07:21,582 INFO L443 ceAbstractionStarter]: For program point L250-1(lines 246 252) no Hoare annotation was computed. [2019-10-15 01:07:21,582 INFO L443 ceAbstractionStarter]: For program point L143(lines 143 269) no Hoare annotation was computed. [2019-10-15 01:07:21,582 INFO L443 ceAbstractionStarter]: For program point L110(lines 110 280) no Hoare annotation was computed. [2019-10-15 01:07:21,582 INFO L439 ceAbstractionStarter]: At program point L102(lines 101 283) the Hoare annotation is: (let ((.cse0 (not (<= 0 |old(~compRegistered~0)|))) (.cse1 (not (<= (+ ~NP~0 5) ~MPR3~0))) (.cse2 (not (<= ~SKIP1~0 3))) (.cse3 (= 1 ~pended~0)) (.cse4 (not (<= (+ ~NP~0 4) ~MPR1~0))) (.cse5 (not (<= ~NP~0 1))) (.cse6 (not (<= 3 ~SKIP1~0))) (.cse7 (not (<= |old(~compRegistered~0)| 0))) (.cse8 (not (<= |old(~s~0)| ~NP~0))) (.cse9 (not (<= 1 |old(~s~0)|)))) (and (or .cse0 .cse1 (not (<= (+ |old(~myStatus~0)| 1073741637) 0)) (<= (+ ~myStatus~0 1073741637) 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (and (<= 0 ~compRegistered~0) (<= 1 ~s~0) (<= 0 KbFilter_PnP_~status~0) (<= ~s~0 1) (<= ~compRegistered~0 0)) .cse8 .cse9))) [2019-10-15 01:07:21,582 INFO L439 ceAbstractionStarter]: At program point L193(lines 193 195) the Hoare annotation is: (let ((.cse5 (<= 1 ~compRegistered~0)) (.cse12 (<= (+ ~NP~0 5) ~MPR3~0))) (let ((.cse0 (not (<= 0 |old(~compRegistered~0)|))) (.cse1 (not .cse12)) (.cse2 (and (= ~s~0 ~NP~0) .cse12 .cse5)) (.cse3 (not (<= ~SKIP1~0 3))) (.cse4 (= 1 ~pended~0)) (.cse6 (not (<= (+ ~NP~0 4) ~MPR1~0))) (.cse7 (not (<= ~NP~0 1))) (.cse8 (not (<= 3 ~SKIP1~0))) (.cse9 (not (<= |old(~compRegistered~0)| 0))) (.cse10 (not (<= |old(~s~0)| ~NP~0))) (.cse11 (not (<= 1 |old(~s~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (and (<= 259 KbFilter_PnP_~__cil_tmp23~0) .cse5 (<= KbFilter_PnP_~__cil_tmp23~0 259) (<= 259 KbFilter_PnP_~status~0) (= ~MPR3~0 ~s~0) (<= 1 ~setEventCalled~0) (<= ~setEventCalled~0 1)) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse0 .cse1 .cse2 (not (<= (+ |old(~myStatus~0)| 1073741637) 0)) .cse3 .cse4 (<= (+ ~myStatus~0 1073741637) 0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11)))) [2019-10-15 01:07:21,582 INFO L443 ceAbstractionStarter]: For program point L193-1(lines 193 195) no Hoare annotation was computed. [2019-10-15 01:07:21,583 INFO L443 ceAbstractionStarter]: For program point L152(lines 152 266) no Hoare annotation was computed. [2019-10-15 01:07:21,583 INFO L443 ceAbstractionStarter]: For program point L119(lines 119 277) no Hoare annotation was computed. [2019-10-15 01:07:21,583 INFO L439 ceAbstractionStarter]: At program point L210(line 210) the Hoare annotation is: (or (not (<= 0 |old(~compRegistered~0)|)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= ~SKIP1~0 3)) (= 1 ~pended~0) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~NP~0 1)) (not (<= 3 ~SKIP1~0)) (not (<= |old(~compRegistered~0)| 0)) (not (<= |old(~s~0)| ~NP~0)) (and (= ~s~0 ~NP~0) (<= 1 ~compRegistered~0)) (not (<= 1 |old(~s~0)|))) [2019-10-15 01:07:21,583 INFO L439 ceAbstractionStarter]: At program point L177(line 177) the Hoare annotation is: (or (not (<= 0 |old(~compRegistered~0)|)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= ~SKIP1~0 3)) (= 1 ~pended~0) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~NP~0 1)) (not (<= 3 ~SKIP1~0)) (not (<= |old(~compRegistered~0)| 0)) (not (<= |old(~s~0)| ~NP~0)) (not (<= 1 |old(~s~0)|))) [2019-10-15 01:07:21,583 INFO L439 ceAbstractionStarter]: At program point L235(line 235) the Hoare annotation is: (or (not (<= 0 |old(~compRegistered~0)|)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= ~SKIP1~0 3)) (= 1 ~pended~0) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~NP~0 1)) (not (<= 3 ~SKIP1~0)) (not (<= |old(~compRegistered~0)| 0)) (not (<= |old(~s~0)| ~NP~0)) (not (<= 1 |old(~s~0)|))) [2019-10-15 01:07:21,583 INFO L443 ceAbstractionStarter]: For program point L235-1(lines 231 237) no Hoare annotation was computed. [2019-10-15 01:07:21,583 INFO L443 ceAbstractionStarter]: For program point L161(lines 161 263) no Hoare annotation was computed. [2019-10-15 01:07:21,584 INFO L443 ceAbstractionStarter]: For program point L128(lines 128 274) no Hoare annotation was computed. [2019-10-15 01:07:21,584 INFO L439 ceAbstractionStarter]: At program point L219(line 219) the Hoare annotation is: (or (not (<= 0 |old(~compRegistered~0)|)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= ~SKIP1~0 3)) (= 1 ~pended~0) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~NP~0 1)) (not (<= 3 ~SKIP1~0)) (not (<= |old(~compRegistered~0)| 0)) (not (<= |old(~s~0)| ~NP~0)) (not (<= 1 |old(~s~0)|))) [2019-10-15 01:07:21,584 INFO L439 ceAbstractionStarter]: At program point L186(lines 186 187) the Hoare annotation is: (let ((.cse0 (not (<= 0 |old(~compRegistered~0)|))) (.cse1 (not (<= (+ ~NP~0 5) ~MPR3~0))) (.cse2 (not (<= ~SKIP1~0 3))) (.cse3 (= 1 ~pended~0)) (.cse4 (not (<= (+ ~NP~0 4) ~MPR1~0))) (.cse5 (not (<= ~NP~0 1))) (.cse6 (not (<= 3 ~SKIP1~0))) (.cse7 (not (<= |old(~compRegistered~0)| 0))) (.cse8 (not (<= |old(~s~0)| ~NP~0))) (.cse9 (not (<= 1 |old(~s~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (and (<= 1 ~compRegistered~0) (<= 1 ~s~0) (<= 0 KbFilter_PnP_~status~0) (<= ~s~0 1)) .cse8 .cse9) (or .cse0 .cse1 (not (<= (+ |old(~myStatus~0)| 1073741637) 0)) .cse2 .cse3 (<= (+ ~myStatus~0 1073741637) 0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) [2019-10-15 01:07:21,584 INFO L443 ceAbstractionStarter]: For program point L219-1(lines 215 221) no Hoare annotation was computed. [2019-10-15 01:07:21,584 INFO L443 ceAbstractionStarter]: For program point L186-1(lines 186 187) no Hoare annotation was computed. [2019-10-15 01:07:21,584 INFO L443 ceAbstractionStarter]: For program point KbFilter_PnPEXIT(lines 74 286) no Hoare annotation was computed. [2019-10-15 01:07:21,584 INFO L443 ceAbstractionStarter]: For program point L170(lines 170 182) no Hoare annotation was computed. [2019-10-15 01:07:21,585 INFO L443 ceAbstractionStarter]: For program point L137(lines 137 271) no Hoare annotation was computed. [2019-10-15 01:07:21,585 INFO L443 ceAbstractionStarter]: For program point L104(lines 104 282) no Hoare annotation was computed. [2019-10-15 01:07:21,585 INFO L446 ceAbstractionStarter]: At program point L261(lines 165 262) the Hoare annotation is: true [2019-10-15 01:07:21,585 INFO L443 ceAbstractionStarter]: For program point L146(lines 146 268) no Hoare annotation was computed. [2019-10-15 01:07:21,585 INFO L443 ceAbstractionStarter]: For program point L113(lines 113 279) no Hoare annotation was computed. [2019-10-15 01:07:21,585 INFO L439 ceAbstractionStarter]: At program point KbFilter_PnPENTRY(lines 74 286) the Hoare annotation is: (let ((.cse0 (not (<= 0 |old(~compRegistered~0)|))) (.cse1 (not (<= (+ ~NP~0 5) ~MPR3~0))) (.cse2 (not (<= ~SKIP1~0 3))) (.cse3 (= 1 ~pended~0)) (.cse4 (not (<= (+ ~NP~0 4) ~MPR1~0))) (.cse5 (not (<= ~NP~0 1))) (.cse6 (not (<= 3 ~SKIP1~0))) (.cse7 (not (<= |old(~compRegistered~0)| 0))) (.cse8 (not (<= |old(~s~0)| ~NP~0))) (.cse9 (not (<= 1 |old(~s~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (and (<= 0 ~compRegistered~0) (<= 1 ~s~0) (<= ~s~0 1) (<= ~compRegistered~0 0)) .cse8 .cse9) (or .cse0 .cse1 (not (<= (+ |old(~myStatus~0)| 1073741637) 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= (+ ~myStatus~0 1073741637) 0)))) [2019-10-15 01:07:21,585 INFO L439 ceAbstractionStarter]: At program point L105(lines 104 282) the Hoare annotation is: (or (not (<= 0 |old(~compRegistered~0)|)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= ~SKIP1~0 3)) (= 1 ~pended~0) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~NP~0 1)) (not (<= 3 ~SKIP1~0)) (not (<= |old(~compRegistered~0)| 0)) (not (<= |old(~s~0)| ~NP~0)) (and (= ~s~0 ~NP~0) (<= 0 ~compRegistered~0) (<= ~compRegistered~0 0)) (not (<= 1 |old(~s~0)|))) [2019-10-15 01:07:21,585 INFO L443 ceAbstractionStarter]: For program point KbFilter_PnPFINAL(lines 74 286) no Hoare annotation was computed. [2019-10-15 01:07:21,586 INFO L443 ceAbstractionStarter]: For program point L155(lines 155 265) no Hoare annotation was computed. [2019-10-15 01:07:21,586 INFO L443 ceAbstractionStarter]: For program point L122(lines 122 276) no Hoare annotation was computed. [2019-10-15 01:07:21,586 INFO L439 ceAbstractionStarter]: At program point L172(line 172) the Hoare annotation is: (or (not (<= 0 |old(~compRegistered~0)|)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= ~SKIP1~0 3)) (= 1 ~pended~0) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~NP~0 1)) (not (<= 3 ~SKIP1~0)) (not (<= |old(~compRegistered~0)| 0)) (not (<= |old(~s~0)| ~NP~0)) (not (<= 1 |old(~s~0)|))) [2019-10-15 01:07:21,586 INFO L439 ceAbstractionStarter]: At program point L164(lines 110 280) the Hoare annotation is: (or (not (<= 0 |old(~compRegistered~0)|)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= ~SKIP1~0 3)) (= 1 ~pended~0) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~NP~0 1)) (not (<= 3 ~SKIP1~0)) (not (<= |old(~compRegistered~0)| 0)) (not (<= |old(~s~0)| ~NP~0)) (and (= ~s~0 ~NP~0) (<= 0 ~compRegistered~0) (<= ~compRegistered~0 0)) (not (<= 1 |old(~s~0)|))) [2019-10-15 01:07:21,586 INFO L443 ceAbstractionStarter]: For program point L131(lines 131 273) no Hoare annotation was computed. [2019-10-15 01:07:21,586 INFO L443 ceAbstractionStarter]: For program point L140(lines 140 270) no Hoare annotation was computed. [2019-10-15 01:07:21,586 INFO L443 ceAbstractionStarter]: For program point L107(lines 107 281) no Hoare annotation was computed. [2019-10-15 01:07:21,586 INFO L443 ceAbstractionStarter]: For program point L231(lines 231 237) no Hoare annotation was computed. [2019-10-15 01:07:21,587 INFO L439 ceAbstractionStarter]: At program point L256(lines 256 257) the Hoare annotation is: (or (not (<= 0 |old(~compRegistered~0)|)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= ~SKIP1~0 3)) (= 1 ~pended~0) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~NP~0 1)) (not (<= 3 ~SKIP1~0)) (not (<= |old(~compRegistered~0)| 0)) (and (<= 0 ~compRegistered~0) (<= ~compRegistered~0 0) (= ~SKIP1~0 ~s~0)) (not (<= |old(~s~0)| ~NP~0)) (not (<= 1 |old(~s~0)|))) [2019-10-15 01:07:21,587 INFO L443 ceAbstractionStarter]: For program point L256-1(lines 256 257) no Hoare annotation was computed. [2019-10-15 01:07:21,587 INFO L443 ceAbstractionStarter]: For program point L215(lines 215 221) no Hoare annotation was computed. [2019-10-15 01:07:21,587 INFO L443 ceAbstractionStarter]: For program point L149(lines 149 267) no Hoare annotation was computed. [2019-10-15 01:07:21,587 INFO L443 ceAbstractionStarter]: For program point L116(lines 116 278) no Hoare annotation was computed. [2019-10-15 01:07:21,587 INFO L439 ceAbstractionStarter]: At program point L108(lines 107 281) the Hoare annotation is: (or (not (<= 0 |old(~compRegistered~0)|)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= ~SKIP1~0 3)) (= 1 ~pended~0) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~NP~0 1)) (not (<= 3 ~SKIP1~0)) (not (<= |old(~compRegistered~0)| 0)) (not (<= |old(~s~0)| ~NP~0)) (and (= ~s~0 ~NP~0) (<= 0 ~compRegistered~0) (<= ~compRegistered~0 0)) (not (<= 1 |old(~s~0)|))) [2019-10-15 01:07:21,588 INFO L443 ceAbstractionStarter]: For program point L199(lines 199 205) no Hoare annotation was computed. [2019-10-15 01:07:21,588 INFO L443 ceAbstractionStarter]: For program point L191(lines 191 197) no Hoare annotation was computed. [2019-10-15 01:07:21,588 INFO L443 ceAbstractionStarter]: For program point L158(lines 158 264) no Hoare annotation was computed. [2019-10-15 01:07:21,588 INFO L443 ceAbstractionStarter]: For program point L125(lines 125 275) no Hoare annotation was computed. [2019-10-15 01:07:21,589 INFO L443 ceAbstractionStarter]: For program point L191-2(lines 165 260) no Hoare annotation was computed. [2019-10-15 01:07:21,589 INFO L439 ceAbstractionStarter]: At program point L241(line 241) the Hoare annotation is: (or (not (<= 0 |old(~compRegistered~0)|)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= ~SKIP1~0 3)) (= 1 ~pended~0) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~NP~0 1)) (not (<= 3 ~SKIP1~0)) (not (<= |old(~compRegistered~0)| 0)) (and (<= 0 ~compRegistered~0) (<= ~compRegistered~0 0) (= ~SKIP1~0 ~s~0)) (not (<= |old(~s~0)| ~NP~0)) (not (<= 1 |old(~s~0)|))) [2019-10-15 01:07:21,589 INFO L443 ceAbstractionStarter]: For program point L241-1(line 241) no Hoare annotation was computed. [2019-10-15 01:07:21,589 INFO L443 ceAbstractionStarter]: For program point L175(lines 175 181) no Hoare annotation was computed. [2019-10-15 01:07:21,589 INFO L443 ceAbstractionStarter]: For program point L175-1(lines 170 182) no Hoare annotation was computed. [2019-10-15 01:07:21,589 INFO L443 ceAbstractionStarter]: For program point L200(lines 200 204) no Hoare annotation was computed. [2019-10-15 01:07:21,589 INFO L443 ceAbstractionStarter]: For program point L134(lines 134 272) no Hoare annotation was computed. [2019-10-15 01:07:21,589 INFO L443 ceAbstractionStarter]: For program point L101(lines 101 283) no Hoare annotation was computed. [2019-10-15 01:07:21,652 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 01:07:21 BoogieIcfgContainer [2019-10-15 01:07:21,653 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-15 01:07:21,657 INFO L168 Benchmark]: Toolchain (without parser) took 10431.85 ms. Allocated memory was 139.5 MB in the beginning and 346.0 MB in the end (delta: 206.6 MB). Free memory was 104.1 MB in the beginning and 158.3 MB in the end (delta: -54.2 MB). Peak memory consumption was 217.1 MB. Max. memory is 7.1 GB. [2019-10-15 01:07:21,658 INFO L168 Benchmark]: CDTParser took 1.17 ms. Allocated memory is still 139.5 MB. Free memory was 122.7 MB in the beginning and 122.5 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-10-15 01:07:21,659 INFO L168 Benchmark]: CACSL2BoogieTranslator took 465.65 ms. Allocated memory was 139.5 MB in the beginning and 203.9 MB in the end (delta: 64.5 MB). Free memory was 103.7 MB in the beginning and 179.3 MB in the end (delta: -75.7 MB). Peak memory consumption was 26.4 MB. Max. memory is 7.1 GB. [2019-10-15 01:07:21,661 INFO L168 Benchmark]: Boogie Preprocessor took 48.00 ms. Allocated memory is still 203.9 MB. Free memory was 179.3 MB in the beginning and 177.1 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 7.1 GB. [2019-10-15 01:07:21,662 INFO L168 Benchmark]: RCFGBuilder took 721.33 ms. Allocated memory is still 203.9 MB. Free memory was 177.1 MB in the beginning and 132.4 MB in the end (delta: 44.7 MB). Peak memory consumption was 44.7 MB. Max. memory is 7.1 GB. [2019-10-15 01:07:21,663 INFO L168 Benchmark]: TraceAbstraction took 9192.37 ms. Allocated memory was 203.9 MB in the beginning and 346.0 MB in the end (delta: 142.1 MB). Free memory was 132.4 MB in the beginning and 158.3 MB in the end (delta: -25.9 MB). Peak memory consumption was 180.9 MB. Max. memory is 7.1 GB. [2019-10-15 01:07:21,667 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.17 ms. Allocated memory is still 139.5 MB. Free memory was 122.7 MB in the beginning and 122.5 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 465.65 ms. Allocated memory was 139.5 MB in the beginning and 203.9 MB in the end (delta: 64.5 MB). Free memory was 103.7 MB in the beginning and 179.3 MB in the end (delta: -75.7 MB). Peak memory consumption was 26.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 48.00 ms. Allocated memory is still 203.9 MB. Free memory was 179.3 MB in the beginning and 177.1 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 721.33 ms. Allocated memory is still 203.9 MB. Free memory was 177.1 MB in the beginning and 132.4 MB in the end (delta: 44.7 MB). Peak memory consumption was 44.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 9192.37 ms. Allocated memory was 203.9 MB in the beginning and 346.0 MB in the end (delta: 142.1 MB). Free memory was 132.4 MB in the beginning and 158.3 MB in the end (delta: -25.9 MB). Peak memory consumption was 180.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 580]: 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: 386]: Loop Invariant Derived loop invariant: ((((((((!(0 <= \old(compRegistered)) || 1 == \old(pended)) || !(\old(SKIP1) == \old(s))) || !(\old(MPR3) <= 0)) || !(\old(s) == \old(MPR1))) || !(\old(compRegistered) <= 0)) || !(\old(s) == \old(NP))) || (!(1 == pended) && SKIP1 <= 3 && 3 <= SKIP1)) || !(\old(s) == \old(MPR3))) || !(0 <= \old(MPR3)) - InvariantResult [Line: 368]: Loop Invariant Derived loop invariant: ((((((((!(0 <= \old(compRegistered)) || 1 == \old(pended)) || !(\old(SKIP1) == \old(s))) || !(\old(MPR3) <= 0)) || !(\old(s) == \old(MPR1))) || !(\old(compRegistered) <= 0)) || !(\old(s) == \old(NP))) || (!(1 == pended) && SKIP1 <= 3 && 3 <= SKIP1)) || !(\old(s) == \old(MPR3))) || !(0 <= \old(MPR3)) - InvariantResult [Line: 296]: Loop Invariant Derived loop invariant: ((((((((!(0 <= \old(compRegistered)) || 1 == \old(pended)) || !(\old(SKIP1) == \old(s))) || !(\old(MPR3) <= 0)) || !(\old(s) == \old(MPR1))) || !(\old(compRegistered) <= 0)) || !(\old(s) == \old(NP))) || (!(1 == pended) && SKIP1 <= 3 && 3 <= SKIP1)) || !(\old(s) == \old(MPR3))) || !(0 <= \old(MPR3)) - InvariantResult [Line: 353]: Loop Invariant Derived loop invariant: ((((((((!(0 <= \old(compRegistered)) || 1 == \old(pended)) || !(\old(SKIP1) == \old(s))) || !(\old(MPR3) <= 0)) || !(\old(s) == \old(MPR1))) || !(\old(compRegistered) <= 0)) || !(\old(s) == \old(NP))) || 0 <= status) || !(\old(s) == \old(MPR3))) || !(0 <= \old(MPR3)) - InvariantResult [Line: 107]: Loop Invariant Derived loop invariant: (((((((((!(0 <= \old(compRegistered)) || !(NP + 5 <= MPR3)) || !(SKIP1 <= 3)) || 1 == pended) || !(NP + 4 <= MPR1)) || !(NP <= 1)) || !(3 <= SKIP1)) || !(\old(compRegistered) <= 0)) || !(\old(s) <= NP)) || ((s == NP && 0 <= compRegistered) && compRegistered <= 0)) || !(1 <= \old(s)) - InvariantResult [Line: 443]: Loop Invariant Derived loop invariant: (((((((((((!(NP + 5 <= MPR3) || !(SKIP1 <= 3)) || 1 == pended) || !(NP + 4 <= MPR1)) || !(NP <= 1)) || !(3 <= SKIP1)) || (((s == MPR1 && 259 == returnVal2) && 1 <= setEventCalled) && setEventCalled <= 1)) || (s == MPR1 && 0 == returnVal2)) || (s == MPR1 && returnVal2 + 1073741823 <= 0)) || !(1 <= compRegistered)) || !(\old(s) <= NP)) || !(1 <= \old(s))) && ((((((!(0 <= compRegistered) || SKIP1 == s) || !(SKIP1 <= 3)) || 1 == pended) || !(SKIP1 == \old(s))) || !(3 <= SKIP1)) || !(compRegistered <= 0)) - InvariantResult [Line: 527]: Loop Invariant Derived loop invariant: (((!(NP + 5 <= MPR3) || s == NP) || (((!(\old(s) == NP) || !(SKIP1 <= 3)) || 1 == pended) || !(1 <= compRegistered)) || !(3 <= SKIP1)) || !(NP + 4 <= MPR1)) && ((((((((((!(NP + 5 <= MPR3) || !(1 <= \old(setEventCalled))) || !(1 <= NP)) || !(SKIP1 <= 3)) || 1 == pended) || !(NP + 4 <= MPR1)) || !(\old(s) == MPR3)) || !(1 <= compRegistered)) || !(NP <= 1)) || !(3 <= SKIP1)) || !(\old(setEventCalled) <= 1)) - InvariantResult [Line: 110]: Loop Invariant Derived loop invariant: (((((((((!(0 <= \old(compRegistered)) || !(NP + 5 <= MPR3)) || !(SKIP1 <= 3)) || 1 == pended) || !(NP + 4 <= MPR1)) || !(NP <= 1)) || !(3 <= SKIP1)) || !(\old(compRegistered) <= 0)) || !(\old(s) <= NP)) || ((s == NP && 0 <= compRegistered) && compRegistered <= 0)) || !(1 <= \old(s)) - InvariantResult [Line: 450]: Loop Invariant Derived loop invariant: (((((((((!(NP + 5 <= MPR3) || s == MPR1) || !(SKIP1 <= 3)) || 1 == pended) || !(NP + 4 <= MPR1)) || !(NP <= 1)) || !(3 <= SKIP1)) || !(1 <= compRegistered)) || !(\old(s) <= NP)) || !(1 <= \old(s))) && ((((((!(0 <= compRegistered) || SKIP1 == s) || !(SKIP1 <= 3)) || 1 == pended) || !(SKIP1 == \old(s))) || !(3 <= SKIP1)) || !(compRegistered <= 0)) - InvariantResult [Line: 165]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 457]: Loop Invariant Derived loop invariant: (((((((((!(NP + 5 <= MPR3) || ((s == MPR1 && 1 <= setEventCalled) && setEventCalled <= 1)) || !(SKIP1 <= 3)) || 1 == pended) || !(NP + 4 <= MPR1)) || !(NP <= 1)) || !(3 <= SKIP1)) || !(1 <= compRegistered)) || !(\old(s) <= NP)) || !(1 <= \old(s))) && ((((((!(0 <= compRegistered) || SKIP1 == s) || !(SKIP1 <= 3)) || 1 == pended) || !(SKIP1 == \old(s))) || !(3 <= SKIP1)) || !(compRegistered <= 0)) - InvariantResult [Line: 101]: Loop Invariant Derived loop invariant: (((((((((((!(0 <= \old(compRegistered)) || !(NP + 5 <= MPR3)) || !(\old(myStatus) + 1073741637 <= 0)) || myStatus + 1073741637 <= 0) || !(SKIP1 <= 3)) || 1 == pended) || !(NP + 4 <= MPR1)) || !(NP <= 1)) || !(3 <= SKIP1)) || !(\old(compRegistered) <= 0)) || !(\old(s) <= NP)) || !(1 <= \old(s))) && ((((((((((!(0 <= \old(compRegistered)) || !(NP + 5 <= MPR3)) || !(SKIP1 <= 3)) || 1 == pended) || !(NP + 4 <= MPR1)) || !(NP <= 1)) || !(3 <= SKIP1)) || !(\old(compRegistered) <= 0)) || ((((0 <= compRegistered && 1 <= s) && 0 <= status) && s <= 1) && compRegistered <= 0)) || !(\old(s) <= NP)) || !(1 <= \old(s))) - InvariantResult [Line: 551]: Loop Invariant Derived loop invariant: (((((((((((!(NP + 5 <= MPR3) || !(1 <= \old(setEventCalled))) || !(1 <= NP)) || !(SKIP1 <= 3)) || 1 == pended) || !(NP + 4 <= MPR1)) || !(\old(s) == MPR3)) || !(1 <= compRegistered)) || !(NP <= 1)) || ((((!(1 == pended) && s == NP) && 1 <= compRegistered) && SKIP1 <= 3) && 3 <= SKIP1)) || !(3 <= SKIP1)) || !(\old(setEventCalled) <= 1)) && (((!(NP + 5 <= MPR3) || (((!(\old(s) == NP) || !(SKIP1 <= 3)) || 1 == pended) || !(1 <= compRegistered)) || !(3 <= SKIP1)) || !(NP + 4 <= MPR1)) || ((((!(1 == pended) && s == NP) && 1 <= compRegistered) && SKIP1 <= 3) && 3 <= SKIP1)) - InvariantResult [Line: 376]: Loop Invariant Derived loop invariant: ((((((((!(0 <= \old(compRegistered)) || 1 == \old(pended)) || !(\old(SKIP1) == \old(s))) || !(\old(MPR3) <= 0)) || !(\old(s) == \old(MPR1))) || !(\old(compRegistered) <= 0)) || !(\old(s) == \old(NP))) || (!(1 == pended) && SKIP1 <= 3 && 3 <= SKIP1)) || !(\old(s) == \old(MPR3))) || !(0 <= \old(MPR3)) - InvariantResult [Line: 104]: Loop Invariant Derived loop invariant: (((((((((!(0 <= \old(compRegistered)) || !(NP + 5 <= MPR3)) || !(SKIP1 <= 3)) || 1 == pended) || !(NP + 4 <= MPR1)) || !(NP <= 1)) || !(3 <= SKIP1)) || !(\old(compRegistered) <= 0)) || !(\old(s) <= NP)) || ((s == NP && 0 <= compRegistered) && compRegistered <= 0)) || !(1 <= \old(s)) - InvariantResult [Line: 549]: Loop Invariant Derived loop invariant: (((((((((((!(NP + 5 <= MPR3) || !(1 <= \old(setEventCalled))) || !(1 <= NP)) || !(SKIP1 <= 3)) || 1 == pended) || !(NP + 4 <= MPR1)) || !(\old(s) == MPR3)) || !(1 <= compRegistered)) || !(NP <= 1)) || ((((!(1 == pended) && s == NP) && 1 <= compRegistered) && SKIP1 <= 3) && 3 <= SKIP1)) || !(3 <= SKIP1)) || !(\old(setEventCalled) <= 1)) && (((!(NP + 5 <= MPR3) || (((!(\old(s) == NP) || !(SKIP1 <= 3)) || 1 == pended) || !(1 <= compRegistered)) || !(3 <= SKIP1)) || !(NP + 4 <= MPR1)) || ((((!(1 == pended) && s == NP) && 1 <= compRegistered) && SKIP1 <= 3) && 3 <= SKIP1)) - InvariantResult [Line: 455]: Loop Invariant Derived loop invariant: (((((((((!(NP + 5 <= MPR3) || !(SKIP1 <= 3)) || 1 == pended) || !(NP + 4 <= MPR1)) || s == MPR1) || !(NP <= 1)) || !(3 <= SKIP1)) || !(1 <= compRegistered)) || !(\old(s) <= NP)) || !(1 <= \old(s))) && ((((((!(0 <= compRegistered) || SKIP1 == s) || !(SKIP1 <= 3)) || 1 == pended) || !(SKIP1 == \old(s))) || !(3 <= SKIP1)) || !(compRegistered <= 0)) - InvariantResult [Line: 351]: Loop Invariant Derived loop invariant: ((((((((!(0 <= \old(compRegistered)) || ((((((((((0 <= compRegistered && 1 <= s) && NP + 4 <= MPR1) && s <= NP) && !(1 == pended)) && NP + 5 <= MPR3) && 0 <= status) && NP <= 1) && SKIP1 <= 3) && 3 <= SKIP1) && compRegistered <= 0)) || 1 == \old(pended)) || !(\old(SKIP1) == \old(s))) || !(\old(MPR3) <= 0)) || !(\old(s) == \old(MPR1))) || !(\old(compRegistered) <= 0)) || !(\old(s) == \old(NP))) || !(\old(s) == \old(MPR3))) || !(0 <= \old(MPR3)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 13 procedures, 151 locations, 1 error locations. Result: SAFE, OverallTime: 9.0s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 4.9s, HoareTripleCheckerStatistics: 2242 SDtfs, 1294 SDslu, 2998 SDs, 0 SdLazy, 679 SolverSat, 174 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 130 GetRequests, 55 SyntacticMatches, 8 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=211occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 18 MinimizatonAttempts, 114 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 53 LocationsWithAnnotation, 309 PreInvPairs, 382 NumberOfFragments, 3044 HoareAnnotationTreeSize, 309 FomulaSimplifications, 319 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 53 FomulaSimplificationsInter, 4955 FormulaSimplificationTreeSizeReductionInter, 4.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 943 NumberOfCodeBlocks, 943 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 925 ConstructedInterpolants, 0 QuantifiedInterpolants, 94387 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...