/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 false -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-eb0fd7c [2020-09-21 10:20:11,926 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-09-21 10:20:11,930 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-09-21 10:20:11,957 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-09-21 10:20:11,957 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-09-21 10:20:11,958 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-09-21 10:20:11,960 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-09-21 10:20:11,962 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-09-21 10:20:11,964 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-09-21 10:20:11,965 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-09-21 10:20:11,966 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-09-21 10:20:11,967 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-09-21 10:20:11,967 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-09-21 10:20:11,969 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-09-21 10:20:11,970 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-09-21 10:20:11,971 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-09-21 10:20:11,972 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-09-21 10:20:11,973 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-09-21 10:20:11,975 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-09-21 10:20:11,978 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-09-21 10:20:11,980 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-09-21 10:20:11,981 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-09-21 10:20:11,983 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-09-21 10:20:11,984 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-09-21 10:20:11,987 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-09-21 10:20:11,987 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-09-21 10:20:11,987 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-09-21 10:20:11,989 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-09-21 10:20:11,989 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-09-21 10:20:11,990 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-09-21 10:20:11,991 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-09-21 10:20:11,992 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-09-21 10:20:11,993 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-09-21 10:20:11,994 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-09-21 10:20:11,995 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-09-21 10:20:11,995 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-09-21 10:20:11,996 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-09-21 10:20:11,996 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-09-21 10:20:11,996 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-09-21 10:20:11,998 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-09-21 10:20:11,998 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-09-21 10:20:11,999 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-09-21 10:20:12,033 INFO L113 SettingsManager]: Loading preferences was successful [2020-09-21 10:20:12,033 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-09-21 10:20:12,034 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-09-21 10:20:12,035 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-09-21 10:20:12,035 INFO L138 SettingsManager]: * Use SBE=true [2020-09-21 10:20:12,035 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-09-21 10:20:12,035 INFO L138 SettingsManager]: * sizeof long=4 [2020-09-21 10:20:12,035 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-09-21 10:20:12,036 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-09-21 10:20:12,037 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-09-21 10:20:12,037 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-09-21 10:20:12,037 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-09-21 10:20:12,037 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-09-21 10:20:12,038 INFO L138 SettingsManager]: * sizeof long double=12 [2020-09-21 10:20:12,039 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-09-21 10:20:12,039 INFO L138 SettingsManager]: * Use constant arrays=true [2020-09-21 10:20:12,039 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-09-21 10:20:12,039 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-09-21 10:20:12,040 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-09-21 10:20:12,040 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-09-21 10:20:12,040 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-09-21 10:20:12,040 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-21 10:20:12,040 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-09-21 10:20:12,041 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-09-21 10:20:12,041 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-09-21 10:20:12,041 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-09-21 10:20:12,042 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-09-21 10:20:12,042 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-09-21 10:20:12,042 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-09-21 10:20:12,042 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 -> false [2020-09-21 10:20:12,494 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-09-21 10:20:12,512 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-09-21 10:20:12,517 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-09-21 10:20:12,520 INFO L271 PluginConnector]: Initializing CDTParser... [2020-09-21 10:20:12,520 INFO L275 PluginConnector]: CDTParser initialized [2020-09-21 10:20:12,522 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-09-21 10:20:12,621 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/831934741/617475af60e64524a3e29a724d1cdee5/FLAG3230b8108 [2020-09-21 10:20:13,182 INFO L306 CDTParser]: Found 1 translation units. [2020-09-21 10:20:13,183 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/ntdrivers-simplified/kbfiltr_simpl1.cil.c [2020-09-21 10:20:13,195 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/831934741/617475af60e64524a3e29a724d1cdee5/FLAG3230b8108 [2020-09-21 10:20:13,494 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/831934741/617475af60e64524a3e29a724d1cdee5 [2020-09-21 10:20:13,511 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-09-21 10:20:13,517 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-09-21 10:20:13,521 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-09-21 10:20:13,521 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-09-21 10:20:13,526 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-09-21 10:20:13,527 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.09 10:20:13" (1/1) ... [2020-09-21 10:20:13,532 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f546c9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:20:13, skipping insertion in model container [2020-09-21 10:20:13,532 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.09 10:20:13" (1/1) ... [2020-09-21 10:20:13,543 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-09-21 10:20:13,587 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-09-21 10:20:13,873 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-21 10:20:13,880 INFO L203 MainTranslator]: Completed pre-run [2020-09-21 10:20:13,948 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-21 10:20:14,065 INFO L208 MainTranslator]: Completed translation [2020-09-21 10:20:14,065 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:20:14 WrapperNode [2020-09-21 10:20:14,065 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-09-21 10:20:14,066 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-09-21 10:20:14,066 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-09-21 10:20:14,067 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-09-21 10:20:14,083 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:20:14" (1/1) ... [2020-09-21 10:20:14,083 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:20:14" (1/1) ... [2020-09-21 10:20:14,094 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:20:14" (1/1) ... [2020-09-21 10:20:14,094 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:20:14" (1/1) ... [2020-09-21 10:20:14,118 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:20:14" (1/1) ... [2020-09-21 10:20:14,129 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:20:14" (1/1) ... [2020-09-21 10:20:14,132 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:20:14" (1/1) ... [2020-09-21 10:20:14,137 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-09-21 10:20:14,138 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-09-21 10:20:14,138 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-09-21 10:20:14,138 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-09-21 10:20:14,139 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:20:14" (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-09-21 10:20:14,228 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-09-21 10:20:14,228 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-09-21 10:20:14,229 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2020-09-21 10:20:14,229 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2020-09-21 10:20:14,229 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_PnP [2020-09-21 10:20:14,229 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-09-21 10:20:14,229 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2020-09-21 10:20:14,230 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2020-09-21 10:20:14,230 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2020-09-21 10:20:14,230 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2020-09-21 10:20:14,230 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2020-09-21 10:20:14,230 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_Complete [2020-09-21 10:20:14,230 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2020-09-21 10:20:14,231 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-09-21 10:20:14,231 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2020-09-21 10:20:14,231 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-09-21 10:20:14,231 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2020-09-21 10:20:14,232 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_PnP [2020-09-21 10:20:14,232 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2020-09-21 10:20:14,232 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2020-09-21 10:20:14,232 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2020-09-21 10:20:14,233 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_Complete [2020-09-21 10:20:14,233 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2020-09-21 10:20:14,233 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2020-09-21 10:20:14,233 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2020-09-21 10:20:14,234 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2020-09-21 10:20:14,234 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-09-21 10:20:14,234 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2020-09-21 10:20:14,234 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-09-21 10:20:14,234 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-09-21 10:20:14,516 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-09-21 10:20:14,656 INFO L732 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##14: assume !false; [2020-09-21 10:20:14,656 INFO L732 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##13: assume false; [2020-09-21 10:20:14,658 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-09-21 10:20:14,706 INFO L732 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##8: assume false; [2020-09-21 10:20:14,706 INFO L732 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##9: assume !false; [2020-09-21 10:20:14,723 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-09-21 10:20:14,749 INFO L732 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2020-09-21 10:20:14,750 INFO L732 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2020-09-21 10:20:14,768 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-09-21 10:20:14,902 INFO L732 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##43: assume false; [2020-09-21 10:20:14,902 INFO L732 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##44: assume !false; [2020-09-21 10:20:14,920 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-09-21 10:20:14,921 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-09-21 10:20:14,928 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.09 10:20:14 BoogieIcfgContainer [2020-09-21 10:20:14,928 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-09-21 10:20:14,929 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-09-21 10:20:14,930 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-09-21 10:20:14,934 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-09-21 10:20:14,934 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.09 10:20:13" (1/3) ... [2020-09-21 10:20:14,935 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@159b5301 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.09 10:20:14, skipping insertion in model container [2020-09-21 10:20:14,935 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:20:14" (2/3) ... [2020-09-21 10:20:14,936 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@159b5301 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.09 10:20:14, skipping insertion in model container [2020-09-21 10:20:14,936 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.09 10:20:14" (3/3) ... [2020-09-21 10:20:14,938 INFO L109 eAbstractionObserver]: Analyzing ICFG kbfiltr_simpl1.cil.c [2020-09-21 10:20:14,951 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-09-21 10:20:14,962 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-09-21 10:20:14,981 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-09-21 10:20:15,012 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-09-21 10:20:15,012 INFO L376 AbstractCegarLoop]: Hoare is true [2020-09-21 10:20:15,012 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-09-21 10:20:15,012 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-09-21 10:20:15,013 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-09-21 10:20:15,013 INFO L380 AbstractCegarLoop]: Difference is false [2020-09-21 10:20:15,013 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-09-21 10:20:15,013 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-09-21 10:20:15,043 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states. [2020-09-21 10:20:15,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-09-21 10:20:15,054 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:20:15,055 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-09-21 10:20:15,056 INFO L427 AbstractCegarLoop]: === Iteration 1 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:20:15,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:20:15,064 INFO L82 PathProgramCache]: Analyzing trace with hash -1530382191, now seen corresponding path program 1 times [2020-09-21 10:20:15,074 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:20:15,074 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [866264562] [2020-09-21 10:20:15,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:20:15,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:15,443 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:20:15,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:15,531 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-21 10:20:15,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:15,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-21 10:20:15,577 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [866264562] [2020-09-21 10:20:15,579 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-21 10:20:15,580 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-21 10:20:15,581 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383208120] [2020-09-21 10:20:15,588 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-21 10:20:15,588 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:20:15,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-21 10:20:15,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-09-21 10:20:15,613 INFO L87 Difference]: Start difference. First operand 151 states. Second operand 5 states. [2020-09-21 10:20:16,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:20:16,372 INFO L93 Difference]: Finished difference Result 303 states and 463 transitions. [2020-09-21 10:20:16,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-09-21 10:20:16,375 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2020-09-21 10:20:16,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:20:16,394 INFO L225 Difference]: With dead ends: 303 [2020-09-21 10:20:16,395 INFO L226 Difference]: Without dead ends: 157 [2020-09-21 10:20:16,402 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-09-21 10:20:16,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2020-09-21 10:20:16,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 140. [2020-09-21 10:20:16,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2020-09-21 10:20:16,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 190 transitions. [2020-09-21 10:20:16,515 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 190 transitions. Word has length 20 [2020-09-21 10:20:16,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:20:16,516 INFO L479 AbstractCegarLoop]: Abstraction has 140 states and 190 transitions. [2020-09-21 10:20:16,516 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-21 10:20:16,516 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 190 transitions. [2020-09-21 10:20:16,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-09-21 10:20:16,518 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:20:16,518 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-09-21 10:20:16,519 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-09-21 10:20:16,519 INFO L427 AbstractCegarLoop]: === Iteration 2 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:20:16,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:20:16,520 INFO L82 PathProgramCache]: Analyzing trace with hash 1141575010, now seen corresponding path program 1 times [2020-09-21 10:20:16,520 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:20:16,520 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [228433529] [2020-09-21 10:20:16,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:20:16,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:16,735 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:20:16,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:16,798 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-21 10:20:16,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:16,831 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-21 10:20:16,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:16,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-21 10:20:16,844 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [228433529] [2020-09-21 10:20:16,844 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-21 10:20:16,845 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-09-21 10:20:16,845 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378806129] [2020-09-21 10:20:16,848 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-09-21 10:20:16,848 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:20:16,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-09-21 10:20:16,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-09-21 10:20:16,849 INFO L87 Difference]: Start difference. First operand 140 states and 190 transitions. Second operand 6 states. [2020-09-21 10:20:17,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:20:17,741 INFO L93 Difference]: Finished difference Result 275 states and 370 transitions. [2020-09-21 10:20:17,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-09-21 10:20:17,742 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2020-09-21 10:20:17,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:20:17,746 INFO L225 Difference]: With dead ends: 275 [2020-09-21 10:20:17,746 INFO L226 Difference]: Without dead ends: 219 [2020-09-21 10:20:17,747 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-09-21 10:20:17,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2020-09-21 10:20:17,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 195. [2020-09-21 10:20:17,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2020-09-21 10:20:17,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 259 transitions. [2020-09-21 10:20:17,777 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 259 transitions. Word has length 26 [2020-09-21 10:20:17,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:20:17,778 INFO L479 AbstractCegarLoop]: Abstraction has 195 states and 259 transitions. [2020-09-21 10:20:17,778 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-09-21 10:20:17,778 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 259 transitions. [2020-09-21 10:20:17,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-09-21 10:20:17,779 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:20:17,779 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-09-21 10:20:17,779 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-09-21 10:20:17,779 INFO L427 AbstractCegarLoop]: === Iteration 3 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:20:17,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:20:17,780 INFO L82 PathProgramCache]: Analyzing trace with hash 1029098174, now seen corresponding path program 1 times [2020-09-21 10:20:17,780 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:20:17,780 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [729621320] [2020-09-21 10:20:17,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:20:17,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:17,918 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:20:17,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:17,959 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-21 10:20:17,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:17,983 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-21 10:20:17,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:17,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-21 10:20:17,993 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [729621320] [2020-09-21 10:20:17,993 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-21 10:20:17,994 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-09-21 10:20:17,994 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073191689] [2020-09-21 10:20:17,994 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-09-21 10:20:17,995 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:20:17,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-09-21 10:20:17,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-09-21 10:20:17,996 INFO L87 Difference]: Start difference. First operand 195 states and 259 transitions. Second operand 6 states. [2020-09-21 10:20:18,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:20:18,467 INFO L93 Difference]: Finished difference Result 316 states and 413 transitions. [2020-09-21 10:20:18,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-09-21 10:20:18,468 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2020-09-21 10:20:18,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:20:18,471 INFO L225 Difference]: With dead ends: 316 [2020-09-21 10:20:18,471 INFO L226 Difference]: Without dead ends: 254 [2020-09-21 10:20:18,472 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-09-21 10:20:18,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2020-09-21 10:20:18,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 217. [2020-09-21 10:20:18,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2020-09-21 10:20:18,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 289 transitions. [2020-09-21 10:20:18,505 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 289 transitions. Word has length 27 [2020-09-21 10:20:18,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:20:18,505 INFO L479 AbstractCegarLoop]: Abstraction has 217 states and 289 transitions. [2020-09-21 10:20:18,505 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-09-21 10:20:18,505 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 289 transitions. [2020-09-21 10:20:18,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-09-21 10:20:18,507 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:20:18,508 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-09-21 10:20:18,508 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-09-21 10:20:18,508 INFO L427 AbstractCegarLoop]: === Iteration 4 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:20:18,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:20:18,509 INFO L82 PathProgramCache]: Analyzing trace with hash 742933031, now seen corresponding path program 1 times [2020-09-21 10:20:18,509 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:20:18,510 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [664574877] [2020-09-21 10:20:18,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:20:18,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:18,623 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:20:18,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:18,662 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-21 10:20:18,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:18,688 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-21 10:20:18,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:18,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-21 10:20:18,696 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [664574877] [2020-09-21 10:20:18,696 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-21 10:20:18,696 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-09-21 10:20:18,698 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238831470] [2020-09-21 10:20:18,699 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-09-21 10:20:18,699 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:20:18,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-09-21 10:20:18,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-09-21 10:20:18,700 INFO L87 Difference]: Start difference. First operand 217 states and 289 transitions. Second operand 6 states. [2020-09-21 10:20:19,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:20:19,281 INFO L93 Difference]: Finished difference Result 220 states and 291 transitions. [2020-09-21 10:20:19,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-09-21 10:20:19,282 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 37 [2020-09-21 10:20:19,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:20:19,286 INFO L225 Difference]: With dead ends: 220 [2020-09-21 10:20:19,287 INFO L226 Difference]: Without dead ends: 217 [2020-09-21 10:20:19,287 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-09-21 10:20:19,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2020-09-21 10:20:19,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2020-09-21 10:20:19,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2020-09-21 10:20:19,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 288 transitions. [2020-09-21 10:20:19,321 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 288 transitions. Word has length 37 [2020-09-21 10:20:19,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:20:19,322 INFO L479 AbstractCegarLoop]: Abstraction has 217 states and 288 transitions. [2020-09-21 10:20:19,322 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-09-21 10:20:19,322 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 288 transitions. [2020-09-21 10:20:19,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2020-09-21 10:20:19,324 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:20:19,325 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-09-21 10:20:19,325 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-09-21 10:20:19,325 INFO L427 AbstractCegarLoop]: === Iteration 5 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:20:19,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:20:19,326 INFO L82 PathProgramCache]: Analyzing trace with hash 324263340, now seen corresponding path program 1 times [2020-09-21 10:20:19,326 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:20:19,326 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1156344693] [2020-09-21 10:20:19,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:20:19,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:19,432 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:20:19,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:19,486 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-21 10:20:19,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:19,509 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-21 10:20:19,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:19,526 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-09-21 10:20:19,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:19,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-21 10:20:19,551 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1156344693] [2020-09-21 10:20:19,552 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-21 10:20:19,553 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-09-21 10:20:19,557 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880745982] [2020-09-21 10:20:19,557 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-09-21 10:20:19,557 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:20:19,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-09-21 10:20:19,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-09-21 10:20:19,560 INFO L87 Difference]: Start difference. First operand 217 states and 288 transitions. Second operand 8 states. [2020-09-21 10:20:20,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:20:20,321 INFO L93 Difference]: Finished difference Result 274 states and 356 transitions. [2020-09-21 10:20:20,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-09-21 10:20:20,328 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 45 [2020-09-21 10:20:20,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:20:20,331 INFO L225 Difference]: With dead ends: 274 [2020-09-21 10:20:20,331 INFO L226 Difference]: Without dead ends: 208 [2020-09-21 10:20:20,332 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-09-21 10:20:20,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2020-09-21 10:20:20,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 190. [2020-09-21 10:20:20,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2020-09-21 10:20:20,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 250 transitions. [2020-09-21 10:20:20,362 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 250 transitions. Word has length 45 [2020-09-21 10:20:20,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:20:20,362 INFO L479 AbstractCegarLoop]: Abstraction has 190 states and 250 transitions. [2020-09-21 10:20:20,362 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-09-21 10:20:20,362 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 250 transitions. [2020-09-21 10:20:20,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-09-21 10:20:20,372 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:20:20,372 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-09-21 10:20:20,372 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-09-21 10:20:20,373 INFO L427 AbstractCegarLoop]: === Iteration 6 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:20:20,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:20:20,373 INFO L82 PathProgramCache]: Analyzing trace with hash 726030577, now seen corresponding path program 1 times [2020-09-21 10:20:20,373 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:20:20,376 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1078664665] [2020-09-21 10:20:20,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:20:20,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:20,522 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:20:20,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:20,572 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-21 10:20:20,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:20,602 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-21 10:20:20,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:20,622 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-09-21 10:20:20,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:20,628 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-21 10:20:20,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:20,645 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2020-09-21 10:20:20,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:20,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-21 10:20:20,655 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1078664665] [2020-09-21 10:20:20,656 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-21 10:20:20,656 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-09-21 10:20:20,657 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105606038] [2020-09-21 10:20:20,657 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-09-21 10:20:20,657 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:20:20,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-09-21 10:20:20,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-09-21 10:20:20,658 INFO L87 Difference]: Start difference. First operand 190 states and 250 transitions. Second operand 8 states. [2020-09-21 10:20:21,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:20:21,228 INFO L93 Difference]: Finished difference Result 258 states and 336 transitions. [2020-09-21 10:20:21,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-09-21 10:20:21,229 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 51 [2020-09-21 10:20:21,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:20:21,231 INFO L225 Difference]: With dead ends: 258 [2020-09-21 10:20:21,231 INFO L226 Difference]: Without dead ends: 197 [2020-09-21 10:20:21,232 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2020-09-21 10:20:21,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2020-09-21 10:20:21,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 188. [2020-09-21 10:20:21,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2020-09-21 10:20:21,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 246 transitions. [2020-09-21 10:20:21,249 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 246 transitions. Word has length 51 [2020-09-21 10:20:21,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:20:21,249 INFO L479 AbstractCegarLoop]: Abstraction has 188 states and 246 transitions. [2020-09-21 10:20:21,250 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-09-21 10:20:21,250 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 246 transitions. [2020-09-21 10:20:21,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-09-21 10:20:21,251 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:20:21,251 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-09-21 10:20:21,252 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-09-21 10:20:21,252 INFO L427 AbstractCegarLoop]: === Iteration 7 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:20:21,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:20:21,252 INFO L82 PathProgramCache]: Analyzing trace with hash 572107035, now seen corresponding path program 1 times [2020-09-21 10:20:21,253 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:20:21,253 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1967998628] [2020-09-21 10:20:21,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:20:21,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:21,364 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:20:21,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:21,407 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-21 10:20:21,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:21,437 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-21 10:20:21,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:21,461 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-09-21 10:20:21,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:21,505 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-21 10:20:21,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:21,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-21 10:20:21,519 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1967998628] [2020-09-21 10:20:21,519 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-21 10:20:21,520 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-09-21 10:20:21,520 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52339154] [2020-09-21 10:20:21,520 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-09-21 10:20:21,521 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:20:21,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-09-21 10:20:21,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2020-09-21 10:20:21,521 INFO L87 Difference]: Start difference. First operand 188 states and 246 transitions. Second operand 10 states. [2020-09-21 10:20:22,283 WARN L193 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 59 [2020-09-21 10:20:22,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:20:22,568 INFO L93 Difference]: Finished difference Result 243 states and 316 transitions. [2020-09-21 10:20:22,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-09-21 10:20:22,569 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 50 [2020-09-21 10:20:22,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:20:22,571 INFO L225 Difference]: With dead ends: 243 [2020-09-21 10:20:22,571 INFO L226 Difference]: Without dead ends: 238 [2020-09-21 10:20:22,575 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-09-21 10:20:22,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2020-09-21 10:20:22,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 205. [2020-09-21 10:20:22,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2020-09-21 10:20:22,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 267 transitions. [2020-09-21 10:20:22,599 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 267 transitions. Word has length 50 [2020-09-21 10:20:22,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:20:22,600 INFO L479 AbstractCegarLoop]: Abstraction has 205 states and 267 transitions. [2020-09-21 10:20:22,600 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-09-21 10:20:22,600 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 267 transitions. [2020-09-21 10:20:22,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-09-21 10:20:22,602 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:20:22,602 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-09-21 10:20:22,604 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-09-21 10:20:22,604 INFO L427 AbstractCegarLoop]: === Iteration 8 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:20:22,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:20:22,604 INFO L82 PathProgramCache]: Analyzing trace with hash 176400751, now seen corresponding path program 1 times [2020-09-21 10:20:22,605 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:20:22,605 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1208306999] [2020-09-21 10:20:22,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:20:22,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:22,750 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:20:22,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:22,788 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-21 10:20:22,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:22,823 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-21 10:20:22,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:22,862 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-09-21 10:20:22,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:22,943 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-21 10:20:22,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:22,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-21 10:20:22,979 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1208306999] [2020-09-21 10:20:22,980 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-21 10:20:22,980 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-09-21 10:20:22,980 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108742827] [2020-09-21 10:20:22,981 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-09-21 10:20:22,981 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:20:22,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-09-21 10:20:22,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2020-09-21 10:20:22,983 INFO L87 Difference]: Start difference. First operand 205 states and 267 transitions. Second operand 14 states. [2020-09-21 10:20:24,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:20:24,417 INFO L93 Difference]: Finished difference Result 246 states and 313 transitions. [2020-09-21 10:20:24,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-09-21 10:20:24,418 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 51 [2020-09-21 10:20:24,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:20:24,420 INFO L225 Difference]: With dead ends: 246 [2020-09-21 10:20:24,421 INFO L226 Difference]: Without dead ends: 222 [2020-09-21 10:20:24,422 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=160, Invalid=542, Unknown=0, NotChecked=0, Total=702 [2020-09-21 10:20:24,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2020-09-21 10:20:24,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 188. [2020-09-21 10:20:24,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2020-09-21 10:20:24,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 244 transitions. [2020-09-21 10:20:24,445 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 244 transitions. Word has length 51 [2020-09-21 10:20:24,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:20:24,446 INFO L479 AbstractCegarLoop]: Abstraction has 188 states and 244 transitions. [2020-09-21 10:20:24,446 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-09-21 10:20:24,446 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 244 transitions. [2020-09-21 10:20:24,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-09-21 10:20:24,448 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:20:24,448 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-09-21 10:20:24,448 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-09-21 10:20:24,449 INFO L427 AbstractCegarLoop]: === Iteration 9 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:20:24,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:20:24,449 INFO L82 PathProgramCache]: Analyzing trace with hash 1461171158, now seen corresponding path program 1 times [2020-09-21 10:20:24,449 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:20:24,450 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1089607804] [2020-09-21 10:20:24,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:20:24,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:24,582 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:20:24,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:24,629 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-21 10:20:24,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:24,661 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-21 10:20:24,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:24,699 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-09-21 10:20:24,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:24,742 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-21 10:20:24,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:24,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-21 10:20:24,764 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1089607804] [2020-09-21 10:20:24,770 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-21 10:20:24,771 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-09-21 10:20:24,771 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750862313] [2020-09-21 10:20:24,772 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-09-21 10:20:24,773 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:20:24,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-09-21 10:20:24,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-09-21 10:20:24,774 INFO L87 Difference]: Start difference. First operand 188 states and 244 transitions. Second operand 8 states. [2020-09-21 10:20:25,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:20:25,024 INFO L93 Difference]: Finished difference Result 203 states and 262 transitions. [2020-09-21 10:20:25,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-21 10:20:25,024 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 52 [2020-09-21 10:20:25,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:20:25,026 INFO L225 Difference]: With dead ends: 203 [2020-09-21 10:20:25,026 INFO L226 Difference]: Without dead ends: 91 [2020-09-21 10:20:25,027 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2020-09-21 10:20:25,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2020-09-21 10:20:25,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2020-09-21 10:20:25,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2020-09-21 10:20:25,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 102 transitions. [2020-09-21 10:20:25,041 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 102 transitions. Word has length 52 [2020-09-21 10:20:25,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:20:25,044 INFO L479 AbstractCegarLoop]: Abstraction has 91 states and 102 transitions. [2020-09-21 10:20:25,044 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-09-21 10:20:25,044 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 102 transitions. [2020-09-21 10:20:25,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2020-09-21 10:20:25,046 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:20:25,046 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-09-21 10:20:25,047 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-09-21 10:20:25,047 INFO L427 AbstractCegarLoop]: === Iteration 10 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:20:25,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:20:25,047 INFO L82 PathProgramCache]: Analyzing trace with hash -1516710605, now seen corresponding path program 1 times [2020-09-21 10:20:25,048 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:20:25,049 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1972542137] [2020-09-21 10:20:25,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:20:25,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:25,170 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:20:25,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:25,206 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-21 10:20:25,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:25,237 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-21 10:20:25,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:25,264 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-09-21 10:20:25,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:25,304 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:25,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:25,308 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-21 10:20:25,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:25,322 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-21 10:20:25,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:25,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-21 10:20:25,332 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1972542137] [2020-09-21 10:20:25,332 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-21 10:20:25,332 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-09-21 10:20:25,333 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811770928] [2020-09-21 10:20:25,333 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-09-21 10:20:25,333 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:20:25,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-09-21 10:20:25,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2020-09-21 10:20:25,334 INFO L87 Difference]: Start difference. First operand 91 states and 102 transitions. Second operand 11 states. [2020-09-21 10:20:25,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:20:25,901 INFO L93 Difference]: Finished difference Result 119 states and 135 transitions. [2020-09-21 10:20:25,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-09-21 10:20:25,902 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 59 [2020-09-21 10:20:25,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:20:25,903 INFO L225 Difference]: With dead ends: 119 [2020-09-21 10:20:25,903 INFO L226 Difference]: Without dead ends: 91 [2020-09-21 10:20:25,904 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-09-21 10:20:25,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2020-09-21 10:20:25,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2020-09-21 10:20:25,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2020-09-21 10:20:25,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 101 transitions. [2020-09-21 10:20:25,919 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 101 transitions. Word has length 59 [2020-09-21 10:20:25,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:20:25,919 INFO L479 AbstractCegarLoop]: Abstraction has 91 states and 101 transitions. [2020-09-21 10:20:25,919 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-09-21 10:20:25,920 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 101 transitions. [2020-09-21 10:20:25,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-09-21 10:20:25,921 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:20:25,921 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-09-21 10:20:25,921 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-09-21 10:20:25,921 INFO L427 AbstractCegarLoop]: === Iteration 11 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:20:25,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:20:25,922 INFO L82 PathProgramCache]: Analyzing trace with hash -14076392, now seen corresponding path program 1 times [2020-09-21 10:20:25,922 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:20:25,922 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [390516255] [2020-09-21 10:20:25,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:20:25,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:26,061 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:20:26,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:26,097 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-21 10:20:26,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:26,120 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-21 10:20:26,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:26,135 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-09-21 10:20:26,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:26,167 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:26,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:26,171 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-21 10:20:26,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:26,185 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-21 10:20:26,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:26,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-21 10:20:26,193 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [390516255] [2020-09-21 10:20:26,194 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-21 10:20:26,194 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-09-21 10:20:26,194 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928493234] [2020-09-21 10:20:26,195 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-09-21 10:20:26,195 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:20:26,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-09-21 10:20:26,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2020-09-21 10:20:26,196 INFO L87 Difference]: Start difference. First operand 91 states and 101 transitions. Second operand 9 states. [2020-09-21 10:20:26,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:20:26,418 INFO L93 Difference]: Finished difference Result 122 states and 138 transitions. [2020-09-21 10:20:26,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-09-21 10:20:26,419 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 61 [2020-09-21 10:20:26,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:20:26,420 INFO L225 Difference]: With dead ends: 122 [2020-09-21 10:20:26,420 INFO L226 Difference]: Without dead ends: 94 [2020-09-21 10:20:26,421 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-09-21 10:20:26,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2020-09-21 10:20:26,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2020-09-21 10:20:26,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2020-09-21 10:20:26,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 104 transitions. [2020-09-21 10:20:26,431 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 104 transitions. Word has length 61 [2020-09-21 10:20:26,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:20:26,432 INFO L479 AbstractCegarLoop]: Abstraction has 94 states and 104 transitions. [2020-09-21 10:20:26,432 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-09-21 10:20:26,432 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 104 transitions. [2020-09-21 10:20:26,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-09-21 10:20:26,433 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:20:26,433 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-09-21 10:20:26,433 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-09-21 10:20:26,434 INFO L427 AbstractCegarLoop]: === Iteration 12 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:20:26,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:20:26,434 INFO L82 PathProgramCache]: Analyzing trace with hash -600882406, now seen corresponding path program 1 times [2020-09-21 10:20:26,434 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:20:26,435 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [289715512] [2020-09-21 10:20:26,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:20:26,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:26,552 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:20:26,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:26,589 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-21 10:20:26,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:26,615 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-21 10:20:26,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:26,633 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-09-21 10:20:26,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:26,703 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:26,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:26,707 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-21 10:20:26,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:26,742 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-21 10:20:26,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:26,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-21 10:20:26,755 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [289715512] [2020-09-21 10:20:26,755 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-21 10:20:26,755 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-09-21 10:20:26,756 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059556529] [2020-09-21 10:20:26,756 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-09-21 10:20:26,756 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:20:26,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-09-21 10:20:26,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2020-09-21 10:20:26,757 INFO L87 Difference]: Start difference. First operand 94 states and 104 transitions. Second operand 12 states. [2020-09-21 10:20:27,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:20:27,105 INFO L93 Difference]: Finished difference Result 112 states and 124 transitions. [2020-09-21 10:20:27,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-09-21 10:20:27,106 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 61 [2020-09-21 10:20:27,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:20:27,107 INFO L225 Difference]: With dead ends: 112 [2020-09-21 10:20:27,107 INFO L226 Difference]: Without dead ends: 93 [2020-09-21 10:20:27,110 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-09-21 10:20:27,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2020-09-21 10:20:27,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 89. [2020-09-21 10:20:27,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2020-09-21 10:20:27,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 97 transitions. [2020-09-21 10:20:27,118 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 97 transitions. Word has length 61 [2020-09-21 10:20:27,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:20:27,118 INFO L479 AbstractCegarLoop]: Abstraction has 89 states and 97 transitions. [2020-09-21 10:20:27,119 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-09-21 10:20:27,119 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 97 transitions. [2020-09-21 10:20:27,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2020-09-21 10:20:27,119 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:20:27,119 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-09-21 10:20:27,120 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-09-21 10:20:27,120 INFO L427 AbstractCegarLoop]: === Iteration 13 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:20:27,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:20:27,120 INFO L82 PathProgramCache]: Analyzing trace with hash -673462309, now seen corresponding path program 1 times [2020-09-21 10:20:27,120 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:20:27,120 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [118707225] [2020-09-21 10:20:27,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:20:27,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:27,216 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:20:27,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:27,252 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-21 10:20:27,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:27,273 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-21 10:20:27,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:27,289 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-09-21 10:20:27,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:27,312 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:27,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:27,316 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-21 10:20:27,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:27,329 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-21 10:20:27,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:27,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-21 10:20:27,337 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [118707225] [2020-09-21 10:20:27,337 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-21 10:20:27,337 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-09-21 10:20:27,337 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072237162] [2020-09-21 10:20:27,338 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-09-21 10:20:27,338 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:20:27,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-09-21 10:20:27,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2020-09-21 10:20:27,339 INFO L87 Difference]: Start difference. First operand 89 states and 97 transitions. Second operand 9 states. [2020-09-21 10:20:27,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:20:27,594 INFO L93 Difference]: Finished difference Result 105 states and 114 transitions. [2020-09-21 10:20:27,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-09-21 10:20:27,595 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 62 [2020-09-21 10:20:27,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:20:27,596 INFO L225 Difference]: With dead ends: 105 [2020-09-21 10:20:27,596 INFO L226 Difference]: Without dead ends: 100 [2020-09-21 10:20:27,597 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-09-21 10:20:27,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2020-09-21 10:20:27,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 91. [2020-09-21 10:20:27,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2020-09-21 10:20:27,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 98 transitions. [2020-09-21 10:20:27,612 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 98 transitions. Word has length 62 [2020-09-21 10:20:27,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:20:27,613 INFO L479 AbstractCegarLoop]: Abstraction has 91 states and 98 transitions. [2020-09-21 10:20:27,613 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-09-21 10:20:27,613 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 98 transitions. [2020-09-21 10:20:27,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2020-09-21 10:20:27,614 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:20:27,615 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-09-21 10:20:27,615 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-09-21 10:20:27,615 INFO L427 AbstractCegarLoop]: === Iteration 14 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:20:27,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:20:27,616 INFO L82 PathProgramCache]: Analyzing trace with hash 475938380, now seen corresponding path program 1 times [2020-09-21 10:20:27,616 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:20:27,617 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [562745212] [2020-09-21 10:20:27,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:20:27,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:27,741 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:20:27,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:27,788 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-21 10:20:27,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:27,820 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-21 10:20:27,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:27,843 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-09-21 10:20:27,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:27,901 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:27,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:27,906 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-21 10:20:27,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:27,931 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-21 10:20:27,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:27,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-21 10:20:27,947 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [562745212] [2020-09-21 10:20:27,948 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-21 10:20:27,948 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-09-21 10:20:27,948 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772061631] [2020-09-21 10:20:27,949 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-09-21 10:20:27,949 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:20:27,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-09-21 10:20:27,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2020-09-21 10:20:27,950 INFO L87 Difference]: Start difference. First operand 91 states and 98 transitions. Second operand 12 states. [2020-09-21 10:20:28,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:20:28,297 INFO L93 Difference]: Finished difference Result 98 states and 104 transitions. [2020-09-21 10:20:28,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-09-21 10:20:28,298 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 62 [2020-09-21 10:20:28,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:20:28,299 INFO L225 Difference]: With dead ends: 98 [2020-09-21 10:20:28,299 INFO L226 Difference]: Without dead ends: 91 [2020-09-21 10:20:28,299 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-09-21 10:20:28,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2020-09-21 10:20:28,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2020-09-21 10:20:28,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2020-09-21 10:20:28,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 97 transitions. [2020-09-21 10:20:28,309 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 97 transitions. Word has length 62 [2020-09-21 10:20:28,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:20:28,309 INFO L479 AbstractCegarLoop]: Abstraction has 91 states and 97 transitions. [2020-09-21 10:20:28,309 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-09-21 10:20:28,310 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 97 transitions. [2020-09-21 10:20:28,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-09-21 10:20:28,310 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:20:28,311 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-09-21 10:20:28,311 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-09-21 10:20:28,311 INFO L427 AbstractCegarLoop]: === Iteration 15 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:20:28,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:20:28,311 INFO L82 PathProgramCache]: Analyzing trace with hash 359859562, now seen corresponding path program 1 times [2020-09-21 10:20:28,312 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:20:28,312 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1126951374] [2020-09-21 10:20:28,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:20:28,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:28,431 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:20:28,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:28,470 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-21 10:20:28,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:28,508 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-21 10:20:28,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:28,524 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-09-21 10:20:28,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:28,555 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:28,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:28,563 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-21 10:20:28,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:28,581 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-21 10:20:28,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:28,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-21 10:20:28,590 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1126951374] [2020-09-21 10:20:28,591 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-21 10:20:28,591 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-09-21 10:20:28,591 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287813042] [2020-09-21 10:20:28,591 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-09-21 10:20:28,592 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:20:28,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-09-21 10:20:28,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2020-09-21 10:20:28,592 INFO L87 Difference]: Start difference. First operand 91 states and 97 transitions. Second operand 10 states. [2020-09-21 10:20:28,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:20:28,929 INFO L93 Difference]: Finished difference Result 107 states and 114 transitions. [2020-09-21 10:20:28,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-09-21 10:20:28,930 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 63 [2020-09-21 10:20:28,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:20:28,931 INFO L225 Difference]: With dead ends: 107 [2020-09-21 10:20:28,931 INFO L226 Difference]: Without dead ends: 76 [2020-09-21 10:20:28,934 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2020-09-21 10:20:28,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2020-09-21 10:20:28,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2020-09-21 10:20:28,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2020-09-21 10:20:28,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 79 transitions. [2020-09-21 10:20:28,943 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 79 transitions. Word has length 63 [2020-09-21 10:20:28,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:20:28,944 INFO L479 AbstractCegarLoop]: Abstraction has 76 states and 79 transitions. [2020-09-21 10:20:28,944 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-09-21 10:20:28,944 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 79 transitions. [2020-09-21 10:20:28,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-09-21 10:20:28,945 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:20:28,945 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-09-21 10:20:28,945 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-09-21 10:20:28,945 INFO L427 AbstractCegarLoop]: === Iteration 16 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:20:28,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:20:28,946 INFO L82 PathProgramCache]: Analyzing trace with hash 1228040100, now seen corresponding path program 1 times [2020-09-21 10:20:28,946 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:20:28,946 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [95833137] [2020-09-21 10:20:28,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:20:28,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:29,047 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:20:29,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:29,085 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-21 10:20:29,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:29,107 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-21 10:20:29,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:29,124 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-09-21 10:20:29,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:29,150 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:29,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:29,155 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-21 10:20:29,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:29,172 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-21 10:20:29,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:29,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-21 10:20:29,187 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [95833137] [2020-09-21 10:20:29,187 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-21 10:20:29,187 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-09-21 10:20:29,187 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904607762] [2020-09-21 10:20:29,188 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-09-21 10:20:29,188 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:20:29,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-09-21 10:20:29,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2020-09-21 10:20:29,188 INFO L87 Difference]: Start difference. First operand 76 states and 79 transitions. Second operand 9 states. [2020-09-21 10:20:29,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:20:29,587 INFO L93 Difference]: Finished difference Result 141 states and 146 transitions. [2020-09-21 10:20:29,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-09-21 10:20:29,588 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 63 [2020-09-21 10:20:29,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:20:29,590 INFO L225 Difference]: With dead ends: 141 [2020-09-21 10:20:29,590 INFO L226 Difference]: Without dead ends: 134 [2020-09-21 10:20:29,591 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2020-09-21 10:20:29,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2020-09-21 10:20:29,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 133. [2020-09-21 10:20:29,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2020-09-21 10:20:29,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 138 transitions. [2020-09-21 10:20:29,648 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 138 transitions. Word has length 63 [2020-09-21 10:20:29,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:20:29,649 INFO L479 AbstractCegarLoop]: Abstraction has 133 states and 138 transitions. [2020-09-21 10:20:29,649 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-09-21 10:20:29,649 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 138 transitions. [2020-09-21 10:20:29,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-09-21 10:20:29,651 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:20:29,651 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-09-21 10:20:29,651 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-09-21 10:20:29,652 INFO L427 AbstractCegarLoop]: === Iteration 17 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:20:29,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:20:29,652 INFO L82 PathProgramCache]: Analyzing trace with hash -1291919834, now seen corresponding path program 1 times [2020-09-21 10:20:29,653 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:20:29,653 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1414457211] [2020-09-21 10:20:29,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:20:29,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:29,843 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:20:29,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:29,910 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-21 10:20:29,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:29,948 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-21 10:20:29,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:29,972 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-09-21 10:20:29,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:30,041 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:30,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:30,045 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-21 10:20:30,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:30,064 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-21 10:20:30,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:30,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-21 10:20:30,073 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1414457211] [2020-09-21 10:20:30,073 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-21 10:20:30,074 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-09-21 10:20:30,074 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377092858] [2020-09-21 10:20:30,075 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-09-21 10:20:30,075 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:20:30,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-09-21 10:20:30,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2020-09-21 10:20:30,075 INFO L87 Difference]: Start difference. First operand 133 states and 138 transitions. Second operand 12 states. [2020-09-21 10:20:30,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:20:30,382 INFO L93 Difference]: Finished difference Result 144 states and 149 transitions. [2020-09-21 10:20:30,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-09-21 10:20:30,382 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 63 [2020-09-21 10:20:30,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:20:30,383 INFO L225 Difference]: With dead ends: 144 [2020-09-21 10:20:30,384 INFO L226 Difference]: Without dead ends: 133 [2020-09-21 10:20:30,384 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-09-21 10:20:30,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2020-09-21 10:20:30,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2020-09-21 10:20:30,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2020-09-21 10:20:30,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 136 transitions. [2020-09-21 10:20:30,399 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 136 transitions. Word has length 63 [2020-09-21 10:20:30,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:20:30,399 INFO L479 AbstractCegarLoop]: Abstraction has 133 states and 136 transitions. [2020-09-21 10:20:30,399 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-09-21 10:20:30,400 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 136 transitions. [2020-09-21 10:20:30,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2020-09-21 10:20:30,401 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:20:30,401 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-09-21 10:20:30,401 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-09-21 10:20:30,401 INFO L427 AbstractCegarLoop]: === Iteration 18 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:20:30,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:20:30,402 INFO L82 PathProgramCache]: Analyzing trace with hash 1154361885, now seen corresponding path program 1 times [2020-09-21 10:20:30,402 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:20:30,402 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2017485626] [2020-09-21 10:20:30,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:20:30,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:30,504 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:20:30,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:30,541 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-21 10:20:30,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:30,563 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-21 10:20:30,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:30,577 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-09-21 10:20:30,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:30,604 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:30,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:30,607 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-21 10:20:30,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:30,618 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-21 10:20:30,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:30,647 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2020-09-21 10:20:30,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:30,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-21 10:20:30,674 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2017485626] [2020-09-21 10:20:30,674 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-21 10:20:30,675 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-09-21 10:20:30,677 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660977264] [2020-09-21 10:20:30,679 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-09-21 10:20:30,680 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:20:30,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-09-21 10:20:30,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2020-09-21 10:20:30,680 INFO L87 Difference]: Start difference. First operand 133 states and 136 transitions. Second operand 11 states. [2020-09-21 10:20:30,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:20:30,866 INFO L93 Difference]: Finished difference Result 133 states and 136 transitions. [2020-09-21 10:20:30,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-09-21 10:20:30,867 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 74 [2020-09-21 10:20:30,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:20:30,868 INFO L225 Difference]: With dead ends: 133 [2020-09-21 10:20:30,868 INFO L226 Difference]: Without dead ends: 0 [2020-09-21 10:20:30,869 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2020-09-21 10:20:30,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-09-21 10:20:30,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-09-21 10:20:30,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-09-21 10:20:30,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-09-21 10:20:30,869 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 74 [2020-09-21 10:20:30,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:20:30,872 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-09-21 10:20:30,872 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-09-21 10:20:30,872 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-09-21 10:20:30,872 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-09-21 10:20:30,872 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-09-21 10:20:30,875 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-09-21 10:20:31,444 WARN L193 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 80 [2020-09-21 10:20:33,909 WARN L193 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 52 [2020-09-21 10:20:34,093 WARN L193 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 52 [2020-09-21 10:20:34,470 WARN L193 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 48 [2020-09-21 10:20:34,604 WARN L193 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 27 [2020-09-21 10:20:34,918 WARN L193 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 60 [2020-09-21 10:20:35,167 WARN L193 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 62 [2020-09-21 10:20:35,518 WARN L193 SmtUtils]: Spent 348.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 56 [2020-09-21 10:20:35,785 WARN L193 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 36 [2020-09-21 10:20:36,135 WARN L193 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 50 [2020-09-21 10:20:36,586 WARN L193 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 38 [2020-09-21 10:20:36,818 WARN L193 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 51 [2020-09-21 10:20:37,119 WARN L193 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 53 [2020-09-21 10:20:37,350 WARN L193 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 52 [2020-09-21 10:20:37,531 WARN L193 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 36 [2020-09-21 10:20:38,032 WARN L193 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 58 [2020-09-21 10:20:38,267 WARN L193 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 50 [2020-09-21 10:20:38,430 WARN L193 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 50 [2020-09-21 10:20:38,632 WARN L193 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 57 [2020-09-21 10:20:38,790 WARN L193 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 71 [2020-09-21 10:20:39,096 WARN L193 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 48 [2020-09-21 10:20:39,329 WARN L193 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 50 [2020-09-21 10:20:39,457 WARN L193 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2020-09-21 10:20:39,660 WARN L193 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 50 [2020-09-21 10:20:39,992 WARN L193 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 53 [2020-09-21 10:20:40,194 WARN L193 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 54 [2020-09-21 10:20:40,395 WARN L193 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 38 [2020-09-21 10:20:40,524 WARN L193 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 45 [2020-09-21 10:20:40,702 WARN L193 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 36 [2020-09-21 10:20:40,762 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-09-21 10:20:40,762 INFO L268 CegarLoopResult]: For program point KeSetEventFINAL(lines 513 520) no Hoare annotation was computed. [2020-09-21 10:20:40,762 INFO L268 CegarLoopResult]: For program point KeSetEventEXIT(lines 513 520) no Hoare annotation was computed. [2020-09-21 10:20:40,763 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-09-21 10:20:40,763 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-09-21 10:20:40,763 INFO L268 CegarLoopResult]: For program point L569-1(line 569) no Hoare annotation was computed. [2020-09-21 10:20:40,763 INFO L268 CegarLoopResult]: For program point KbFilter_CompleteFINAL(lines 563 573) no Hoare annotation was computed. [2020-09-21 10:20:40,763 INFO L268 CegarLoopResult]: For program point KbFilter_CompleteEXIT(lines 563 573) no Hoare annotation was computed. [2020-09-21 10:20:40,763 INFO L268 CegarLoopResult]: For program point stub_driver_initEXIT(lines 35 48) no Hoare annotation was computed. [2020-09-21 10:20:40,764 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-09-21 10:20:40,764 INFO L268 CegarLoopResult]: For program point stub_driver_initFINAL(lines 35 48) no Hoare annotation was computed. [2020-09-21 10:20:40,764 INFO L268 CegarLoopResult]: For program point _BLAST_initFINAL(lines 49 70) no Hoare annotation was computed. [2020-09-21 10:20:40,764 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-09-21 10:20:40,764 INFO L268 CegarLoopResult]: For program point _BLAST_initEXIT(lines 49 70) no Hoare annotation was computed. [2020-09-21 10:20:40,764 INFO L271 CegarLoopResult]: At program point errorFnENTRY(lines 575 582) the Hoare annotation is: true [2020-09-21 10:20:40,765 INFO L268 CegarLoopResult]: For program point errorFnFINAL(lines 575 582) no Hoare annotation was computed. [2020-09-21 10:20:40,765 INFO L268 CegarLoopResult]: For program point errorFnEXIT(lines 575 582) no Hoare annotation was computed. [2020-09-21 10:20:40,765 INFO L268 CegarLoopResult]: For program point errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION(line 579) no Hoare annotation was computed. [2020-09-21 10:20:40,765 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-09-21 10:20:40,765 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 286 420) no Hoare annotation was computed. [2020-09-21 10:20:40,765 INFO L268 CegarLoopResult]: For program point L407(lines 407 409) no Hoare annotation was computed. [2020-09-21 10:20:40,765 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-09-21 10:20:40,765 INFO L268 CegarLoopResult]: For program point L383(lines 367 416) no Hoare annotation was computed. [2020-09-21 10:20:40,766 INFO L268 CegarLoopResult]: For program point L350(lines 350 365) no Hoare annotation was computed. [2020-09-21 10:20:40,766 INFO L268 CegarLoopResult]: For program point L384(lines 384 413) no Hoare annotation was computed. [2020-09-21 10:20:40,766 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-09-21 10:20:40,766 INFO L268 CegarLoopResult]: For program point L376(lines 376 380) no Hoare annotation was computed. [2020-09-21 10:20:40,766 INFO L268 CegarLoopResult]: For program point L368(lines 368 372) no Hoare annotation was computed. [2020-09-21 10:20:40,766 INFO L268 CegarLoopResult]: For program point L335(lines 321 366) no Hoare annotation was computed. [2020-09-21 10:20:40,766 INFO L268 CegarLoopResult]: For program point mainFINAL(lines 286 420) no Hoare annotation was computed. [2020-09-21 10:20:40,766 INFO L268 CegarLoopResult]: For program point L385(lines 385 412) no Hoare annotation was computed. [2020-09-21 10:20:40,767 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-09-21 10:20:40,767 INFO L268 CegarLoopResult]: For program point L319-1(lines 295 419) no Hoare annotation was computed. [2020-09-21 10:20:40,767 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-09-21 10:20:40,767 INFO L268 CegarLoopResult]: For program point L402(lines 402 410) no Hoare annotation was computed. [2020-09-21 10:20:40,767 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-09-21 10:20:40,767 INFO L268 CegarLoopResult]: For program point L386(lines 386 392) no Hoare annotation was computed. [2020-09-21 10:20:40,767 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-09-21 10:20:40,767 INFO L268 CegarLoopResult]: For program point L403(lines 403 405) no Hoare annotation was computed. [2020-09-21 10:20:40,767 INFO L268 CegarLoopResult]: For program point L387(lines 387 389) no Hoare annotation was computed. [2020-09-21 10:20:40,768 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-09-21 10:20:40,768 INFO L268 CegarLoopResult]: For program point L338-1(lines 337 347) no Hoare annotation was computed. [2020-09-21 10:20:40,768 INFO L268 CegarLoopResult]: For program point L396(lines 396 400) no Hoare annotation was computed. [2020-09-21 10:20:40,768 INFO L268 CegarLoopResult]: For program point L330(lines 330 333) no Hoare annotation was computed. [2020-09-21 10:20:40,768 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-09-21 10:20:40,768 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-09-21 10:20:40,768 INFO L268 CegarLoopResult]: For program point L357(line 357) no Hoare annotation was computed. [2020-09-21 10:20:40,769 INFO L268 CegarLoopResult]: For program point L477(lines 477 494) no Hoare annotation was computed. [2020-09-21 10:20:40,769 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-09-21 10:20:40,769 INFO L268 CegarLoopResult]: For program point L444-1(line 444) no Hoare annotation was computed. [2020-09-21 10:20:40,769 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-09-21 10:20:40,769 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-09-21 10:20:40,770 INFO L268 CegarLoopResult]: For program point L486(lines 486 493) no Hoare annotation was computed. [2020-09-21 10:20:40,770 INFO L268 CegarLoopResult]: For program point L449(lines 449 472) no Hoare annotation was computed. [2020-09-21 10:20:40,770 INFO L268 CegarLoopResult]: For program point L478(lines 478 484) no Hoare annotation was computed. [2020-09-21 10:20:40,770 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-09-21 10:20:40,770 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-09-21 10:20:40,771 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-09-21 10:20:40,771 INFO L268 CegarLoopResult]: For program point L491-1(lines 473 495) no Hoare annotation was computed. [2020-09-21 10:20:40,771 INFO L268 CegarLoopResult]: For program point L454(lines 454 471) no Hoare annotation was computed. [2020-09-21 10:20:40,771 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-09-21 10:20:40,771 INFO L268 CegarLoopResult]: For program point IofCallDriverFINAL(lines 435 498) no Hoare annotation was computed. [2020-09-21 10:20:40,771 INFO L268 CegarLoopResult]: For program point IofCallDriverEXIT(lines 435 498) no Hoare annotation was computed. [2020-09-21 10:20:40,772 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-09-21 10:20:40,772 INFO L268 CegarLoopResult]: For program point L443(lines 443 446) no Hoare annotation was computed. [2020-09-21 10:20:40,772 INFO L268 CegarLoopResult]: For program point L443-1(lines 443 446) no Hoare annotation was computed. [2020-09-21 10:20:40,772 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-09-21 10:20:40,772 INFO L268 CegarLoopResult]: For program point L429-1(lines 421 434) no Hoare annotation was computed. [2020-09-21 10:20:40,772 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-09-21 10:20:40,772 INFO L268 CegarLoopResult]: For program point stubMoreProcessingRequiredEXIT(lines 421 434) no Hoare annotation was computed. [2020-09-21 10:20:40,773 INFO L268 CegarLoopResult]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2020-09-21 10:20:40,773 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-09-21 10:20:40,773 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-09-21 10:20:40,773 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-09-21 10:20:40,773 INFO L268 CegarLoopResult]: For program point L539(lines 539 543) no Hoare annotation was computed. [2020-09-21 10:20:40,773 INFO L268 CegarLoopResult]: For program point L539-1(lines 526 545) no Hoare annotation was computed. [2020-09-21 10:20:40,774 INFO L268 CegarLoopResult]: For program point KeWaitForSingleObjectEXIT(lines 521 562) no Hoare annotation was computed. [2020-09-21 10:20:40,774 INFO L268 CegarLoopResult]: For program point L527(lines 527 532) no Hoare annotation was computed. [2020-09-21 10:20:40,774 INFO L268 CegarLoopResult]: For program point L548(lines 548 560) no Hoare annotation was computed. [2020-09-21 10:20:40,774 INFO L268 CegarLoopResult]: For program point KeWaitForSingleObjectFINAL(lines 521 562) no Hoare annotation was computed. [2020-09-21 10:20:40,774 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-09-21 10:20:40,774 INFO L268 CegarLoopResult]: For program point L526(lines 526 545) no Hoare annotation was computed. [2020-09-21 10:20:40,775 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-09-21 10:20:40,775 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-09-21 10:20:40,775 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-09-21 10:20:40,775 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-09-21 10:20:40,775 INFO L268 CegarLoopResult]: For program point L507-1(lines 499 512) no Hoare annotation was computed. [2020-09-21 10:20:40,776 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-09-21 10:20:40,776 INFO L268 CegarLoopResult]: For program point L503(lines 503 509) no Hoare annotation was computed. [2020-09-21 10:20:40,776 INFO L268 CegarLoopResult]: For program point IofCompleteRequestEXIT(lines 499 512) no Hoare annotation was computed. [2020-09-21 10:20:40,776 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-09-21 10:20:40,776 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-09-21 10:20:40,776 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-09-21 10:20:40,776 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-09-21 10:20:40,777 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-09-21 10:20:40,777 INFO L268 CegarLoopResult]: For program point L192-1(lines 192 194) no Hoare annotation was computed. [2020-09-21 10:20:40,777 INFO L268 CegarLoopResult]: For program point L151(lines 151 265) no Hoare annotation was computed. [2020-09-21 10:20:40,777 INFO L268 CegarLoopResult]: For program point L118(lines 118 276) no Hoare annotation was computed. [2020-09-21 10:20:40,777 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-09-21 10:20:40,777 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-09-21 10:20:40,778 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-09-21 10:20:40,778 INFO L268 CegarLoopResult]: For program point L234-1(lines 230 236) no Hoare annotation was computed. [2020-09-21 10:20:40,778 INFO L268 CegarLoopResult]: For program point L160(lines 160 262) no Hoare annotation was computed. [2020-09-21 10:20:40,778 INFO L268 CegarLoopResult]: For program point L127(lines 127 273) no Hoare annotation was computed. [2020-09-21 10:20:40,778 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-09-21 10:20:40,779 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-09-21 10:20:40,779 INFO L268 CegarLoopResult]: For program point L218-1(lines 214 220) no Hoare annotation was computed. [2020-09-21 10:20:40,779 INFO L268 CegarLoopResult]: For program point L185-1(lines 185 186) no Hoare annotation was computed. [2020-09-21 10:20:40,779 INFO L268 CegarLoopResult]: For program point L169(lines 169 181) no Hoare annotation was computed. [2020-09-21 10:20:40,779 INFO L268 CegarLoopResult]: For program point L136(lines 136 270) no Hoare annotation was computed. [2020-09-21 10:20:40,779 INFO L268 CegarLoopResult]: For program point L103(lines 103 281) no Hoare annotation was computed. [2020-09-21 10:20:40,779 INFO L271 CegarLoopResult]: At program point L260(lines 164 261) the Hoare annotation is: true [2020-09-21 10:20:40,779 INFO L268 CegarLoopResult]: For program point KbFilter_PnPEXIT(lines 73 285) no Hoare annotation was computed. [2020-09-21 10:20:40,780 INFO L268 CegarLoopResult]: For program point L145(lines 145 267) no Hoare annotation was computed. [2020-09-21 10:20:40,780 INFO L268 CegarLoopResult]: For program point L112(lines 112 278) no Hoare annotation was computed. [2020-09-21 10:20:40,780 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-09-21 10:20:40,780 INFO L268 CegarLoopResult]: For program point L154(lines 154 264) no Hoare annotation was computed. [2020-09-21 10:20:40,780 INFO L268 CegarLoopResult]: For program point L121(lines 121 275) no Hoare annotation was computed. [2020-09-21 10:20:40,780 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-09-21 10:20:40,781 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-09-21 10:20:40,781 INFO L268 CegarLoopResult]: For program point KbFilter_PnPFINAL(lines 73 285) no Hoare annotation was computed. [2020-09-21 10:20:40,781 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-09-21 10:20:40,781 INFO L268 CegarLoopResult]: For program point L130(lines 130 272) no Hoare annotation was computed. [2020-09-21 10:20:40,781 INFO L268 CegarLoopResult]: For program point L139(lines 139 269) no Hoare annotation was computed. [2020-09-21 10:20:40,781 INFO L268 CegarLoopResult]: For program point L106(lines 106 280) no Hoare annotation was computed. [2020-09-21 10:20:40,781 INFO L268 CegarLoopResult]: For program point L230(lines 230 236) no Hoare annotation was computed. [2020-09-21 10:20:40,781 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-09-21 10:20:40,782 INFO L268 CegarLoopResult]: For program point L255-1(lines 255 256) no Hoare annotation was computed. [2020-09-21 10:20:40,782 INFO L268 CegarLoopResult]: For program point L214(lines 214 220) no Hoare annotation was computed. [2020-09-21 10:20:40,782 INFO L268 CegarLoopResult]: For program point L148(lines 148 266) no Hoare annotation was computed. [2020-09-21 10:20:40,782 INFO L268 CegarLoopResult]: For program point L115(lines 115 277) no Hoare annotation was computed. [2020-09-21 10:20:40,782 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-09-21 10:20:40,782 INFO L268 CegarLoopResult]: For program point L198(lines 198 204) no Hoare annotation was computed. [2020-09-21 10:20:40,782 INFO L268 CegarLoopResult]: For program point L190(lines 190 196) no Hoare annotation was computed. [2020-09-21 10:20:40,782 INFO L268 CegarLoopResult]: For program point L157(lines 157 263) no Hoare annotation was computed. [2020-09-21 10:20:40,783 INFO L268 CegarLoopResult]: For program point L124(lines 124 274) no Hoare annotation was computed. [2020-09-21 10:20:40,783 INFO L268 CegarLoopResult]: For program point L190-2(lines 164 259) no Hoare annotation was computed. [2020-09-21 10:20:40,783 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-09-21 10:20:40,783 INFO L268 CegarLoopResult]: For program point L240-1(line 240) no Hoare annotation was computed. [2020-09-21 10:20:40,783 INFO L268 CegarLoopResult]: For program point L174(lines 174 180) no Hoare annotation was computed. [2020-09-21 10:20:40,783 INFO L268 CegarLoopResult]: For program point L174-1(lines 169 181) no Hoare annotation was computed. [2020-09-21 10:20:40,783 INFO L268 CegarLoopResult]: For program point L199(lines 199 203) no Hoare annotation was computed. [2020-09-21 10:20:40,783 INFO L268 CegarLoopResult]: For program point L133(lines 133 271) no Hoare annotation was computed. [2020-09-21 10:20:40,784 INFO L268 CegarLoopResult]: For program point L100(lines 100 282) no Hoare annotation was computed. [2020-09-21 10:20:40,784 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-09-21 10:20:40,784 INFO L268 CegarLoopResult]: For program point L224-1(lines 224 225) no Hoare annotation was computed. [2020-09-21 10:20:40,784 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-09-21 10:20:40,784 INFO L268 CegarLoopResult]: For program point L249-1(lines 245 251) no Hoare annotation was computed. [2020-09-21 10:20:40,784 INFO L268 CegarLoopResult]: For program point L142(lines 142 268) no Hoare annotation was computed. [2020-09-21 10:20:40,784 INFO L268 CegarLoopResult]: For program point L109(lines 109 279) no Hoare annotation was computed. [2020-09-21 10:20:40,785 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-09-21 10:20:40,847 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.09 10:20:40 BoogieIcfgContainer [2020-09-21 10:20:40,847 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-09-21 10:20:40,852 INFO L168 Benchmark]: Toolchain (without parser) took 27336.57 ms. Allocated memory was 138.9 MB in the beginning and 454.6 MB in the end (delta: 315.6 MB). Free memory was 101.7 MB in the beginning and 168.0 MB in the end (delta: -66.3 MB). Peak memory consumption was 313.5 MB. Max. memory is 7.1 GB. [2020-09-21 10:20:40,853 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 138.9 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-09-21 10:20:40,854 INFO L168 Benchmark]: CACSL2BoogieTranslator took 544.97 ms. Allocated memory was 138.9 MB in the beginning and 202.4 MB in the end (delta: 63.4 MB). Free memory was 101.1 MB in the beginning and 180.5 MB in the end (delta: -79.5 MB). Peak memory consumption was 28.7 MB. Max. memory is 7.1 GB. [2020-09-21 10:20:40,854 INFO L168 Benchmark]: Boogie Preprocessor took 71.13 ms. Allocated memory is still 202.4 MB. Free memory was 180.5 MB in the beginning and 178.1 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. [2020-09-21 10:20:40,855 INFO L168 Benchmark]: RCFGBuilder took 790.36 ms. Allocated memory is still 202.4 MB. Free memory was 178.1 MB in the beginning and 132.2 MB in the end (delta: 45.9 MB). Peak memory consumption was 45.9 MB. Max. memory is 7.1 GB. [2020-09-21 10:20:40,855 INFO L168 Benchmark]: TraceAbstraction took 25917.50 ms. Allocated memory was 202.4 MB in the beginning and 454.6 MB in the end (delta: 252.2 MB). Free memory was 131.5 MB in the beginning and 168.0 MB in the end (delta: -36.6 MB). Peak memory consumption was 279.8 MB. Max. memory is 7.1 GB. [2020-09-21 10:20:40,861 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.25 ms. Allocated memory is still 138.9 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 544.97 ms. Allocated memory was 138.9 MB in the beginning and 202.4 MB in the end (delta: 63.4 MB). Free memory was 101.1 MB in the beginning and 180.5 MB in the end (delta: -79.5 MB). Peak memory consumption was 28.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 71.13 ms. Allocated memory is still 202.4 MB. Free memory was 180.5 MB in the beginning and 178.1 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 790.36 ms. Allocated memory is still 202.4 MB. Free memory was 178.1 MB in the beginning and 132.2 MB in the end (delta: 45.9 MB). Peak memory consumption was 45.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 25917.50 ms. Allocated memory was 202.4 MB in the beginning and 454.6 MB in the end (delta: 252.2 MB). Free memory was 131.5 MB in the beginning and 168.0 MB in the end (delta: -36.6 MB). Peak memory consumption was 279.8 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: 15.8s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 9.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 9.8s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2162 SDtfs, 3407 SDslu, 2828 SDs, 0 SdLazy, 5133 SolverSat, 925 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 359 GetRequests, 174 SyntacticMatches, 3 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 4.5s 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, 2.5s HoareSimplificationTime, 53 FomulaSimplificationsInter, 7182 FormulaSimplificationTreeSizeReductionInter, 7.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 4.2s 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...