/usr/bin/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 --traceabstraction.trace.refinement.strategy FIXED_PREFERENCES --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.smt.solver Internal_SMTInterpol --traceabstraction.compute.trace.for.counterexample.result false --traceabstraction.use.minimal.unsat.core.enumeration true --traceabstraction.additional.smt.options enumeration-timeout=5 --traceabstraction.additional.smt.options interpolation-heuristic=SMALLEST -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/ntdrivers-simplified/kbfiltr_simpl1.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-5644d1e-m [2020-08-18 17:05:00,864 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-08-18 17:05:00,867 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-08-18 17:05:00,908 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-08-18 17:05:00,908 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-08-18 17:05:00,917 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-08-18 17:05:00,919 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-08-18 17:05:00,922 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-08-18 17:05:00,926 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-08-18 17:05:00,928 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-08-18 17:05:00,929 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-08-18 17:05:00,930 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-08-18 17:05:00,931 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-08-18 17:05:00,933 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-08-18 17:05:00,936 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-08-18 17:05:00,937 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-08-18 17:05:00,939 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-08-18 17:05:00,940 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-08-18 17:05:00,941 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-08-18 17:05:00,949 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-08-18 17:05:00,951 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-08-18 17:05:00,953 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-08-18 17:05:00,955 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-08-18 17:05:00,955 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-08-18 17:05:00,967 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-08-18 17:05:00,967 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-08-18 17:05:00,967 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-08-18 17:05:00,968 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-08-18 17:05:00,969 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-08-18 17:05:00,972 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-08-18 17:05:00,972 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-08-18 17:05:00,973 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-08-18 17:05:00,973 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-08-18 17:05:00,975 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-08-18 17:05:00,976 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-08-18 17:05:00,976 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-08-18 17:05:00,977 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-08-18 17:05:00,977 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-08-18 17:05:00,978 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-08-18 17:05:00,978 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-08-18 17:05:00,980 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-08-18 17:05:00,981 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-08-18 17:05:01,020 INFO L113 SettingsManager]: Loading preferences was successful [2020-08-18 17:05:01,020 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-08-18 17:05:01,022 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-08-18 17:05:01,022 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-08-18 17:05:01,023 INFO L138 SettingsManager]: * Use SBE=true [2020-08-18 17:05:01,023 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-08-18 17:05:01,023 INFO L138 SettingsManager]: * sizeof long=4 [2020-08-18 17:05:01,023 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-08-18 17:05:01,024 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-08-18 17:05:01,024 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-08-18 17:05:01,025 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-08-18 17:05:01,025 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-08-18 17:05:01,025 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-08-18 17:05:01,025 INFO L138 SettingsManager]: * sizeof long double=12 [2020-08-18 17:05:01,026 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-08-18 17:05:01,026 INFO L138 SettingsManager]: * Use constant arrays=true [2020-08-18 17:05:01,026 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-08-18 17:05:01,026 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-08-18 17:05:01,026 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-08-18 17:05:01,027 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-08-18 17:05:01,027 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-08-18 17:05:01,027 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-08-18 17:05:01,027 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-08-18 17:05:01,027 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-08-18 17:05:01,028 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-08-18 17:05:01,028 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-08-18 17:05:01,028 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-08-18 17:05:01,028 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-08-18 17:05:01,028 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-08-18 17:05:01,028 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> FIXED_PREFERENCES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMT solver -> Internal_SMTInterpol Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute trace for counterexample result -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use minimal unsat core enumeration -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> enumeration-timeout=5;interpolation-heuristic=SMALLEST; Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> enumeration-timeout=5;interpolation-heuristic=SMALLEST; [2020-08-18 17:05:01,307 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-08-18 17:05:01,322 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-08-18 17:05:01,327 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-08-18 17:05:01,329 INFO L271 PluginConnector]: Initializing CDTParser... [2020-08-18 17:05:01,330 INFO L275 PluginConnector]: CDTParser initialized [2020-08-18 17:05:01,331 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ntdrivers-simplified/kbfiltr_simpl1.cil.c [2020-08-18 17:05:01,393 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/69419632f/b5d037a7e4be4daeafc496cd4c69efea/FLAG285f6a7b3 [2020-08-18 17:05:01,943 INFO L306 CDTParser]: Found 1 translation units. [2020-08-18 17:05:01,944 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/ntdrivers-simplified/kbfiltr_simpl1.cil.c [2020-08-18 17:05:01,960 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/69419632f/b5d037a7e4be4daeafc496cd4c69efea/FLAG285f6a7b3 [2020-08-18 17:05:02,195 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/69419632f/b5d037a7e4be4daeafc496cd4c69efea [2020-08-18 17:05:02,209 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-08-18 17:05:02,216 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-08-18 17:05:02,217 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-08-18 17:05:02,218 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-08-18 17:05:02,222 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-08-18 17:05:02,223 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.08 05:05:02" (1/1) ... [2020-08-18 17:05:02,227 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7fc81bd2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 05:05:02, skipping insertion in model container [2020-08-18 17:05:02,227 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.08 05:05:02" (1/1) ... [2020-08-18 17:05:02,237 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-08-18 17:05:02,275 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-08-18 17:05:02,515 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-18 17:05:02,521 INFO L203 MainTranslator]: Completed pre-run [2020-08-18 17:05:02,683 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-18 17:05:02,703 INFO L208 MainTranslator]: Completed translation [2020-08-18 17:05:02,704 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 05:05:02 WrapperNode [2020-08-18 17:05:02,704 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-08-18 17:05:02,705 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-08-18 17:05:02,705 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-08-18 17:05:02,705 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-08-18 17:05:02,718 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 05:05:02" (1/1) ... [2020-08-18 17:05:02,718 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 05:05:02" (1/1) ... [2020-08-18 17:05:02,728 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 05:05:02" (1/1) ... [2020-08-18 17:05:02,728 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 05:05:02" (1/1) ... [2020-08-18 17:05:02,740 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 05:05:02" (1/1) ... [2020-08-18 17:05:02,748 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 05:05:02" (1/1) ... [2020-08-18 17:05:02,752 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 05:05:02" (1/1) ... [2020-08-18 17:05:02,756 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-08-18 17:05:02,757 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-08-18 17:05:02,757 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-08-18 17:05:02,758 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-08-18 17:05:02,759 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 05:05:02" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/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 [2020-08-18 17:05:02,835 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-08-18 17:05:02,835 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-08-18 17:05:02,835 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2020-08-18 17:05:02,836 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2020-08-18 17:05:02,836 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_PnP [2020-08-18 17:05:02,836 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-08-18 17:05:02,836 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2020-08-18 17:05:02,837 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2020-08-18 17:05:02,837 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2020-08-18 17:05:02,838 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2020-08-18 17:05:02,838 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2020-08-18 17:05:02,839 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_Complete [2020-08-18 17:05:02,839 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2020-08-18 17:05:02,839 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-08-18 17:05:02,839 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2020-08-18 17:05:02,840 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-08-18 17:05:02,840 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2020-08-18 17:05:02,840 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_PnP [2020-08-18 17:05:02,840 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2020-08-18 17:05:02,841 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2020-08-18 17:05:02,841 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2020-08-18 17:05:02,841 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_Complete [2020-08-18 17:05:02,842 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2020-08-18 17:05:02,842 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2020-08-18 17:05:02,843 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2020-08-18 17:05:02,844 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2020-08-18 17:05:02,844 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-08-18 17:05:02,845 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2020-08-18 17:05:02,845 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-08-18 17:05:02,845 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-08-18 17:05:03,120 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-08-18 17:05:03,287 INFO L732 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##14: assume !false; [2020-08-18 17:05:03,287 INFO L732 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##13: assume false; [2020-08-18 17:05:03,290 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-08-18 17:05:03,329 INFO L732 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##8: assume false; [2020-08-18 17:05:03,329 INFO L732 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##9: assume !false; [2020-08-18 17:05:03,342 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-08-18 17:05:03,398 INFO L732 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2020-08-18 17:05:03,398 INFO L732 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2020-08-18 17:05:03,438 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-08-18 17:05:03,605 INFO L732 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##43: assume false; [2020-08-18 17:05:03,606 INFO L732 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##44: assume !false; [2020-08-18 17:05:03,621 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-08-18 17:05:03,621 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-08-18 17:05:03,627 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.08 05:05:03 BoogieIcfgContainer [2020-08-18 17:05:03,627 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-08-18 17:05:03,628 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-08-18 17:05:03,629 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-08-18 17:05:03,631 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-08-18 17:05:03,632 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.08 05:05:02" (1/3) ... [2020-08-18 17:05:03,632 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22802958 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.08 05:05:03, skipping insertion in model container [2020-08-18 17:05:03,633 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 05:05:02" (2/3) ... [2020-08-18 17:05:03,633 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22802958 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.08 05:05:03, skipping insertion in model container [2020-08-18 17:05:03,634 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.08 05:05:03" (3/3) ... [2020-08-18 17:05:03,636 INFO L109 eAbstractionObserver]: Analyzing ICFG kbfiltr_simpl1.cil.c [2020-08-18 17:05:03,646 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-08-18 17:05:03,654 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-08-18 17:05:03,666 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-08-18 17:05:03,689 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-08-18 17:05:03,690 INFO L376 AbstractCegarLoop]: Hoare is true [2020-08-18 17:05:03,690 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-08-18 17:05:03,690 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-08-18 17:05:03,690 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-08-18 17:05:03,690 INFO L380 AbstractCegarLoop]: Difference is false [2020-08-18 17:05:03,691 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-08-18 17:05:03,691 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-08-18 17:05:03,711 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states. [2020-08-18 17:05:03,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-08-18 17:05:03,717 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 17:05:03,718 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-18 17:05:03,719 INFO L427 AbstractCegarLoop]: === Iteration 1 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 17:05:03,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 17:05:03,725 INFO L82 PathProgramCache]: Analyzing trace with hash -1530382191, now seen corresponding path program 1 times [2020-08-18 17:05:03,732 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 17:05:03,732 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1841517488] [2020-08-18 17:05:03,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 17:05:03,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:05:04,046 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-18 17:05:04,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:05:04,128 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-18 17:05:04,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:05:04,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-18 17:05:04,159 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1841517488] [2020-08-18 17:05:04,161 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-18 17:05:04,162 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-08-18 17:05:04,162 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399005305] [2020-08-18 17:05:04,167 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-08-18 17:05:04,167 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-18 17:05:04,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-08-18 17:05:04,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-08-18 17:05:04,203 INFO L87 Difference]: Start difference. First operand 151 states. Second operand 5 states. [2020-08-18 17:05:04,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-18 17:05:04,943 INFO L93 Difference]: Finished difference Result 303 states and 463 transitions. [2020-08-18 17:05:04,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-08-18 17:05:04,946 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2020-08-18 17:05:04,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-18 17:05:04,975 INFO L225 Difference]: With dead ends: 303 [2020-08-18 17:05:04,975 INFO L226 Difference]: Without dead ends: 157 [2020-08-18 17:05:04,986 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-08-18 17:05:05,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2020-08-18 17:05:05,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 140. [2020-08-18 17:05:05,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2020-08-18 17:05:05,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 190 transitions. [2020-08-18 17:05:05,096 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 190 transitions. Word has length 20 [2020-08-18 17:05:05,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-18 17:05:05,097 INFO L479 AbstractCegarLoop]: Abstraction has 140 states and 190 transitions. [2020-08-18 17:05:05,097 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-08-18 17:05:05,097 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 190 transitions. [2020-08-18 17:05:05,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-08-18 17:05:05,101 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 17:05:05,101 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-18 17:05:05,102 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-08-18 17:05:05,102 INFO L427 AbstractCegarLoop]: === Iteration 2 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 17:05:05,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 17:05:05,104 INFO L82 PathProgramCache]: Analyzing trace with hash 1141575010, now seen corresponding path program 1 times [2020-08-18 17:05:05,104 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 17:05:05,104 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [764353676] [2020-08-18 17:05:05,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 17:05:05,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:05:05,338 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-18 17:05:05,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:05:05,383 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-18 17:05:05,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:05:05,421 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-18 17:05:05,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:05:05,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-18 17:05:05,431 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [764353676] [2020-08-18 17:05:05,431 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-18 17:05:05,432 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-08-18 17:05:05,432 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273269298] [2020-08-18 17:05:05,434 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-08-18 17:05:05,437 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-18 17:05:05,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-08-18 17:05:05,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-08-18 17:05:05,438 INFO L87 Difference]: Start difference. First operand 140 states and 190 transitions. Second operand 6 states. [2020-08-18 17:05:06,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-18 17:05:06,249 INFO L93 Difference]: Finished difference Result 275 states and 370 transitions. [2020-08-18 17:05:06,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-08-18 17:05:06,250 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2020-08-18 17:05:06,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-18 17:05:06,255 INFO L225 Difference]: With dead ends: 275 [2020-08-18 17:05:06,255 INFO L226 Difference]: Without dead ends: 219 [2020-08-18 17:05:06,256 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-08-18 17:05:06,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2020-08-18 17:05:06,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 195. [2020-08-18 17:05:06,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2020-08-18 17:05:06,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 259 transitions. [2020-08-18 17:05:06,292 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 259 transitions. Word has length 26 [2020-08-18 17:05:06,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-18 17:05:06,293 INFO L479 AbstractCegarLoop]: Abstraction has 195 states and 259 transitions. [2020-08-18 17:05:06,293 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-08-18 17:05:06,293 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 259 transitions. [2020-08-18 17:05:06,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-08-18 17:05:06,294 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 17:05:06,294 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-18 17:05:06,294 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-08-18 17:05:06,295 INFO L427 AbstractCegarLoop]: === Iteration 3 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 17:05:06,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 17:05:06,295 INFO L82 PathProgramCache]: Analyzing trace with hash 1029098174, now seen corresponding path program 1 times [2020-08-18 17:05:06,295 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 17:05:06,296 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1615283118] [2020-08-18 17:05:06,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 17:05:06,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:05:06,408 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-18 17:05:06,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:05:06,476 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-18 17:05:06,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:05:06,503 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-18 17:05:06,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:05:06,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-18 17:05:06,512 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1615283118] [2020-08-18 17:05:06,512 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-18 17:05:06,513 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-08-18 17:05:06,513 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230763930] [2020-08-18 17:05:06,513 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-08-18 17:05:06,514 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-18 17:05:06,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-08-18 17:05:06,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-08-18 17:05:06,514 INFO L87 Difference]: Start difference. First operand 195 states and 259 transitions. Second operand 6 states. [2020-08-18 17:05:06,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-18 17:05:06,877 INFO L93 Difference]: Finished difference Result 316 states and 413 transitions. [2020-08-18 17:05:06,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-08-18 17:05:06,877 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2020-08-18 17:05:06,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-18 17:05:06,881 INFO L225 Difference]: With dead ends: 316 [2020-08-18 17:05:06,881 INFO L226 Difference]: Without dead ends: 254 [2020-08-18 17:05:06,882 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-08-18 17:05:06,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2020-08-18 17:05:06,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 217. [2020-08-18 17:05:06,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2020-08-18 17:05:06,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 289 transitions. [2020-08-18 17:05:06,950 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 289 transitions. Word has length 27 [2020-08-18 17:05:06,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-18 17:05:06,950 INFO L479 AbstractCegarLoop]: Abstraction has 217 states and 289 transitions. [2020-08-18 17:05:06,950 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-08-18 17:05:06,950 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 289 transitions. [2020-08-18 17:05:06,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-08-18 17:05:06,952 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 17:05:06,954 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-18 17:05:06,954 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-08-18 17:05:06,954 INFO L427 AbstractCegarLoop]: === Iteration 4 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 17:05:06,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 17:05:06,955 INFO L82 PathProgramCache]: Analyzing trace with hash 742933031, now seen corresponding path program 1 times [2020-08-18 17:05:06,955 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 17:05:06,955 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1352582939] [2020-08-18 17:05:06,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 17:05:07,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:05:07,107 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-18 17:05:07,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:05:07,150 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-18 17:05:07,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:05:07,175 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-18 17:05:07,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:05:07,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-18 17:05:07,185 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1352582939] [2020-08-18 17:05:07,186 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-18 17:05:07,186 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-08-18 17:05:07,188 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320648068] [2020-08-18 17:05:07,189 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-08-18 17:05:07,189 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-18 17:05:07,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-08-18 17:05:07,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-08-18 17:05:07,190 INFO L87 Difference]: Start difference. First operand 217 states and 289 transitions. Second operand 6 states. [2020-08-18 17:05:07,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-18 17:05:07,726 INFO L93 Difference]: Finished difference Result 220 states and 291 transitions. [2020-08-18 17:05:07,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-08-18 17:05:07,727 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 37 [2020-08-18 17:05:07,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-18 17:05:07,735 INFO L225 Difference]: With dead ends: 220 [2020-08-18 17:05:07,735 INFO L226 Difference]: Without dead ends: 217 [2020-08-18 17:05:07,736 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-08-18 17:05:07,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2020-08-18 17:05:07,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2020-08-18 17:05:07,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2020-08-18 17:05:07,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 288 transitions. [2020-08-18 17:05:07,773 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 288 transitions. Word has length 37 [2020-08-18 17:05:07,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-18 17:05:07,774 INFO L479 AbstractCegarLoop]: Abstraction has 217 states and 288 transitions. [2020-08-18 17:05:07,774 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-08-18 17:05:07,774 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 288 transitions. [2020-08-18 17:05:07,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2020-08-18 17:05:07,785 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 17:05:07,786 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-18 17:05:07,786 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-08-18 17:05:07,786 INFO L427 AbstractCegarLoop]: === Iteration 5 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 17:05:07,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 17:05:07,787 INFO L82 PathProgramCache]: Analyzing trace with hash 324263340, now seen corresponding path program 1 times [2020-08-18 17:05:07,787 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 17:05:07,787 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [580838557] [2020-08-18 17:05:07,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 17:05:07,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:05:07,912 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-18 17:05:07,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:05:07,951 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-18 17:05:07,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:05:07,970 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-18 17:05:07,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:05:07,984 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-08-18 17:05:07,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:05:08,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-18 17:05:08,002 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [580838557] [2020-08-18 17:05:08,002 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-18 17:05:08,003 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-08-18 17:05:08,003 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458373224] [2020-08-18 17:05:08,004 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-08-18 17:05:08,004 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-18 17:05:08,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-08-18 17:05:08,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-08-18 17:05:08,004 INFO L87 Difference]: Start difference. First operand 217 states and 288 transitions. Second operand 8 states. [2020-08-18 17:05:08,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-18 17:05:08,721 INFO L93 Difference]: Finished difference Result 274 states and 356 transitions. [2020-08-18 17:05:08,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-08-18 17:05:08,729 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 45 [2020-08-18 17:05:08,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-18 17:05:08,732 INFO L225 Difference]: With dead ends: 274 [2020-08-18 17:05:08,732 INFO L226 Difference]: Without dead ends: 208 [2020-08-18 17:05:08,733 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2020-08-18 17:05:08,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2020-08-18 17:05:08,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 190. [2020-08-18 17:05:08,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2020-08-18 17:05:08,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 250 transitions. [2020-08-18 17:05:08,758 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 250 transitions. Word has length 45 [2020-08-18 17:05:08,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-18 17:05:08,760 INFO L479 AbstractCegarLoop]: Abstraction has 190 states and 250 transitions. [2020-08-18 17:05:08,760 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-08-18 17:05:08,760 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 250 transitions. [2020-08-18 17:05:08,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-08-18 17:05:08,763 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 17:05:08,763 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-18 17:05:08,763 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-08-18 17:05:08,763 INFO L427 AbstractCegarLoop]: === Iteration 6 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 17:05:08,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 17:05:08,764 INFO L82 PathProgramCache]: Analyzing trace with hash 726030577, now seen corresponding path program 1 times [2020-08-18 17:05:08,764 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 17:05:08,765 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1557596007] [2020-08-18 17:05:08,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 17:05:08,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:05:08,884 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-18 17:05:08,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:05:08,919 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-18 17:05:08,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:05:08,938 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-18 17:05:08,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:05:08,948 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-08-18 17:05:08,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:05:08,952 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-18 17:05:08,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:05:08,963 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2020-08-18 17:05:08,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:05:08,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-18 17:05:08,971 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1557596007] [2020-08-18 17:05:08,971 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-18 17:05:08,971 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-08-18 17:05:08,971 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624532379] [2020-08-18 17:05:08,972 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-08-18 17:05:08,972 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-18 17:05:08,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-08-18 17:05:08,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-08-18 17:05:08,973 INFO L87 Difference]: Start difference. First operand 190 states and 250 transitions. Second operand 8 states. [2020-08-18 17:05:09,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-18 17:05:09,462 INFO L93 Difference]: Finished difference Result 258 states and 336 transitions. [2020-08-18 17:05:09,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-08-18 17:05:09,463 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 51 [2020-08-18 17:05:09,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-18 17:05:09,465 INFO L225 Difference]: With dead ends: 258 [2020-08-18 17:05:09,466 INFO L226 Difference]: Without dead ends: 197 [2020-08-18 17:05:09,467 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2020-08-18 17:05:09,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2020-08-18 17:05:09,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 188. [2020-08-18 17:05:09,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2020-08-18 17:05:09,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 246 transitions. [2020-08-18 17:05:09,487 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 246 transitions. Word has length 51 [2020-08-18 17:05:09,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-18 17:05:09,487 INFO L479 AbstractCegarLoop]: Abstraction has 188 states and 246 transitions. [2020-08-18 17:05:09,487 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-08-18 17:05:09,487 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 246 transitions. [2020-08-18 17:05:09,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-08-18 17:05:09,489 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 17:05:09,489 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-18 17:05:09,490 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-08-18 17:05:09,490 INFO L427 AbstractCegarLoop]: === Iteration 7 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 17:05:09,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 17:05:09,491 INFO L82 PathProgramCache]: Analyzing trace with hash 572107035, now seen corresponding path program 1 times [2020-08-18 17:05:09,491 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 17:05:09,491 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [723802503] [2020-08-18 17:05:09,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 17:05:09,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:05:09,602 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-18 17:05:09,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:05:09,639 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-18 17:05:09,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:05:09,665 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-18 17:05:09,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:05:09,690 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-08-18 17:05:09,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:05:09,751 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-18 17:05:09,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:05:09,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-18 17:05:09,771 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [723802503] [2020-08-18 17:05:09,771 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-18 17:05:09,771 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-08-18 17:05:09,771 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457238567] [2020-08-18 17:05:09,774 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-08-18 17:05:09,774 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-18 17:05:09,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-08-18 17:05:09,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2020-08-18 17:05:09,776 INFO L87 Difference]: Start difference. First operand 188 states and 246 transitions. Second operand 10 states. [2020-08-18 17:05:10,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-18 17:05:10,626 INFO L93 Difference]: Finished difference Result 243 states and 316 transitions. [2020-08-18 17:05:10,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-08-18 17:05:10,627 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 50 [2020-08-18 17:05:10,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-18 17:05:10,631 INFO L225 Difference]: With dead ends: 243 [2020-08-18 17:05:10,631 INFO L226 Difference]: Without dead ends: 238 [2020-08-18 17:05:10,632 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2020-08-18 17:05:10,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2020-08-18 17:05:10,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 205. [2020-08-18 17:05:10,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2020-08-18 17:05:10,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 267 transitions. [2020-08-18 17:05:10,654 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 267 transitions. Word has length 50 [2020-08-18 17:05:10,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-18 17:05:10,654 INFO L479 AbstractCegarLoop]: Abstraction has 205 states and 267 transitions. [2020-08-18 17:05:10,655 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-08-18 17:05:10,655 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 267 transitions. [2020-08-18 17:05:10,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-08-18 17:05:10,656 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 17:05:10,656 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-18 17:05:10,656 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-08-18 17:05:10,657 INFO L427 AbstractCegarLoop]: === Iteration 8 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 17:05:10,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 17:05:10,657 INFO L82 PathProgramCache]: Analyzing trace with hash 176400751, now seen corresponding path program 1 times [2020-08-18 17:05:10,657 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 17:05:10,658 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2018197138] [2020-08-18 17:05:10,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 17:05:10,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:05:10,740 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-18 17:05:10,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:05:10,795 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-18 17:05:10,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:05:10,817 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-18 17:05:10,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:05:10,847 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-08-18 17:05:10,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:05:10,907 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-18 17:05:10,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:05:10,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-18 17:05:10,930 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2018197138] [2020-08-18 17:05:10,930 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-18 17:05:10,930 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-08-18 17:05:10,931 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609076155] [2020-08-18 17:05:10,931 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-08-18 17:05:10,931 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-18 17:05:10,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-08-18 17:05:10,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2020-08-18 17:05:10,932 INFO L87 Difference]: Start difference. First operand 205 states and 267 transitions. Second operand 14 states. [2020-08-18 17:05:12,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-18 17:05:12,208 INFO L93 Difference]: Finished difference Result 246 states and 313 transitions. [2020-08-18 17:05:12,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-08-18 17:05:12,209 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 51 [2020-08-18 17:05:12,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-18 17:05:12,211 INFO L225 Difference]: With dead ends: 246 [2020-08-18 17:05:12,212 INFO L226 Difference]: Without dead ends: 222 [2020-08-18 17:05:12,213 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=160, Invalid=542, Unknown=0, NotChecked=0, Total=702 [2020-08-18 17:05:12,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2020-08-18 17:05:12,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 188. [2020-08-18 17:05:12,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2020-08-18 17:05:12,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 244 transitions. [2020-08-18 17:05:12,245 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 244 transitions. Word has length 51 [2020-08-18 17:05:12,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-18 17:05:12,245 INFO L479 AbstractCegarLoop]: Abstraction has 188 states and 244 transitions. [2020-08-18 17:05:12,246 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-08-18 17:05:12,246 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 244 transitions. [2020-08-18 17:05:12,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-08-18 17:05:12,247 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 17:05:12,248 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-18 17:05:12,248 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-08-18 17:05:12,248 INFO L427 AbstractCegarLoop]: === Iteration 9 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 17:05:12,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 17:05:12,249 INFO L82 PathProgramCache]: Analyzing trace with hash 1461171158, now seen corresponding path program 1 times [2020-08-18 17:05:12,249 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 17:05:12,250 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [131681156] [2020-08-18 17:05:12,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 17:05:12,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:05:12,354 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-18 17:05:12,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:05:12,395 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-18 17:05:12,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:05:12,416 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-18 17:05:12,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:05:12,441 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-08-18 17:05:12,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:05:12,474 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-18 17:05:12,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:05:12,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-18 17:05:12,489 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [131681156] [2020-08-18 17:05:12,489 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-18 17:05:12,489 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-08-18 17:05:12,494 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940710729] [2020-08-18 17:05:12,495 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-08-18 17:05:12,495 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-18 17:05:12,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-08-18 17:05:12,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-08-18 17:05:12,497 INFO L87 Difference]: Start difference. First operand 188 states and 244 transitions. Second operand 8 states. [2020-08-18 17:05:12,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-18 17:05:12,730 INFO L93 Difference]: Finished difference Result 203 states and 262 transitions. [2020-08-18 17:05:12,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-08-18 17:05:12,731 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 52 [2020-08-18 17:05:12,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-18 17:05:12,732 INFO L225 Difference]: With dead ends: 203 [2020-08-18 17:05:12,732 INFO L226 Difference]: Without dead ends: 91 [2020-08-18 17:05:12,733 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2020-08-18 17:05:12,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2020-08-18 17:05:12,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2020-08-18 17:05:12,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2020-08-18 17:05:12,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 102 transitions. [2020-08-18 17:05:12,743 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 102 transitions. Word has length 52 [2020-08-18 17:05:12,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-18 17:05:12,743 INFO L479 AbstractCegarLoop]: Abstraction has 91 states and 102 transitions. [2020-08-18 17:05:12,743 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-08-18 17:05:12,743 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 102 transitions. [2020-08-18 17:05:12,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2020-08-18 17:05:12,744 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 17:05:12,744 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-18 17:05:12,745 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-08-18 17:05:12,745 INFO L427 AbstractCegarLoop]: === Iteration 10 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 17:05:12,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 17:05:12,745 INFO L82 PathProgramCache]: Analyzing trace with hash -1516710605, now seen corresponding path program 1 times [2020-08-18 17:05:12,746 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 17:05:12,746 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [811422571] [2020-08-18 17:05:12,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 17:05:12,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:05:12,829 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-18 17:05:12,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:05:12,864 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-18 17:05:12,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:05:12,888 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-18 17:05:12,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:05:12,907 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-08-18 17:05:12,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:05:12,945 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-18 17:05:12,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:05:12,949 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-18 17:05:12,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:05:12,964 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-18 17:05:12,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:05:12,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-18 17:05:12,977 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [811422571] [2020-08-18 17:05:12,977 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-18 17:05:12,977 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-08-18 17:05:12,978 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851497743] [2020-08-18 17:05:12,978 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-08-18 17:05:12,979 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-18 17:05:12,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-08-18 17:05:12,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2020-08-18 17:05:12,980 INFO L87 Difference]: Start difference. First operand 91 states and 102 transitions. Second operand 11 states. [2020-08-18 17:05:13,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-18 17:05:13,426 INFO L93 Difference]: Finished difference Result 119 states and 135 transitions. [2020-08-18 17:05:13,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-08-18 17:05:13,427 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 59 [2020-08-18 17:05:13,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-18 17:05:13,428 INFO L225 Difference]: With dead ends: 119 [2020-08-18 17:05:13,428 INFO L226 Difference]: Without dead ends: 91 [2020-08-18 17:05:13,429 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2020-08-18 17:05:13,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2020-08-18 17:05:13,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2020-08-18 17:05:13,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2020-08-18 17:05:13,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 101 transitions. [2020-08-18 17:05:13,444 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 101 transitions. Word has length 59 [2020-08-18 17:05:13,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-18 17:05:13,445 INFO L479 AbstractCegarLoop]: Abstraction has 91 states and 101 transitions. [2020-08-18 17:05:13,445 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-08-18 17:05:13,445 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 101 transitions. [2020-08-18 17:05:13,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-08-18 17:05:13,446 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 17:05:13,446 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-18 17:05:13,446 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-08-18 17:05:13,446 INFO L427 AbstractCegarLoop]: === Iteration 11 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 17:05:13,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 17:05:13,447 INFO L82 PathProgramCache]: Analyzing trace with hash -14076392, now seen corresponding path program 1 times [2020-08-18 17:05:13,447 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 17:05:13,447 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [824893074] [2020-08-18 17:05:13,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 17:05:13,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:05:13,525 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-18 17:05:13,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:05:13,556 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-18 17:05:13,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:05:13,575 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-18 17:05:13,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:05:13,589 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-08-18 17:05:13,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:05:13,617 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-18 17:05:13,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:05:13,620 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-18 17:05:13,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:05:13,629 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-18 17:05:13,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:05:13,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-18 17:05:13,637 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [824893074] [2020-08-18 17:05:13,637 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-18 17:05:13,637 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-08-18 17:05:13,637 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665332031] [2020-08-18 17:05:13,638 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-08-18 17:05:13,639 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-18 17:05:13,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-08-18 17:05:13,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2020-08-18 17:05:13,639 INFO L87 Difference]: Start difference. First operand 91 states and 101 transitions. Second operand 9 states. [2020-08-18 17:05:13,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-18 17:05:13,835 INFO L93 Difference]: Finished difference Result 122 states and 138 transitions. [2020-08-18 17:05:13,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-08-18 17:05:13,836 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 61 [2020-08-18 17:05:13,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-18 17:05:13,837 INFO L225 Difference]: With dead ends: 122 [2020-08-18 17:05:13,837 INFO L226 Difference]: Without dead ends: 94 [2020-08-18 17:05:13,838 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2020-08-18 17:05:13,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2020-08-18 17:05:13,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2020-08-18 17:05:13,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2020-08-18 17:05:13,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 104 transitions. [2020-08-18 17:05:13,848 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 104 transitions. Word has length 61 [2020-08-18 17:05:13,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-18 17:05:13,848 INFO L479 AbstractCegarLoop]: Abstraction has 94 states and 104 transitions. [2020-08-18 17:05:13,849 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-08-18 17:05:13,849 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 104 transitions. [2020-08-18 17:05:13,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-08-18 17:05:13,850 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 17:05:13,850 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-18 17:05:13,850 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-08-18 17:05:13,850 INFO L427 AbstractCegarLoop]: === Iteration 12 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 17:05:13,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 17:05:13,850 INFO L82 PathProgramCache]: Analyzing trace with hash -600882406, now seen corresponding path program 1 times [2020-08-18 17:05:13,851 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 17:05:13,851 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [414179984] [2020-08-18 17:05:13,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 17:05:13,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:05:13,924 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-18 17:05:13,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:05:13,956 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-18 17:05:13,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:05:13,976 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-18 17:05:13,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:05:13,991 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-08-18 17:05:13,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:05:14,033 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-18 17:05:14,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:05:14,037 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-18 17:05:14,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:05:14,052 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-18 17:05:14,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:05:14,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-18 17:05:14,060 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [414179984] [2020-08-18 17:05:14,060 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-18 17:05:14,061 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-08-18 17:05:14,061 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391292809] [2020-08-18 17:05:14,061 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-08-18 17:05:14,061 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-18 17:05:14,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-08-18 17:05:14,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2020-08-18 17:05:14,062 INFO L87 Difference]: Start difference. First operand 94 states and 104 transitions. Second operand 12 states. [2020-08-18 17:05:14,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-18 17:05:14,375 INFO L93 Difference]: Finished difference Result 112 states and 124 transitions. [2020-08-18 17:05:14,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-08-18 17:05:14,375 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 61 [2020-08-18 17:05:14,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-18 17:05:14,377 INFO L225 Difference]: With dead ends: 112 [2020-08-18 17:05:14,377 INFO L226 Difference]: Without dead ends: 93 [2020-08-18 17:05:14,378 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2020-08-18 17:05:14,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2020-08-18 17:05:14,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 89. [2020-08-18 17:05:14,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2020-08-18 17:05:14,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 97 transitions. [2020-08-18 17:05:14,392 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 97 transitions. Word has length 61 [2020-08-18 17:05:14,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-18 17:05:14,392 INFO L479 AbstractCegarLoop]: Abstraction has 89 states and 97 transitions. [2020-08-18 17:05:14,392 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-08-18 17:05:14,393 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 97 transitions. [2020-08-18 17:05:14,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2020-08-18 17:05:14,393 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 17:05:14,394 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-18 17:05:14,394 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-08-18 17:05:14,394 INFO L427 AbstractCegarLoop]: === Iteration 13 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 17:05:14,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 17:05:14,394 INFO L82 PathProgramCache]: Analyzing trace with hash -673462309, now seen corresponding path program 1 times [2020-08-18 17:05:14,395 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 17:05:14,395 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1167713146] [2020-08-18 17:05:14,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 17:05:14,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:05:14,476 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-18 17:05:14,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:05:14,509 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-18 17:05:14,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:05:14,528 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-18 17:05:14,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:05:14,542 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-08-18 17:05:14,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:05:14,556 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-18 17:05:14,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:05:14,559 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-18 17:05:14,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:05:14,574 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-18 17:05:14,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:05:14,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-18 17:05:14,581 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1167713146] [2020-08-18 17:05:14,582 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-18 17:05:14,582 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-08-18 17:05:14,582 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353927553] [2020-08-18 17:05:14,583 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-08-18 17:05:14,583 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-18 17:05:14,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-08-18 17:05:14,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2020-08-18 17:05:14,584 INFO L87 Difference]: Start difference. First operand 89 states and 97 transitions. Second operand 9 states. [2020-08-18 17:05:14,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-18 17:05:14,757 INFO L93 Difference]: Finished difference Result 105 states and 114 transitions. [2020-08-18 17:05:14,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-08-18 17:05:14,758 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 62 [2020-08-18 17:05:14,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-18 17:05:14,760 INFO L225 Difference]: With dead ends: 105 [2020-08-18 17:05:14,760 INFO L226 Difference]: Without dead ends: 100 [2020-08-18 17:05:14,761 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-08-18 17:05:14,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2020-08-18 17:05:14,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 91. [2020-08-18 17:05:14,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2020-08-18 17:05:14,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 98 transitions. [2020-08-18 17:05:14,772 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 98 transitions. Word has length 62 [2020-08-18 17:05:14,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-18 17:05:14,772 INFO L479 AbstractCegarLoop]: Abstraction has 91 states and 98 transitions. [2020-08-18 17:05:14,772 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-08-18 17:05:14,772 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 98 transitions. [2020-08-18 17:05:14,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2020-08-18 17:05:14,773 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 17:05:14,773 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-18 17:05:14,774 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-08-18 17:05:14,774 INFO L427 AbstractCegarLoop]: === Iteration 14 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 17:05:14,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 17:05:14,774 INFO L82 PathProgramCache]: Analyzing trace with hash 475938380, now seen corresponding path program 1 times [2020-08-18 17:05:14,774 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 17:05:14,775 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [831933179] [2020-08-18 17:05:14,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 17:05:14,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:05:14,856 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-18 17:05:14,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:05:14,889 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-18 17:05:14,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:05:14,909 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-18 17:05:14,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:05:14,923 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-08-18 17:05:14,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:05:14,958 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-18 17:05:14,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:05:14,961 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-18 17:05:14,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:05:14,975 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-18 17:05:14,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:05:14,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-18 17:05:14,982 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [831933179] [2020-08-18 17:05:14,982 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-18 17:05:14,982 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-08-18 17:05:14,982 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828336270] [2020-08-18 17:05:14,983 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-08-18 17:05:14,983 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-18 17:05:14,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-08-18 17:05:14,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2020-08-18 17:05:14,984 INFO L87 Difference]: Start difference. First operand 91 states and 98 transitions. Second operand 12 states. [2020-08-18 17:05:15,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-18 17:05:15,287 INFO L93 Difference]: Finished difference Result 98 states and 104 transitions. [2020-08-18 17:05:15,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-08-18 17:05:15,288 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 62 [2020-08-18 17:05:15,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-18 17:05:15,289 INFO L225 Difference]: With dead ends: 98 [2020-08-18 17:05:15,289 INFO L226 Difference]: Without dead ends: 91 [2020-08-18 17:05:15,289 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2020-08-18 17:05:15,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2020-08-18 17:05:15,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2020-08-18 17:05:15,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2020-08-18 17:05:15,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 97 transitions. [2020-08-18 17:05:15,300 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 97 transitions. Word has length 62 [2020-08-18 17:05:15,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-18 17:05:15,300 INFO L479 AbstractCegarLoop]: Abstraction has 91 states and 97 transitions. [2020-08-18 17:05:15,300 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-08-18 17:05:15,300 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 97 transitions. [2020-08-18 17:05:15,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-08-18 17:05:15,301 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 17:05:15,301 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-18 17:05:15,301 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-08-18 17:05:15,302 INFO L427 AbstractCegarLoop]: === Iteration 15 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 17:05:15,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 17:05:15,302 INFO L82 PathProgramCache]: Analyzing trace with hash 359859562, now seen corresponding path program 1 times [2020-08-18 17:05:15,302 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 17:05:15,303 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [337869482] [2020-08-18 17:05:15,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 17:05:15,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:05:15,403 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-18 17:05:15,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:05:15,439 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-18 17:05:15,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:05:15,462 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-18 17:05:15,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:05:15,477 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-08-18 17:05:15,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:05:15,494 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-18 17:05:15,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:05:15,499 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-18 17:05:15,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:05:15,512 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-18 17:05:15,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:05:15,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-18 17:05:15,522 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [337869482] [2020-08-18 17:05:15,522 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-18 17:05:15,522 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-08-18 17:05:15,523 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628744239] [2020-08-18 17:05:15,523 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-08-18 17:05:15,523 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-18 17:05:15,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-08-18 17:05:15,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2020-08-18 17:05:15,524 INFO L87 Difference]: Start difference. First operand 91 states and 97 transitions. Second operand 10 states. [2020-08-18 17:05:15,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-18 17:05:15,794 INFO L93 Difference]: Finished difference Result 107 states and 114 transitions. [2020-08-18 17:05:15,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-08-18 17:05:15,794 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 63 [2020-08-18 17:05:15,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-18 17:05:15,795 INFO L225 Difference]: With dead ends: 107 [2020-08-18 17:05:15,795 INFO L226 Difference]: Without dead ends: 76 [2020-08-18 17:05:15,796 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2020-08-18 17:05:15,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2020-08-18 17:05:15,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2020-08-18 17:05:15,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2020-08-18 17:05:15,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 79 transitions. [2020-08-18 17:05:15,806 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 79 transitions. Word has length 63 [2020-08-18 17:05:15,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-18 17:05:15,807 INFO L479 AbstractCegarLoop]: Abstraction has 76 states and 79 transitions. [2020-08-18 17:05:15,807 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-08-18 17:05:15,807 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 79 transitions. [2020-08-18 17:05:15,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-08-18 17:05:15,808 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 17:05:15,808 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-18 17:05:15,808 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-08-18 17:05:15,809 INFO L427 AbstractCegarLoop]: === Iteration 16 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 17:05:15,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 17:05:15,809 INFO L82 PathProgramCache]: Analyzing trace with hash 1228040100, now seen corresponding path program 1 times [2020-08-18 17:05:15,809 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 17:05:15,810 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [203415745] [2020-08-18 17:05:15,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 17:05:15,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:05:15,882 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-18 17:05:15,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:05:15,914 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-18 17:05:15,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:05:15,933 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-18 17:05:15,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:05:15,947 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-08-18 17:05:15,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:05:15,964 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-18 17:05:15,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:05:15,966 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-18 17:05:15,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:05:15,977 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-18 17:05:15,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:05:15,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-18 17:05:15,986 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [203415745] [2020-08-18 17:05:15,986 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-18 17:05:15,986 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-08-18 17:05:15,986 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331800466] [2020-08-18 17:05:15,987 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-08-18 17:05:15,987 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-18 17:05:15,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-08-18 17:05:15,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2020-08-18 17:05:15,988 INFO L87 Difference]: Start difference. First operand 76 states and 79 transitions. Second operand 9 states. [2020-08-18 17:05:16,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-18 17:05:16,238 INFO L93 Difference]: Finished difference Result 141 states and 146 transitions. [2020-08-18 17:05:16,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-08-18 17:05:16,239 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 63 [2020-08-18 17:05:16,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-18 17:05:16,240 INFO L225 Difference]: With dead ends: 141 [2020-08-18 17:05:16,240 INFO L226 Difference]: Without dead ends: 134 [2020-08-18 17:05:16,242 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2020-08-18 17:05:16,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2020-08-18 17:05:16,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 133. [2020-08-18 17:05:16,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2020-08-18 17:05:16,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 138 transitions. [2020-08-18 17:05:16,262 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 138 transitions. Word has length 63 [2020-08-18 17:05:16,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-18 17:05:16,262 INFO L479 AbstractCegarLoop]: Abstraction has 133 states and 138 transitions. [2020-08-18 17:05:16,262 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-08-18 17:05:16,262 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 138 transitions. [2020-08-18 17:05:16,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-08-18 17:05:16,263 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 17:05:16,263 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-18 17:05:16,264 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-08-18 17:05:16,264 INFO L427 AbstractCegarLoop]: === Iteration 17 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 17:05:16,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 17:05:16,264 INFO L82 PathProgramCache]: Analyzing trace with hash -1291919834, now seen corresponding path program 1 times [2020-08-18 17:05:16,265 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 17:05:16,265 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1683510637] [2020-08-18 17:05:16,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 17:05:16,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:05:16,383 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-18 17:05:16,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:05:16,456 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-18 17:05:16,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:05:16,482 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-18 17:05:16,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:05:16,499 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-08-18 17:05:16,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:05:16,560 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-18 17:05:16,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:05:16,563 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-18 17:05:16,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:05:16,576 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-18 17:05:16,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:05:16,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-18 17:05:16,584 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1683510637] [2020-08-18 17:05:16,585 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-18 17:05:16,585 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-08-18 17:05:16,585 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060210413] [2020-08-18 17:05:16,586 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-08-18 17:05:16,586 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-18 17:05:16,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-08-18 17:05:16,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2020-08-18 17:05:16,587 INFO L87 Difference]: Start difference. First operand 133 states and 138 transitions. Second operand 12 states. [2020-08-18 17:05:16,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-18 17:05:16,850 INFO L93 Difference]: Finished difference Result 144 states and 149 transitions. [2020-08-18 17:05:16,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-08-18 17:05:16,851 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 63 [2020-08-18 17:05:16,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-18 17:05:16,852 INFO L225 Difference]: With dead ends: 144 [2020-08-18 17:05:16,852 INFO L226 Difference]: Without dead ends: 133 [2020-08-18 17:05:16,852 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2020-08-18 17:05:16,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2020-08-18 17:05:16,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2020-08-18 17:05:16,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2020-08-18 17:05:16,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 136 transitions. [2020-08-18 17:05:16,868 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 136 transitions. Word has length 63 [2020-08-18 17:05:16,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-18 17:05:16,868 INFO L479 AbstractCegarLoop]: Abstraction has 133 states and 136 transitions. [2020-08-18 17:05:16,868 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-08-18 17:05:16,868 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 136 transitions. [2020-08-18 17:05:16,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2020-08-18 17:05:16,869 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 17:05:16,870 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-18 17:05:16,870 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-08-18 17:05:16,870 INFO L427 AbstractCegarLoop]: === Iteration 18 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 17:05:16,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 17:05:16,870 INFO L82 PathProgramCache]: Analyzing trace with hash 1154361885, now seen corresponding path program 1 times [2020-08-18 17:05:16,871 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 17:05:16,871 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1428939824] [2020-08-18 17:05:16,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 17:05:16,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:05:16,958 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-18 17:05:16,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:05:16,991 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-18 17:05:16,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:05:17,010 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-18 17:05:17,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:05:17,023 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-08-18 17:05:17,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:05:17,043 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-18 17:05:17,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:05:17,045 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-18 17:05:17,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:05:17,055 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-18 17:05:17,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:05:17,076 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2020-08-18 17:05:17,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:05:17,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-18 17:05:17,094 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1428939824] [2020-08-18 17:05:17,095 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-18 17:05:17,095 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-08-18 17:05:17,095 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732341108] [2020-08-18 17:05:17,097 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-08-18 17:05:17,099 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-18 17:05:17,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-08-18 17:05:17,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2020-08-18 17:05:17,100 INFO L87 Difference]: Start difference. First operand 133 states and 136 transitions. Second operand 11 states. [2020-08-18 17:05:17,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-18 17:05:17,282 INFO L93 Difference]: Finished difference Result 133 states and 136 transitions. [2020-08-18 17:05:17,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-08-18 17:05:17,283 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 74 [2020-08-18 17:05:17,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-18 17:05:17,283 INFO L225 Difference]: With dead ends: 133 [2020-08-18 17:05:17,283 INFO L226 Difference]: Without dead ends: 0 [2020-08-18 17:05:17,284 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2020-08-18 17:05:17,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-08-18 17:05:17,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-08-18 17:05:17,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-08-18 17:05:17,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-08-18 17:05:17,286 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 74 [2020-08-18 17:05:17,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-18 17:05:17,287 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-08-18 17:05:17,287 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-08-18 17:05:17,287 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-08-18 17:05:17,287 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-08-18 17:05:17,288 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-08-18 17:05:17,291 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-08-18 17:05:18,376 WARN L193 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 52 [2020-08-18 17:05:18,600 WARN L193 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 52 [2020-08-18 17:05:18,923 WARN L193 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 48 [2020-08-18 17:05:19,237 WARN L193 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 60 [2020-08-18 17:05:19,415 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 62 [2020-08-18 17:05:19,680 WARN L193 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 56 [2020-08-18 17:05:19,875 WARN L193 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 36 [2020-08-18 17:05:20,141 WARN L193 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 50 [2020-08-18 17:05:20,470 WARN L193 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 38 [2020-08-18 17:05:20,640 WARN L193 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 51 [2020-08-18 17:05:20,866 WARN L193 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 53 [2020-08-18 17:05:21,041 WARN L193 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 52 [2020-08-18 17:05:21,165 WARN L193 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 36 [2020-08-18 17:05:21,568 WARN L193 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 58 [2020-08-18 17:05:21,736 WARN L193 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 50 [2020-08-18 17:05:21,856 WARN L193 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 50 [2020-08-18 17:05:22,007 WARN L193 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 57 [2020-08-18 17:05:22,121 WARN L193 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 71 [2020-08-18 17:05:22,349 WARN L193 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 48 [2020-08-18 17:05:22,530 WARN L193 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 50 [2020-08-18 17:05:22,781 WARN L193 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 50 [2020-08-18 17:05:23,050 WARN L193 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 53 [2020-08-18 17:05:23,198 WARN L193 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 54 [2020-08-18 17:05:23,357 WARN L193 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 38 [2020-08-18 17:05:23,461 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 45 [2020-08-18 17:05:23,602 WARN L193 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 36 [2020-08-18 17:05:23,650 INFO L264 CegarLoopResult]: At program point KeSetEventENTRY(lines 513 520) the Hoare annotation is: (or (not (<= (+ ~s~0 2) ~SKIP1~0)) (not (<= 1 ~compRegistered~0)) (not (<= ~NP~0 1)) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~pended~0 0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (<= 1 ~NP~0)) (not (= ~s~0 ~NP~0))) [2020-08-18 17:05:23,651 INFO L268 CegarLoopResult]: For program point KeSetEventFINAL(lines 513 520) no Hoare annotation was computed. [2020-08-18 17:05:23,651 INFO L268 CegarLoopResult]: For program point KeSetEventEXIT(lines 513 520) no Hoare annotation was computed. [2020-08-18 17:05:23,651 INFO L264 CegarLoopResult]: At program point KbFilter_CompleteENTRY(lines 563 573) the Hoare annotation is: (or (not (<= (+ ~s~0 2) ~SKIP1~0)) (not (<= 1 ~compRegistered~0)) (not (<= ~NP~0 1)) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~pended~0 0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (<= 1 ~NP~0)) (not (= ~s~0 ~NP~0))) [2020-08-18 17:05:23,652 INFO L264 CegarLoopResult]: At program point L569(line 569) the Hoare annotation is: (or (not (<= (+ ~s~0 2) ~SKIP1~0)) (not (<= 1 ~compRegistered~0)) (not (<= ~NP~0 1)) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~pended~0 0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (<= 1 ~NP~0)) (not (= ~s~0 ~NP~0))) [2020-08-18 17:05:23,652 INFO L268 CegarLoopResult]: For program point L569-1(line 569) no Hoare annotation was computed. [2020-08-18 17:05:23,652 INFO L268 CegarLoopResult]: For program point KbFilter_CompleteFINAL(lines 563 573) no Hoare annotation was computed. [2020-08-18 17:05:23,652 INFO L268 CegarLoopResult]: For program point KbFilter_CompleteEXIT(lines 563 573) no Hoare annotation was computed. [2020-08-18 17:05:23,653 INFO L268 CegarLoopResult]: For program point stub_driver_initEXIT(lines 35 48) no Hoare annotation was computed. [2020-08-18 17:05:23,653 INFO L264 CegarLoopResult]: At program point stub_driver_initENTRY(lines 35 48) the Hoare annotation is: (or (not (<= ~NP~0 1)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (and (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |old(~compRegistered~0)| ~compRegistered~0) (= ~pended~0 |old(~pended~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~compFptr~0 |old(~compFptr~0)|) (= ~s~0 ~NP~0) (= |old(~customIrp~0)| ~customIrp~0)) (not (= |old(~compRegistered~0)| 0)) (not (= ~NP~0 |old(~s~0)|)) (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= 1 ~NP~0)) (not (<= |old(~pended~0)| 0))) [2020-08-18 17:05:23,653 INFO L268 CegarLoopResult]: For program point stub_driver_initFINAL(lines 35 48) no Hoare annotation was computed. [2020-08-18 17:05:23,653 INFO L268 CegarLoopResult]: For program point _BLAST_initFINAL(lines 49 70) no Hoare annotation was computed. [2020-08-18 17:05:23,653 INFO L264 CegarLoopResult]: At program point _BLAST_initENTRY(lines 49 70) the Hoare annotation is: (or (not (<= |old(~IPC~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (and (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 ~NP~0) (= ~MPR3~0 |old(~MPR3~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~IPC~0 |old(~IPC~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~DC~0 |old(~DC~0)|) (= |old(~compRegistered~0)| ~compRegistered~0) (= ~pended~0 |old(~pended~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~compFptr~0 |old(~compFptr~0)|) (= ~SKIP1~0 ~s~0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (<= |old(~pended~0)| 0))) [2020-08-18 17:05:23,653 INFO L268 CegarLoopResult]: For program point _BLAST_initEXIT(lines 49 70) no Hoare annotation was computed. [2020-08-18 17:05:23,654 INFO L271 CegarLoopResult]: At program point errorFnENTRY(lines 575 582) the Hoare annotation is: true [2020-08-18 17:05:23,654 INFO L268 CegarLoopResult]: For program point errorFnFINAL(lines 575 582) no Hoare annotation was computed. [2020-08-18 17:05:23,654 INFO L268 CegarLoopResult]: For program point errorFnEXIT(lines 575 582) no Hoare annotation was computed. [2020-08-18 17:05:23,654 INFO L268 CegarLoopResult]: For program point errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION(line 579) no Hoare annotation was computed. [2020-08-18 17:05:23,654 INFO L264 CegarLoopResult]: At program point L382(lines 375 415) the Hoare annotation is: (or (not (<= |old(~IPC~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (and (<= (+ ~NP~0 2) ~SKIP1~0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= ~pended~0 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (<= |old(~pended~0)| 0))) [2020-08-18 17:05:23,654 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 286 420) no Hoare annotation was computed. [2020-08-18 17:05:23,654 INFO L268 CegarLoopResult]: For program point L407(lines 407 409) no Hoare annotation was computed. [2020-08-18 17:05:23,654 INFO L264 CegarLoopResult]: At program point L374(lines 367 416) the Hoare annotation is: (or (not (<= |old(~IPC~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (and (<= (+ ~NP~0 2) ~SKIP1~0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= ~pended~0 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (<= |old(~pended~0)| 0))) [2020-08-18 17:05:23,654 INFO L268 CegarLoopResult]: For program point L383(lines 367 416) no Hoare annotation was computed. [2020-08-18 17:05:23,654 INFO L268 CegarLoopResult]: For program point L350(lines 350 365) no Hoare annotation was computed. [2020-08-18 17:05:23,655 INFO L268 CegarLoopResult]: For program point L384(lines 384 413) no Hoare annotation was computed. [2020-08-18 17:05:23,655 INFO L264 CegarLoopResult]: At program point L351(lines 350 365) the Hoare annotation is: (or (not (<= |old(~IPC~0)| |old(~s~0)|)) (and (<= (+ ~NP~0 2) ~SKIP1~0) (= ~compRegistered~0 0) (= ~s~0 ~NP~0) (<= ~NP~0 1) (<= 0 main_~status~1) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ ~NP~0 4) ~MPR1~0) (<= 1 ~NP~0) (<= ~pended~0 0)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (<= |old(~pended~0)| 0))) [2020-08-18 17:05:23,655 INFO L268 CegarLoopResult]: For program point L376(lines 376 380) no Hoare annotation was computed. [2020-08-18 17:05:23,655 INFO L268 CegarLoopResult]: For program point L368(lines 368 372) no Hoare annotation was computed. [2020-08-18 17:05:23,655 INFO L268 CegarLoopResult]: For program point L335(lines 321 366) no Hoare annotation was computed. [2020-08-18 17:05:23,655 INFO L268 CegarLoopResult]: For program point mainFINAL(lines 286 420) no Hoare annotation was computed. [2020-08-18 17:05:23,655 INFO L268 CegarLoopResult]: For program point L385(lines 385 412) no Hoare annotation was computed. [2020-08-18 17:05:23,655 INFO L264 CegarLoopResult]: At program point L319(line 319) the Hoare annotation is: (or (not (<= |old(~IPC~0)| |old(~s~0)|)) (and (= ~MPR3~0 ~s~0) (= ~compRegistered~0 0) (= ~s~0 ~NP~0) (= ~SKIP1~0 ~s~0) (<= ~IPC~0 ~s~0) (<= 0 main_~status~1) (= ~MPR1~0 ~NP~0) (<= ~pended~0 0)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (<= |old(~pended~0)| 0))) [2020-08-18 17:05:23,655 INFO L268 CegarLoopResult]: For program point L319-1(lines 295 419) no Hoare annotation was computed. [2020-08-18 17:05:23,656 INFO L264 CegarLoopResult]: At program point mainENTRY(lines 286 420) the Hoare annotation is: (or (not (<= |old(~IPC~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (and (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 ~NP~0) (= |old(~Executive~0)| ~Executive~0) (= ~MPR3~0 |old(~MPR3~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~KernelMode~0 |old(~KernelMode~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~IPC~0 |old(~IPC~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~DC~0 |old(~DC~0)|) (= |old(~compRegistered~0)| ~compRegistered~0) (= ~pended~0 |old(~pended~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~compFptr~0 |old(~compFptr~0)|) (= ~SKIP1~0 ~s~0) (= ~myStatus~0 |old(~myStatus~0)|)) (not (<= |old(~pended~0)| 0))) [2020-08-18 17:05:23,656 INFO L268 CegarLoopResult]: For program point L402(lines 402 410) no Hoare annotation was computed. [2020-08-18 17:05:23,656 INFO L264 CegarLoopResult]: At program point L394(lines 385 412) the Hoare annotation is: (or (not (<= |old(~IPC~0)| |old(~s~0)|)) (and (<= (+ ~NP~0 2) ~SKIP1~0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= ~pended~0 0)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (<= |old(~pended~0)| 0))) [2020-08-18 17:05:23,656 INFO L268 CegarLoopResult]: For program point L386(lines 386 392) no Hoare annotation was computed. [2020-08-18 17:05:23,656 INFO L264 CegarLoopResult]: At program point L353(lines 352 365) the Hoare annotation is: (or (not (<= |old(~IPC~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (<= 0 main_~status~1) (not (= |old(~s~0)| |old(~NP~0)|)) (not (<= |old(~pended~0)| 0))) [2020-08-18 17:05:23,656 INFO L268 CegarLoopResult]: For program point L403(lines 403 405) no Hoare annotation was computed. [2020-08-18 17:05:23,656 INFO L268 CegarLoopResult]: For program point L387(lines 387 389) no Hoare annotation was computed. [2020-08-18 17:05:23,656 INFO L264 CegarLoopResult]: At program point L321(lines 295 419) the Hoare annotation is: (or (not (<= |old(~IPC~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (and (<= (+ ~NP~0 2) ~SKIP1~0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= ~pended~0 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (<= |old(~pended~0)| 0))) [2020-08-18 17:05:23,656 INFO L268 CegarLoopResult]: For program point L338-1(lines 337 347) no Hoare annotation was computed. [2020-08-18 17:05:23,657 INFO L268 CegarLoopResult]: For program point L396(lines 396 400) no Hoare annotation was computed. [2020-08-18 17:05:23,657 INFO L268 CegarLoopResult]: For program point L330(lines 330 333) no Hoare annotation was computed. [2020-08-18 17:05:23,657 INFO L264 CegarLoopResult]: At program point L330-2(lines 330 333) the Hoare annotation is: (or (not (<= |old(~IPC~0)| |old(~s~0)|)) (and (<= (+ ~NP~0 2) ~SKIP1~0) (= ~compRegistered~0 0) (= ~s~0 ~NP~0) (<= ~NP~0 1) (<= 0 main_~status~1) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ ~NP~0 4) ~MPR1~0) (<= 1 ~NP~0) (<= ~pended~0 0)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (<= |old(~pended~0)| 0))) [2020-08-18 17:05:23,657 INFO L264 CegarLoopResult]: At program point L398(line 398) the Hoare annotation is: (or (not (<= |old(~IPC~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (<= |old(~pended~0)| 0))) [2020-08-18 17:05:23,657 INFO L268 CegarLoopResult]: For program point L357(line 357) no Hoare annotation was computed. [2020-08-18 17:05:23,657 INFO L268 CegarLoopResult]: For program point L477(lines 477 494) no Hoare annotation was computed. [2020-08-18 17:05:23,658 INFO L264 CegarLoopResult]: At program point L444(line 444) the Hoare annotation is: (let ((.cse0 (not (<= ~pended~0 0))) (.cse1 (not (<= (+ ~SKIP2~0 3) ~IPC~0)))) (and (or (and (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 ~NP~0)) (not (<= 1 ~compRegistered~0)) (not (<= ~NP~0 1)) (not (<= (+ |old(~s~0)| 2) ~SKIP1~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) .cse0 .cse1 (not (= ~NP~0 |old(~s~0)|)) (not (<= 1 ~NP~0))) (or .cse0 .cse1 (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= ~compRegistered~0 0))))) [2020-08-18 17:05:23,658 INFO L268 CegarLoopResult]: For program point L444-1(line 444) no Hoare annotation was computed. [2020-08-18 17:05:23,658 INFO L264 CegarLoopResult]: At program point L469(lines 442 497) the Hoare annotation is: (let ((.cse0 (not (<= ~pended~0 0))) (.cse1 (not (<= (+ ~SKIP2~0 3) ~IPC~0)))) (and (or .cse0 .cse1 (and (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~SKIP1~0 ~s~0)) (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= ~compRegistered~0 0))) (let ((.cse2 (= ~MPR1~0 ~s~0))) (or (not (<= 1 ~compRegistered~0)) (not (<= ~NP~0 1)) (not (<= (+ |old(~s~0)| 2) ~SKIP1~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) .cse0 .cse1 (not (= ~NP~0 |old(~s~0)|)) (and .cse2 (= ~setEventCalled~0 1) (<= IofCallDriver_~returnVal2~0 259) (<= 259 IofCallDriver_~returnVal2~0)) (and (<= IofCallDriver_~returnVal2~0 0) .cse2) (not (<= 1 ~NP~0)))))) [2020-08-18 17:05:23,658 INFO L264 CegarLoopResult]: At program point L457(lines 456 471) the Hoare annotation is: (let ((.cse0 (not (<= ~pended~0 0))) (.cse1 (not (<= (+ ~SKIP2~0 3) ~IPC~0)))) (and (or .cse0 .cse1 (and (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~SKIP1~0 ~s~0)) (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= ~compRegistered~0 0))) (or (not (<= 1 ~compRegistered~0)) (and (= ~MPR1~0 ~s~0) (= ~setEventCalled~0 1)) (not (<= ~NP~0 1)) (not (<= (+ |old(~s~0)| 2) ~SKIP1~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) .cse0 .cse1 (not (= ~NP~0 |old(~s~0)|)) (not (<= 1 ~NP~0))))) [2020-08-18 17:05:23,658 INFO L268 CegarLoopResult]: For program point L486(lines 486 493) no Hoare annotation was computed. [2020-08-18 17:05:23,658 INFO L268 CegarLoopResult]: For program point L449(lines 449 472) no Hoare annotation was computed. [2020-08-18 17:05:23,659 INFO L268 CegarLoopResult]: For program point L478(lines 478 484) no Hoare annotation was computed. [2020-08-18 17:05:23,659 INFO L264 CegarLoopResult]: At program point L445(line 445) the Hoare annotation is: (let ((.cse0 (not (<= ~pended~0 0))) (.cse1 (not (<= (+ ~SKIP2~0 3) ~IPC~0)))) (and (or (not (<= 1 ~compRegistered~0)) (not (<= ~NP~0 1)) (not (<= (+ |old(~s~0)| 2) ~SKIP1~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) .cse0 .cse1 (not (= ~NP~0 |old(~s~0)|)) (not (<= 1 ~NP~0)) (and (= ~setEventCalled~0 1) (= ~s~0 |old(~s~0)|))) (or .cse0 .cse1 (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= ~compRegistered~0 0))))) [2020-08-18 17:05:23,659 INFO L264 CegarLoopResult]: At program point IofCallDriverENTRY(lines 435 498) the Hoare annotation is: (let ((.cse2 (not (<= ~pended~0 0))) (.cse3 (not (<= (+ ~SKIP2~0 3) ~IPC~0))) (.cse0 (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|)) (.cse1 (= ~setEventCalled~0 |old(~setEventCalled~0)|))) (and (or (and .cse0 .cse1 (= ~s~0 ~NP~0)) (not (<= 1 ~compRegistered~0)) (not (<= ~NP~0 1)) (not (<= (+ |old(~s~0)| 2) ~SKIP1~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) .cse2 .cse3 (not (= ~NP~0 |old(~s~0)|)) (not (<= 1 ~NP~0))) (or .cse2 .cse3 (and .cse0 .cse1 (= ~SKIP1~0 ~s~0)) (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= ~compRegistered~0 0))))) [2020-08-18 17:05:23,659 INFO L264 CegarLoopResult]: At program point L491(line 491) the Hoare annotation is: (let ((.cse0 (not (<= ~pended~0 0))) (.cse1 (not (<= (+ ~SKIP2~0 3) ~IPC~0)))) (and (or .cse0 .cse1 (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= ~compRegistered~0 0))) (or (not (<= 1 ~compRegistered~0)) (not (<= ~NP~0 1)) (not (<= (+ |old(~s~0)| 2) ~SKIP1~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) .cse0 .cse1 (not (= ~NP~0 |old(~s~0)|)) (not (<= 1 ~NP~0))))) [2020-08-18 17:05:23,659 INFO L268 CegarLoopResult]: For program point L491-1(lines 473 495) no Hoare annotation was computed. [2020-08-18 17:05:23,659 INFO L268 CegarLoopResult]: For program point L454(lines 454 471) no Hoare annotation was computed. [2020-08-18 17:05:23,660 INFO L264 CegarLoopResult]: At program point L450(lines 449 472) the Hoare annotation is: (let ((.cse0 (not (<= ~pended~0 0))) (.cse1 (not (<= (+ ~SKIP2~0 3) ~IPC~0)))) (and (or .cse0 .cse1 (and (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~SKIP1~0 ~s~0)) (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= ~compRegistered~0 0))) (or (not (<= 1 ~compRegistered~0)) (= ~MPR1~0 ~s~0) (not (<= ~NP~0 1)) (not (<= (+ |old(~s~0)| 2) ~SKIP1~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) .cse0 .cse1 (not (= ~NP~0 |old(~s~0)|)) (not (<= 1 ~NP~0))))) [2020-08-18 17:05:23,660 INFO L268 CegarLoopResult]: For program point IofCallDriverFINAL(lines 435 498) no Hoare annotation was computed. [2020-08-18 17:05:23,660 INFO L268 CegarLoopResult]: For program point IofCallDriverEXIT(lines 435 498) no Hoare annotation was computed. [2020-08-18 17:05:23,660 INFO L264 CegarLoopResult]: At program point L455(lines 454 471) the Hoare annotation is: (let ((.cse0 (not (<= ~pended~0 0))) (.cse1 (not (<= (+ ~SKIP2~0 3) ~IPC~0)))) (and (or .cse0 .cse1 (and (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~SKIP1~0 ~s~0)) (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= ~compRegistered~0 0))) (or (not (<= 1 ~compRegistered~0)) (= ~MPR1~0 ~s~0) (not (<= ~NP~0 1)) (not (<= (+ |old(~s~0)| 2) ~SKIP1~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) .cse0 .cse1 (not (= ~NP~0 |old(~s~0)|)) (not (<= 1 ~NP~0))))) [2020-08-18 17:05:23,660 INFO L268 CegarLoopResult]: For program point L443(lines 443 446) no Hoare annotation was computed. [2020-08-18 17:05:23,660 INFO L268 CegarLoopResult]: For program point L443-1(lines 443 446) no Hoare annotation was computed. [2020-08-18 17:05:23,661 INFO L264 CegarLoopResult]: At program point L429(line 429) the Hoare annotation is: (or (not (<= 1 ~compRegistered~0)) (not (<= ~NP~0 1)) (not (<= (+ |old(~s~0)| 2) ~SKIP1~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (= ~setEventCalled~0 1)) (not (<= ~pended~0 0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= ~NP~0 |old(~s~0)|)) (not (<= 1 ~NP~0))) [2020-08-18 17:05:23,661 INFO L268 CegarLoopResult]: For program point L429-1(lines 421 434) no Hoare annotation was computed. [2020-08-18 17:05:23,661 INFO L264 CegarLoopResult]: At program point stubMoreProcessingRequiredENTRY(lines 421 434) the Hoare annotation is: (or (not (<= 1 ~compRegistered~0)) (not (<= ~NP~0 1)) (not (<= (+ |old(~s~0)| 2) ~SKIP1~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (= ~setEventCalled~0 1)) (= ~s~0 ~NP~0) (not (<= ~pended~0 0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= ~NP~0 |old(~s~0)|)) (not (<= 1 ~NP~0))) [2020-08-18 17:05:23,661 INFO L268 CegarLoopResult]: For program point stubMoreProcessingRequiredEXIT(lines 421 434) no Hoare annotation was computed. [2020-08-18 17:05:23,661 INFO L268 CegarLoopResult]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2020-08-18 17:05:23,661 INFO L264 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~compRegistered~0 |old(~compRegistered~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~SKIP2~0 |old(~SKIP2~0)|) (= ~NP~0 |old(~NP~0)|) (= ~MPR3~0 |old(~MPR3~0)|) (= ~KernelMode~0 |old(~KernelMode~0)|) (= ~s~0 |old(~s~0)|) (= ~SKIP1~0 |old(~SKIP1~0)|) (= ~IPC~0 |old(~IPC~0)|) (= ~DC~0 |old(~DC~0)|) (= ~pended~0 |old(~pended~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~compFptr~0 |old(~compFptr~0)|) (= ~customIrp~0 |old(~customIrp~0)|) (= ~UNLOADED~0 |old(~UNLOADED~0)|) (= ~Executive~0 |old(~Executive~0)|) (= ~myStatus~0 |old(~myStatus~0)|)) [2020-08-18 17:05:23,661 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-08-18 17:05:23,662 INFO L264 CegarLoopResult]: At program point L541(line 541) the Hoare annotation is: (let ((.cse0 (not (<= 1 ~compRegistered~0))) (.cse1 (not (<= ~NP~0 1))) (.cse2 (not (= |old(~setEventCalled~0)| 1))) (.cse3 (not (<= (+ ~NP~0 4) ~MPR1~0))) (.cse4 (not (<= ~pended~0 0))) (.cse5 (not (<= (+ ~SKIP2~0 3) ~IPC~0))) (.cse6 (not (<= 1 ~NP~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (= ~MPR3~0 |old(~s~0)|)) .cse6) (or .cse0 .cse1 .cse2 (not (<= (+ |old(~s~0)| 2) ~SKIP1~0)) .cse3 .cse4 .cse5 (not (= ~NP~0 |old(~s~0)|)) .cse6))) [2020-08-18 17:05:23,662 INFO L268 CegarLoopResult]: For program point L539(lines 539 543) no Hoare annotation was computed. [2020-08-18 17:05:23,662 INFO L268 CegarLoopResult]: For program point L539-1(lines 526 545) no Hoare annotation was computed. [2020-08-18 17:05:23,662 INFO L268 CegarLoopResult]: For program point KeWaitForSingleObjectEXIT(lines 521 562) no Hoare annotation was computed. [2020-08-18 17:05:23,662 INFO L268 CegarLoopResult]: For program point L527(lines 527 532) no Hoare annotation was computed. [2020-08-18 17:05:23,662 INFO L268 CegarLoopResult]: For program point L548(lines 548 560) no Hoare annotation was computed. [2020-08-18 17:05:23,662 INFO L268 CegarLoopResult]: For program point KeWaitForSingleObjectFINAL(lines 521 562) no Hoare annotation was computed. [2020-08-18 17:05:23,662 INFO L264 CegarLoopResult]: At program point L534(lines 526 545) the Hoare annotation is: (let ((.cse0 (not (<= 1 ~compRegistered~0))) (.cse1 (not (<= ~NP~0 1))) (.cse2 (not (= |old(~setEventCalled~0)| 1))) (.cse3 (not (<= (+ ~NP~0 4) ~MPR1~0))) (.cse4 (not (<= ~pended~0 0))) (.cse5 (not (<= (+ ~SKIP2~0 3) ~IPC~0))) (.cse6 (not (<= 1 ~NP~0)))) (and (or .cse0 .cse1 .cse2 (not (<= (+ |old(~s~0)| 2) ~SKIP1~0)) .cse3 .cse4 .cse5 (not (= ~NP~0 |old(~s~0)|)) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 ~NP~0) (= |old(~customIrp~0)| ~customIrp~0)) .cse6) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (= ~MPR3~0 |old(~s~0)|)) .cse6))) [2020-08-18 17:05:23,663 INFO L268 CegarLoopResult]: For program point L526(lines 526 545) no Hoare annotation was computed. [2020-08-18 17:05:23,663 INFO L264 CegarLoopResult]: At program point L551(lines 550 560) the Hoare annotation is: (let ((.cse0 (not (<= 1 ~compRegistered~0))) (.cse1 (not (<= ~NP~0 1))) (.cse2 (not (= |old(~setEventCalled~0)| 1))) (.cse3 (not (<= (+ ~NP~0 4) ~MPR1~0))) (.cse4 (not (<= ~pended~0 0))) (.cse5 (not (<= (+ ~SKIP2~0 3) ~IPC~0))) (.cse6 (not (<= 1 ~NP~0)))) (and (or .cse0 .cse1 .cse2 .cse3 (= ~s~0 ~NP~0) .cse4 .cse5 (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (= ~MPR3~0 |old(~s~0)|)) .cse6) (or .cse0 .cse1 .cse2 (not (<= (+ |old(~s~0)| 2) ~SKIP1~0)) .cse3 .cse4 .cse5 (not (= ~NP~0 |old(~s~0)|)) (= ~s~0 |old(~s~0)|) .cse6))) [2020-08-18 17:05:23,663 INFO L264 CegarLoopResult]: At program point KeWaitForSingleObjectENTRY(lines 521 562) the Hoare annotation is: (let ((.cse0 (not (<= 1 ~compRegistered~0))) (.cse1 (not (<= ~NP~0 1))) (.cse2 (not (= |old(~setEventCalled~0)| 1))) (.cse3 (not (<= (+ ~NP~0 4) ~MPR1~0))) (.cse4 (not (<= ~pended~0 0))) (.cse5 (not (<= (+ ~SKIP2~0 3) ~IPC~0))) (.cse6 (= ~setEventCalled~0 |old(~setEventCalled~0)|)) (.cse7 (= |old(~customIrp~0)| ~customIrp~0)) (.cse8 (not (<= 1 ~NP~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (and (= ~MPR3~0 ~s~0) .cse6 .cse7) (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (= ~MPR3~0 |old(~s~0)|)) .cse8) (or .cse0 .cse1 .cse2 (not (<= (+ |old(~s~0)| 2) ~SKIP1~0)) .cse3 .cse4 .cse5 (not (= ~NP~0 |old(~s~0)|)) (and .cse6 (= ~s~0 ~NP~0) .cse7) .cse8))) [2020-08-18 17:05:23,663 INFO L264 CegarLoopResult]: At program point L549(lines 548 560) the Hoare annotation is: (let ((.cse0 (not (<= 1 ~compRegistered~0))) (.cse1 (not (<= ~NP~0 1))) (.cse2 (not (= |old(~setEventCalled~0)| 1))) (.cse3 (not (<= (+ ~NP~0 4) ~MPR1~0))) (.cse4 (not (<= ~pended~0 0))) (.cse5 (not (<= (+ ~SKIP2~0 3) ~IPC~0))) (.cse6 (not (<= 1 ~NP~0)))) (and (or .cse0 .cse1 .cse2 .cse3 (= ~s~0 ~NP~0) .cse4 .cse5 (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (= ~MPR3~0 |old(~s~0)|)) .cse6) (or .cse0 .cse1 .cse2 (not (<= (+ |old(~s~0)| 2) ~SKIP1~0)) .cse3 .cse4 .cse5 (not (= ~NP~0 |old(~s~0)|)) (= ~s~0 |old(~s~0)|) .cse6))) [2020-08-18 17:05:23,664 INFO L264 CegarLoopResult]: At program point L507(line 507) the Hoare annotation is: (or (not (<= 1 ~compRegistered~0)) (not (<= ~pended~0 0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= ~NP~0 |old(~s~0)|)) (not (<= (+ ~NP~0 2) ~SKIP1~0))) [2020-08-18 17:05:23,664 INFO L268 CegarLoopResult]: For program point L507-1(lines 499 512) no Hoare annotation was computed. [2020-08-18 17:05:23,664 INFO L264 CegarLoopResult]: At program point IofCompleteRequestENTRY(lines 499 512) the Hoare annotation is: (or (not (<= 1 ~compRegistered~0)) (not (<= ~pended~0 0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= ~NP~0 |old(~s~0)|)) (not (<= (+ ~NP~0 2) ~SKIP1~0)) (= ~s~0 |old(~s~0)|)) [2020-08-18 17:05:23,664 INFO L268 CegarLoopResult]: For program point L503(lines 503 509) no Hoare annotation was computed. [2020-08-18 17:05:23,664 INFO L268 CegarLoopResult]: For program point IofCompleteRequestEXIT(lines 499 512) no Hoare annotation was computed. [2020-08-18 17:05:23,664 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-08-18 17:05:23,664 INFO L264 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: (and (= ~MPR3~0 ~s~0) (= ~compRegistered~0 0) (= ~s~0 ~NP~0) (= ~SKIP1~0 ~s~0) (<= ~IPC~0 ~s~0) (= ~MPR1~0 ~NP~0) (<= ~pended~0 0)) [2020-08-18 17:05:23,665 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-08-18 17:05:23,665 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-08-18 17:05:23,665 INFO L264 CegarLoopResult]: At program point L192(lines 192 194) the Hoare annotation is: (let ((.cse1 (<= 259 KbFilter_PnP_~status~0)) (.cse2 (= ~setEventCalled~0 1)) (.cse12 (<= 1 ~NP~0)) (.cse3 (<= 1 ~compRegistered~0)) (.cse13 (<= (+ ~NP~0 4) ~MPR1~0))) (let ((.cse0 (not (<= ~NP~0 1))) (.cse4 (not .cse13)) (.cse5 (not (<= ~pended~0 0))) (.cse6 (not (<= (+ ~SKIP2~0 3) ~IPC~0))) (.cse8 (not (= ~NP~0 |old(~s~0)|))) (.cse7 (not (= |old(~compRegistered~0)| 0))) (.cse9 (not (<= (+ ~NP~0 2) ~SKIP1~0))) (.cse10 (and .cse1 .cse2 .cse13 (= ~s~0 |old(~s~0)|) .cse12 .cse3)) (.cse11 (not .cse12))) (and (or .cse0 (and (= ~MPR3~0 ~s~0) .cse1 .cse2 (= KbFilter_PnP_~__cil_tmp23~0 259) .cse3) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse0 .cse4 .cse5 .cse6 .cse8 .cse7 .cse9 .cse10 .cse11 (not (<= (+ |old(~myStatus~0)| 1073741637) 0)) (<= (+ ~myStatus~0 1073741637) 0))))) [2020-08-18 17:05:23,665 INFO L268 CegarLoopResult]: For program point L192-1(lines 192 194) no Hoare annotation was computed. [2020-08-18 17:05:23,665 INFO L268 CegarLoopResult]: For program point L151(lines 151 265) no Hoare annotation was computed. [2020-08-18 17:05:23,665 INFO L268 CegarLoopResult]: For program point L118(lines 118 276) no Hoare annotation was computed. [2020-08-18 17:05:23,665 INFO L264 CegarLoopResult]: At program point L209(line 209) the Hoare annotation is: (or (not (<= ~NP~0 1)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~pended~0 0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= |old(~compRegistered~0)| 0)) (not (= ~NP~0 |old(~s~0)|)) (not (<= (+ ~NP~0 2) ~SKIP1~0)) (and (= ~s~0 ~NP~0) (<= 1 ~compRegistered~0)) (not (<= 1 ~NP~0))) [2020-08-18 17:05:23,666 INFO L264 CegarLoopResult]: At program point L176(line 176) the Hoare annotation is: (or (not (<= ~NP~0 1)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~pended~0 0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= |old(~compRegistered~0)| 0)) (not (= ~NP~0 |old(~s~0)|)) (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= 1 ~NP~0))) [2020-08-18 17:05:23,666 INFO L264 CegarLoopResult]: At program point L234(line 234) the Hoare annotation is: (or (not (<= ~NP~0 1)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~pended~0 0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= |old(~compRegistered~0)| 0)) (not (= ~NP~0 |old(~s~0)|)) (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= 1 ~NP~0))) [2020-08-18 17:05:23,666 INFO L268 CegarLoopResult]: For program point L234-1(lines 230 236) no Hoare annotation was computed. [2020-08-18 17:05:23,666 INFO L268 CegarLoopResult]: For program point L160(lines 160 262) no Hoare annotation was computed. [2020-08-18 17:05:23,666 INFO L268 CegarLoopResult]: For program point L127(lines 127 273) no Hoare annotation was computed. [2020-08-18 17:05:23,666 INFO L264 CegarLoopResult]: At program point L218(line 218) the Hoare annotation is: (or (not (<= ~NP~0 1)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~pended~0 0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= |old(~compRegistered~0)| 0)) (not (= ~NP~0 |old(~s~0)|)) (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= 1 ~NP~0))) [2020-08-18 17:05:23,667 INFO L264 CegarLoopResult]: At program point L185(lines 185 186) the Hoare annotation is: (let ((.cse0 (not (<= ~NP~0 1))) (.cse1 (not (<= (+ ~NP~0 4) ~MPR1~0))) (.cse2 (not (<= ~pended~0 0))) (.cse3 (not (<= (+ ~SKIP2~0 3) ~IPC~0))) (.cse4 (not (= |old(~compRegistered~0)| 0))) (.cse5 (not (= ~NP~0 |old(~s~0)|))) (.cse6 (not (<= (+ ~NP~0 2) ~SKIP1~0))) (.cse7 (not (<= 1 ~NP~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (and (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~s~0 |old(~s~0)|) (<= 1 ~compRegistered~0))) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= (+ ~myStatus~0 1073741637) 0) (not (<= (+ |old(~myStatus~0)| 1073741637) 0))))) [2020-08-18 17:05:23,667 INFO L268 CegarLoopResult]: For program point L218-1(lines 214 220) no Hoare annotation was computed. [2020-08-18 17:05:23,667 INFO L268 CegarLoopResult]: For program point L185-1(lines 185 186) no Hoare annotation was computed. [2020-08-18 17:05:23,667 INFO L268 CegarLoopResult]: For program point L169(lines 169 181) no Hoare annotation was computed. [2020-08-18 17:05:23,667 INFO L268 CegarLoopResult]: For program point L136(lines 136 270) no Hoare annotation was computed. [2020-08-18 17:05:23,667 INFO L268 CegarLoopResult]: For program point L103(lines 103 281) no Hoare annotation was computed. [2020-08-18 17:05:23,667 INFO L271 CegarLoopResult]: At program point L260(lines 164 261) the Hoare annotation is: true [2020-08-18 17:05:23,667 INFO L268 CegarLoopResult]: For program point KbFilter_PnPEXIT(lines 73 285) no Hoare annotation was computed. [2020-08-18 17:05:23,668 INFO L268 CegarLoopResult]: For program point L145(lines 145 267) no Hoare annotation was computed. [2020-08-18 17:05:23,668 INFO L268 CegarLoopResult]: For program point L112(lines 112 278) no Hoare annotation was computed. [2020-08-18 17:05:23,668 INFO L264 CegarLoopResult]: At program point L104(lines 103 281) the Hoare annotation is: (or (and (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |old(~compRegistered~0)| ~compRegistered~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 ~NP~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~myStatus~0 |old(~myStatus~0)|)) (not (<= ~NP~0 1)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~pended~0 0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= |old(~compRegistered~0)| 0)) (not (= ~NP~0 |old(~s~0)|)) (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= 1 ~NP~0))) [2020-08-18 17:05:23,668 INFO L268 CegarLoopResult]: For program point L154(lines 154 264) no Hoare annotation was computed. [2020-08-18 17:05:23,668 INFO L268 CegarLoopResult]: For program point L121(lines 121 275) no Hoare annotation was computed. [2020-08-18 17:05:23,668 INFO L264 CegarLoopResult]: At program point KbFilter_PnPENTRY(lines 73 285) the Hoare annotation is: (or (and (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |old(~compRegistered~0)| ~compRegistered~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 ~NP~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~myStatus~0 |old(~myStatus~0)|)) (not (<= ~NP~0 1)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~pended~0 0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= |old(~compRegistered~0)| 0)) (not (= ~NP~0 |old(~s~0)|)) (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= 1 ~NP~0))) [2020-08-18 17:05:23,669 INFO L264 CegarLoopResult]: At program point L171(line 171) the Hoare annotation is: (or (not (<= ~NP~0 1)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~pended~0 0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= |old(~compRegistered~0)| 0)) (not (= ~NP~0 |old(~s~0)|)) (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= 1 ~NP~0))) [2020-08-18 17:05:23,669 INFO L268 CegarLoopResult]: For program point KbFilter_PnPFINAL(lines 73 285) no Hoare annotation was computed. [2020-08-18 17:05:23,669 INFO L264 CegarLoopResult]: At program point L163(lines 109 279) the Hoare annotation is: (or (and (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |old(~compRegistered~0)| ~compRegistered~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 ~NP~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~myStatus~0 |old(~myStatus~0)|)) (not (<= ~NP~0 1)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~pended~0 0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= |old(~compRegistered~0)| 0)) (not (= ~NP~0 |old(~s~0)|)) (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= 1 ~NP~0))) [2020-08-18 17:05:23,669 INFO L268 CegarLoopResult]: For program point L130(lines 130 272) no Hoare annotation was computed. [2020-08-18 17:05:23,669 INFO L268 CegarLoopResult]: For program point L139(lines 139 269) no Hoare annotation was computed. [2020-08-18 17:05:23,669 INFO L268 CegarLoopResult]: For program point L106(lines 106 280) no Hoare annotation was computed. [2020-08-18 17:05:23,669 INFO L268 CegarLoopResult]: For program point L230(lines 230 236) no Hoare annotation was computed. [2020-08-18 17:05:23,670 INFO L264 CegarLoopResult]: At program point L255(lines 255 256) the Hoare annotation is: (or (not (<= ~NP~0 1)) (and (= ~compRegistered~0 0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~SKIP1~0 ~s~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~pended~0 0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= |old(~compRegistered~0)| 0)) (not (= ~NP~0 |old(~s~0)|)) (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= 1 ~NP~0))) [2020-08-18 17:05:23,670 INFO L268 CegarLoopResult]: For program point L255-1(lines 255 256) no Hoare annotation was computed. [2020-08-18 17:05:23,670 INFO L268 CegarLoopResult]: For program point L214(lines 214 220) no Hoare annotation was computed. [2020-08-18 17:05:23,670 INFO L268 CegarLoopResult]: For program point L148(lines 148 266) no Hoare annotation was computed. [2020-08-18 17:05:23,670 INFO L268 CegarLoopResult]: For program point L115(lines 115 277) no Hoare annotation was computed. [2020-08-18 17:05:23,670 INFO L264 CegarLoopResult]: At program point L107(lines 106 280) the Hoare annotation is: (or (and (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |old(~compRegistered~0)| ~compRegistered~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 ~NP~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~myStatus~0 |old(~myStatus~0)|)) (not (<= ~NP~0 1)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~pended~0 0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= |old(~compRegistered~0)| 0)) (not (= ~NP~0 |old(~s~0)|)) (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= 1 ~NP~0))) [2020-08-18 17:05:23,670 INFO L268 CegarLoopResult]: For program point L198(lines 198 204) no Hoare annotation was computed. [2020-08-18 17:05:23,670 INFO L268 CegarLoopResult]: For program point L190(lines 190 196) no Hoare annotation was computed. [2020-08-18 17:05:23,671 INFO L268 CegarLoopResult]: For program point L157(lines 157 263) no Hoare annotation was computed. [2020-08-18 17:05:23,671 INFO L268 CegarLoopResult]: For program point L124(lines 124 274) no Hoare annotation was computed. [2020-08-18 17:05:23,671 INFO L268 CegarLoopResult]: For program point L190-2(lines 164 259) no Hoare annotation was computed. [2020-08-18 17:05:23,671 INFO L264 CegarLoopResult]: At program point L240(line 240) the Hoare annotation is: (or (not (<= ~NP~0 1)) (and (= ~compRegistered~0 0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~SKIP1~0 ~s~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~pended~0 0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= |old(~compRegistered~0)| 0)) (not (= ~NP~0 |old(~s~0)|)) (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= 1 ~NP~0))) [2020-08-18 17:05:23,671 INFO L268 CegarLoopResult]: For program point L240-1(line 240) no Hoare annotation was computed. [2020-08-18 17:05:23,671 INFO L268 CegarLoopResult]: For program point L174(lines 174 180) no Hoare annotation was computed. [2020-08-18 17:05:23,671 INFO L268 CegarLoopResult]: For program point L174-1(lines 169 181) no Hoare annotation was computed. [2020-08-18 17:05:23,671 INFO L268 CegarLoopResult]: For program point L199(lines 199 203) no Hoare annotation was computed. [2020-08-18 17:05:23,672 INFO L268 CegarLoopResult]: For program point L133(lines 133 271) no Hoare annotation was computed. [2020-08-18 17:05:23,672 INFO L268 CegarLoopResult]: For program point L100(lines 100 282) no Hoare annotation was computed. [2020-08-18 17:05:23,672 INFO L264 CegarLoopResult]: At program point L224(lines 224 225) the Hoare annotation is: (or (not (<= ~NP~0 1)) (and (= ~compRegistered~0 0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~SKIP1~0 ~s~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~pended~0 0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= |old(~compRegistered~0)| 0)) (not (= ~NP~0 |old(~s~0)|)) (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= 1 ~NP~0))) [2020-08-18 17:05:23,672 INFO L268 CegarLoopResult]: For program point L224-1(lines 224 225) no Hoare annotation was computed. [2020-08-18 17:05:23,672 INFO L264 CegarLoopResult]: At program point L249(line 249) the Hoare annotation is: (or (not (<= ~NP~0 1)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~pended~0 0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= |old(~compRegistered~0)| 0)) (not (= ~NP~0 |old(~s~0)|)) (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= 1 ~NP~0))) [2020-08-18 17:05:23,672 INFO L268 CegarLoopResult]: For program point L249-1(lines 245 251) no Hoare annotation was computed. [2020-08-18 17:05:23,672 INFO L268 CegarLoopResult]: For program point L142(lines 142 268) no Hoare annotation was computed. [2020-08-18 17:05:23,673 INFO L268 CegarLoopResult]: For program point L109(lines 109 279) no Hoare annotation was computed. [2020-08-18 17:05:23,673 INFO L264 CegarLoopResult]: At program point L101(lines 100 282) the Hoare annotation is: (or (and (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |old(~compRegistered~0)| ~compRegistered~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 ~NP~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~myStatus~0 |old(~myStatus~0)|)) (not (<= ~NP~0 1)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~pended~0 0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= |old(~compRegistered~0)| 0)) (not (= ~NP~0 |old(~s~0)|)) (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= 1 ~NP~0))) [2020-08-18 17:05:23,737 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.08 05:05:23 BoogieIcfgContainer [2020-08-18 17:05:23,737 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-08-18 17:05:23,741 INFO L168 Benchmark]: Toolchain (without parser) took 21530.76 ms. Allocated memory was 141.0 MB in the beginning and 451.4 MB in the end (delta: 310.4 MB). Free memory was 104.3 MB in the beginning and 172.8 MB in the end (delta: -68.5 MB). Peak memory consumption was 325.0 MB. Max. memory is 7.1 GB. [2020-08-18 17:05:23,743 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 141.0 MB. Free memory was 122.6 MB in the beginning and 122.2 MB in the end (delta: 419.5 kB). Peak memory consumption was 419.5 kB. Max. memory is 7.1 GB. [2020-08-18 17:05:23,744 INFO L168 Benchmark]: CACSL2BoogieTranslator took 487.35 ms. Allocated memory was 141.0 MB in the beginning and 204.5 MB in the end (delta: 63.4 MB). Free memory was 104.3 MB in the beginning and 179.3 MB in the end (delta: -75.1 MB). Peak memory consumption was 24.8 MB. Max. memory is 7.1 GB. [2020-08-18 17:05:23,744 INFO L168 Benchmark]: Boogie Preprocessor took 51.50 ms. Allocated memory is still 204.5 MB. Free memory was 179.3 MB in the beginning and 176.4 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2020-08-18 17:05:23,745 INFO L168 Benchmark]: RCFGBuilder took 870.24 ms. Allocated memory is still 204.5 MB. Free memory was 176.4 MB in the beginning and 131.9 MB in the end (delta: 44.5 MB). Peak memory consumption was 44.5 MB. Max. memory is 7.1 GB. [2020-08-18 17:05:23,745 INFO L168 Benchmark]: TraceAbstraction took 20109.15 ms. Allocated memory was 204.5 MB in the beginning and 451.4 MB in the end (delta: 246.9 MB). Free memory was 130.9 MB in the beginning and 172.8 MB in the end (delta: -41.8 MB). Peak memory consumption was 288.2 MB. Max. memory is 7.1 GB. [2020-08-18 17:05:23,750 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 141.0 MB. Free memory was 122.6 MB in the beginning and 122.2 MB in the end (delta: 419.5 kB). Peak memory consumption was 419.5 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 487.35 ms. Allocated memory was 141.0 MB in the beginning and 204.5 MB in the end (delta: 63.4 MB). Free memory was 104.3 MB in the beginning and 179.3 MB in the end (delta: -75.1 MB). Peak memory consumption was 24.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 51.50 ms. Allocated memory is still 204.5 MB. Free memory was 179.3 MB in the beginning and 176.4 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 870.24 ms. Allocated memory is still 204.5 MB. Free memory was 176.4 MB in the beginning and 131.9 MB in the end (delta: 44.5 MB). Peak memory consumption was 44.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 20109.15 ms. Allocated memory was 204.5 MB in the beginning and 451.4 MB in the end (delta: 246.9 MB). Free memory was 130.9 MB in the beginning and 172.8 MB in the end (delta: -41.8 MB). Peak memory consumption was 288.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 579]: 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: 367]: Loop Invariant Derived loop invariant: ((((((!(\old(IPC) <= \old(s)) || !(\old(s) == \old(MPR3))) || ((NP + 2 <= SKIP1 && SKIP2 + 3 <= IPC) && pended <= 0)) || !(\old(SKIP1) == \old(s))) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(NP))) || !(\old(pended) <= 0) - InvariantResult [Line: 295]: Loop Invariant Derived loop invariant: ((((((!(\old(IPC) <= \old(s)) || !(\old(s) == \old(MPR3))) || ((NP + 2 <= SKIP1 && SKIP2 + 3 <= IPC) && pended <= 0)) || !(\old(SKIP1) == \old(s))) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(NP))) || !(\old(pended) <= 0) - InvariantResult [Line: 352]: Loop Invariant Derived loop invariant: ((((((!(\old(IPC) <= \old(s)) || !(\old(s) == \old(MPR3))) || !(\old(SKIP1) == \old(s))) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR1))) || 0 <= status) || !(\old(s) == \old(NP))) || !(\old(pended) <= 0) - InvariantResult [Line: 106]: Loop Invariant Derived loop invariant: ((((((((((((lowerDriverReturn == \old(lowerDriverReturn) && \old(compRegistered) == compRegistered) && setEventCalled == \old(setEventCalled)) && s == NP) && \old(customIrp) == customIrp) && myStatus == \old(myStatus)) || !(NP <= 1)) || !(NP + 4 <= MPR1)) || !(pended <= 0)) || !(SKIP2 + 3 <= IPC)) || !(\old(compRegistered) == 0)) || !(NP == \old(s))) || !(NP + 2 <= SKIP1)) || !(1 <= NP) - InvariantResult [Line: 109]: Loop Invariant Derived loop invariant: ((((((((((((lowerDriverReturn == \old(lowerDriverReturn) && \old(compRegistered) == compRegistered) && setEventCalled == \old(setEventCalled)) && s == NP) && \old(customIrp) == customIrp) && myStatus == \old(myStatus)) || !(NP <= 1)) || !(NP + 4 <= MPR1)) || !(pended <= 0)) || !(SKIP2 + 3 <= IPC)) || !(\old(compRegistered) == 0)) || !(NP == \old(s))) || !(NP + 2 <= SKIP1)) || !(1 <= NP) - InvariantResult [Line: 449]: Loop Invariant Derived loop invariant: (((((!(pended <= 0) || !(SKIP2 + 3 <= IPC)) || ((lowerDriverReturn == \old(lowerDriverReturn) && setEventCalled == \old(setEventCalled)) && SKIP1 == s)) || !(NP + 2 <= SKIP1)) || !(SKIP1 == \old(s))) || !(compRegistered == 0)) && ((((((((!(1 <= compRegistered) || MPR1 == s) || !(NP <= 1)) || !(\old(s) + 2 <= SKIP1)) || !(NP + 4 <= MPR1)) || !(pended <= 0)) || !(SKIP2 + 3 <= IPC)) || !(NP == \old(s))) || !(1 <= NP)) - InvariantResult [Line: 526]: Loop Invariant Derived loop invariant: (((((((((!(1 <= compRegistered) || !(NP <= 1)) || !(\old(setEventCalled) == 1)) || !(\old(s) + 2 <= SKIP1)) || !(NP + 4 <= MPR1)) || !(pended <= 0)) || !(SKIP2 + 3 <= IPC)) || !(NP == \old(s))) || ((setEventCalled == \old(setEventCalled) && s == NP) && \old(customIrp) == customIrp)) || !(1 <= NP)) && ((((((((!(1 <= compRegistered) || !(NP <= 1)) || !(\old(setEventCalled) == 1)) || !(NP + 4 <= MPR1)) || !(pended <= 0)) || !(SKIP2 + 3 <= IPC)) || !(NP + 2 <= SKIP1)) || !(MPR3 == \old(s))) || !(1 <= NP)) - InvariantResult [Line: 164]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 100]: Loop Invariant Derived loop invariant: ((((((((((((lowerDriverReturn == \old(lowerDriverReturn) && \old(compRegistered) == compRegistered) && setEventCalled == \old(setEventCalled)) && s == NP) && \old(customIrp) == customIrp) && myStatus == \old(myStatus)) || !(NP <= 1)) || !(NP + 4 <= MPR1)) || !(pended <= 0)) || !(SKIP2 + 3 <= IPC)) || !(\old(compRegistered) == 0)) || !(NP == \old(s))) || !(NP + 2 <= SKIP1)) || !(1 <= NP) - InvariantResult [Line: 456]: Loop Invariant Derived loop invariant: (((((!(pended <= 0) || !(SKIP2 + 3 <= IPC)) || ((lowerDriverReturn == \old(lowerDriverReturn) && setEventCalled == \old(setEventCalled)) && SKIP1 == s)) || !(NP + 2 <= SKIP1)) || !(SKIP1 == \old(s))) || !(compRegistered == 0)) && ((((((((!(1 <= compRegistered) || (MPR1 == s && setEventCalled == 1)) || !(NP <= 1)) || !(\old(s) + 2 <= SKIP1)) || !(NP + 4 <= MPR1)) || !(pended <= 0)) || !(SKIP2 + 3 <= IPC)) || !(NP == \old(s))) || !(1 <= NP)) - InvariantResult [Line: 548]: Loop Invariant Derived loop invariant: (((((((((!(1 <= compRegistered) || !(NP <= 1)) || !(\old(setEventCalled) == 1)) || !(NP + 4 <= MPR1)) || s == NP) || !(pended <= 0)) || !(SKIP2 + 3 <= IPC)) || !(NP + 2 <= SKIP1)) || !(MPR3 == \old(s))) || !(1 <= NP)) && (((((((((!(1 <= compRegistered) || !(NP <= 1)) || !(\old(setEventCalled) == 1)) || !(\old(s) + 2 <= SKIP1)) || !(NP + 4 <= MPR1)) || !(pended <= 0)) || !(SKIP2 + 3 <= IPC)) || !(NP == \old(s))) || s == \old(s)) || !(1 <= NP)) - InvariantResult [Line: 442]: Loop Invariant Derived loop invariant: (((((!(pended <= 0) || !(SKIP2 + 3 <= IPC)) || ((lowerDriverReturn == \old(lowerDriverReturn) && setEventCalled == \old(setEventCalled)) && SKIP1 == s)) || !(NP + 2 <= SKIP1)) || !(SKIP1 == \old(s))) || !(compRegistered == 0)) && (((((((((!(1 <= compRegistered) || !(NP <= 1)) || !(\old(s) + 2 <= SKIP1)) || !(NP + 4 <= MPR1)) || !(pended <= 0)) || !(SKIP2 + 3 <= IPC)) || !(NP == \old(s))) || (((MPR1 == s && setEventCalled == 1) && returnVal2 <= 259) && 259 <= returnVal2)) || (returnVal2 <= 0 && MPR1 == s)) || !(1 <= NP)) - InvariantResult [Line: 550]: Loop Invariant Derived loop invariant: (((((((((!(1 <= compRegistered) || !(NP <= 1)) || !(\old(setEventCalled) == 1)) || !(NP + 4 <= MPR1)) || s == NP) || !(pended <= 0)) || !(SKIP2 + 3 <= IPC)) || !(NP + 2 <= SKIP1)) || !(MPR3 == \old(s))) || !(1 <= NP)) && (((((((((!(1 <= compRegistered) || !(NP <= 1)) || !(\old(setEventCalled) == 1)) || !(\old(s) + 2 <= SKIP1)) || !(NP + 4 <= MPR1)) || !(pended <= 0)) || !(SKIP2 + 3 <= IPC)) || !(NP == \old(s))) || s == \old(s)) || !(1 <= NP)) - InvariantResult [Line: 375]: Loop Invariant Derived loop invariant: ((((((!(\old(IPC) <= \old(s)) || !(\old(s) == \old(MPR3))) || ((NP + 2 <= SKIP1 && SKIP2 + 3 <= IPC) && pended <= 0)) || !(\old(SKIP1) == \old(s))) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(NP))) || !(\old(pended) <= 0) - InvariantResult [Line: 103]: Loop Invariant Derived loop invariant: ((((((((((((lowerDriverReturn == \old(lowerDriverReturn) && \old(compRegistered) == compRegistered) && setEventCalled == \old(setEventCalled)) && s == NP) && \old(customIrp) == customIrp) && myStatus == \old(myStatus)) || !(NP <= 1)) || !(NP + 4 <= MPR1)) || !(pended <= 0)) || !(SKIP2 + 3 <= IPC)) || !(\old(compRegistered) == 0)) || !(NP == \old(s))) || !(NP + 2 <= SKIP1)) || !(1 <= NP) - InvariantResult [Line: 454]: Loop Invariant Derived loop invariant: (((((!(pended <= 0) || !(SKIP2 + 3 <= IPC)) || ((lowerDriverReturn == \old(lowerDriverReturn) && setEventCalled == \old(setEventCalled)) && SKIP1 == s)) || !(NP + 2 <= SKIP1)) || !(SKIP1 == \old(s))) || !(compRegistered == 0)) && ((((((((!(1 <= compRegistered) || MPR1 == s) || !(NP <= 1)) || !(\old(s) + 2 <= SKIP1)) || !(NP + 4 <= MPR1)) || !(pended <= 0)) || !(SKIP2 + 3 <= IPC)) || !(NP == \old(s))) || !(1 <= NP)) - InvariantResult [Line: 350]: Loop Invariant Derived loop invariant: ((((((!(\old(IPC) <= \old(s)) || ((((((((NP + 2 <= SKIP1 && compRegistered == 0) && s == NP) && NP <= 1) && 0 <= status) && SKIP2 + 3 <= IPC) && NP + 4 <= MPR1) && 1 <= NP) && pended <= 0)) || !(\old(s) == \old(MPR3))) || !(\old(SKIP1) == \old(s))) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(NP))) || !(\old(pended) <= 0) - InvariantResult [Line: 385]: Loop Invariant Derived loop invariant: ((((((!(\old(IPC) <= \old(s)) || ((NP + 2 <= SKIP1 && SKIP2 + 3 <= IPC) && pended <= 0)) || !(\old(s) == \old(MPR3))) || !(\old(SKIP1) == \old(s))) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(NP))) || !(\old(pended) <= 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 13 procedures, 151 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 13.6s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 8.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 6.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2162 SDtfs, 3407 SDslu, 2828 SDs, 0 SdLazy, 5133 SolverSat, 925 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 359 GetRequests, 174 SyntacticMatches, 3 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 3.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=217occurred 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.4s AutomataMinimizationTime, 18 MinimizatonAttempts, 186 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 53 LocationsWithAnnotation, 283 PreInvPairs, 349 NumberOfFragments, 3020 HoareAnnotationTreeSize, 283 FomulaSimplifications, 1712 FormulaSimplificationTreeSizeReduction, 0.6s HoareSimplificationTime, 53 FomulaSimplificationsInter, 7182 FormulaSimplificationTreeSizeReductionInter, 5.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 927 NumberOfCodeBlocks, 927 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 909 ConstructedInterpolants, 0 QuantifiedInterpolants, 205803 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, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...