/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.trace.refinement.strategy FIXED_PREFERENCES --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.smt.solver Internal_SMTInterpol --traceabstraction.compute.trace.for.counterexample.result false --traceabstraction.use.minimal.unsat.core.enumeration true --traceabstraction.additional.smt.options enumeration-timeout=5000 --traceabstraction.additional.smt.options interpolation-heuristic=BIGGEST --traceabstraction.additional.smt.options log-additional-information=true -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-177f698 [2020-08-21 17:20:30,783 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-08-21 17:20:30,786 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-08-21 17:20:30,825 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-08-21 17:20:30,825 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-08-21 17:20:30,834 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-08-21 17:20:30,835 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-08-21 17:20:30,840 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-08-21 17:20:30,841 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-08-21 17:20:30,844 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-08-21 17:20:30,845 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-08-21 17:20:30,846 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-08-21 17:20:30,846 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-08-21 17:20:30,847 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-08-21 17:20:30,850 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-08-21 17:20:30,851 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-08-21 17:20:30,853 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-08-21 17:20:30,855 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-08-21 17:20:30,857 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-08-21 17:20:30,862 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-08-21 17:20:30,864 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-08-21 17:20:30,865 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-08-21 17:20:30,866 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-08-21 17:20:30,867 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-08-21 17:20:30,878 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-08-21 17:20:30,878 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-08-21 17:20:30,878 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-08-21 17:20:30,881 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-08-21 17:20:30,881 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-08-21 17:20:30,883 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-08-21 17:20:30,883 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-08-21 17:20:30,884 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-08-21 17:20:30,884 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-08-21 17:20:30,885 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-08-21 17:20:30,885 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-08-21 17:20:30,886 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-08-21 17:20:30,888 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-08-21 17:20:30,888 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-08-21 17:20:30,889 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-08-21 17:20:30,889 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-08-21 17:20:30,890 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-08-21 17:20:30,893 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-08-21 17:20:30,914 INFO L113 SettingsManager]: Loading preferences was successful [2020-08-21 17:20:30,914 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-08-21 17:20:30,915 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-08-21 17:20:30,916 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-08-21 17:20:30,916 INFO L138 SettingsManager]: * Use SBE=true [2020-08-21 17:20:30,916 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-08-21 17:20:30,916 INFO L138 SettingsManager]: * sizeof long=4 [2020-08-21 17:20:30,916 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-08-21 17:20:30,917 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-08-21 17:20:30,917 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-08-21 17:20:30,917 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-08-21 17:20:30,917 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-08-21 17:20:30,917 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-08-21 17:20:30,918 INFO L138 SettingsManager]: * sizeof long double=12 [2020-08-21 17:20:30,918 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-08-21 17:20:30,918 INFO L138 SettingsManager]: * Use constant arrays=true [2020-08-21 17:20:30,918 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-08-21 17:20:30,918 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-08-21 17:20:30,919 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-08-21 17:20:30,919 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-08-21 17:20:30,919 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-08-21 17:20:30,919 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-08-21 17:20:30,919 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-08-21 17:20:30,920 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-08-21 17:20:30,920 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-08-21 17:20:30,920 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-08-21 17:20:30,920 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-08-21 17:20:30,920 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-08-21 17:20:30,921 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-08-21 17:20:30,921 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> FIXED_PREFERENCES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMT solver -> Internal_SMTInterpol Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute trace for counterexample result -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use minimal unsat core enumeration -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> enumeration-timeout=5000;interpolation-heuristic=BIGGEST;log-additional-information=true; Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> enumeration-timeout=5000;interpolation-heuristic=BIGGEST;log-additional-information=true; Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> enumeration-timeout=5000;interpolation-heuristic=BIGGEST;log-additional-information=true; [2020-08-21 17:20:31,206 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-08-21 17:20:31,224 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-08-21 17:20:31,228 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-08-21 17:20:31,229 INFO L271 PluginConnector]: Initializing CDTParser... [2020-08-21 17:20:31,230 INFO L275 PluginConnector]: CDTParser initialized [2020-08-21 17:20:31,230 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ntdrivers-simplified/kbfiltr_simpl1.cil.c [2020-08-21 17:20:31,283 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/17729256c/db16f5f7d7394d6083d9079ee5521afe/FLAGabcbdf8dd [2020-08-21 17:20:31,772 INFO L306 CDTParser]: Found 1 translation units. [2020-08-21 17:20:31,773 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/ntdrivers-simplified/kbfiltr_simpl1.cil.c [2020-08-21 17:20:31,783 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/17729256c/db16f5f7d7394d6083d9079ee5521afe/FLAGabcbdf8dd [2020-08-21 17:20:32,100 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/17729256c/db16f5f7d7394d6083d9079ee5521afe [2020-08-21 17:20:32,109 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-08-21 17:20:32,110 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-08-21 17:20:32,111 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-08-21 17:20:32,111 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-08-21 17:20:32,115 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-08-21 17:20:32,115 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.08 05:20:32" (1/1) ... [2020-08-21 17:20:32,118 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c1aa6c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 05:20:32, skipping insertion in model container [2020-08-21 17:20:32,118 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.08 05:20:32" (1/1) ... [2020-08-21 17:20:32,126 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-08-21 17:20:32,184 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-08-21 17:20:32,457 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-21 17:20:32,463 INFO L203 MainTranslator]: Completed pre-run [2020-08-21 17:20:32,600 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-21 17:20:32,621 INFO L208 MainTranslator]: Completed translation [2020-08-21 17:20:32,621 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 05:20:32 WrapperNode [2020-08-21 17:20:32,624 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-08-21 17:20:32,625 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-08-21 17:20:32,625 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-08-21 17:20:32,625 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-08-21 17:20:32,639 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 05:20:32" (1/1) ... [2020-08-21 17:20:32,641 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 05:20:32" (1/1) ... [2020-08-21 17:20:32,650 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 05:20:32" (1/1) ... [2020-08-21 17:20:32,650 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 05:20:32" (1/1) ... [2020-08-21 17:20:32,662 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 05:20:32" (1/1) ... [2020-08-21 17:20:32,670 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 05:20:32" (1/1) ... [2020-08-21 17:20:32,673 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 05:20:32" (1/1) ... [2020-08-21 17:20:32,678 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-08-21 17:20:32,678 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-08-21 17:20:32,678 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-08-21 17:20:32,678 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-08-21 17:20:32,679 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 05:20:32" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-08-21 17:20:32,737 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-08-21 17:20:32,737 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-08-21 17:20:32,737 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2020-08-21 17:20:32,738 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2020-08-21 17:20:32,738 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_PnP [2020-08-21 17:20:32,738 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-08-21 17:20:32,738 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2020-08-21 17:20:32,738 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2020-08-21 17:20:32,738 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2020-08-21 17:20:32,739 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2020-08-21 17:20:32,739 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2020-08-21 17:20:32,739 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_Complete [2020-08-21 17:20:32,739 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2020-08-21 17:20:32,740 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-08-21 17:20:32,740 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2020-08-21 17:20:32,740 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-08-21 17:20:32,740 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2020-08-21 17:20:32,740 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_PnP [2020-08-21 17:20:32,741 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2020-08-21 17:20:32,741 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2020-08-21 17:20:32,741 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2020-08-21 17:20:32,741 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_Complete [2020-08-21 17:20:32,741 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2020-08-21 17:20:32,741 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2020-08-21 17:20:32,742 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2020-08-21 17:20:32,742 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2020-08-21 17:20:32,742 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-08-21 17:20:32,742 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2020-08-21 17:20:32,742 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-08-21 17:20:32,742 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-08-21 17:20:32,970 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-08-21 17:20:33,095 INFO L732 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##14: assume !false; [2020-08-21 17:20:33,096 INFO L732 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##13: assume false; [2020-08-21 17:20:33,098 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-08-21 17:20:33,138 INFO L732 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##8: assume false; [2020-08-21 17:20:33,138 INFO L732 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##9: assume !false; [2020-08-21 17:20:33,153 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-08-21 17:20:33,178 INFO L732 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2020-08-21 17:20:33,179 INFO L732 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2020-08-21 17:20:33,200 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-08-21 17:20:33,361 INFO L732 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##43: assume false; [2020-08-21 17:20:33,361 INFO L732 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##44: assume !false; [2020-08-21 17:20:33,376 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-08-21 17:20:33,377 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-08-21 17:20:33,382 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.08 05:20:33 BoogieIcfgContainer [2020-08-21 17:20:33,382 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-08-21 17:20:33,384 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-08-21 17:20:33,384 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-08-21 17:20:33,387 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-08-21 17:20:33,387 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.08 05:20:32" (1/3) ... [2020-08-21 17:20:33,388 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4111814 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.08 05:20:33, skipping insertion in model container [2020-08-21 17:20:33,388 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 05:20:32" (2/3) ... [2020-08-21 17:20:33,389 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4111814 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.08 05:20:33, skipping insertion in model container [2020-08-21 17:20:33,389 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.08 05:20:33" (3/3) ... [2020-08-21 17:20:33,391 INFO L109 eAbstractionObserver]: Analyzing ICFG kbfiltr_simpl1.cil.c [2020-08-21 17:20:33,401 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-08-21 17:20:33,410 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-08-21 17:20:33,424 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-08-21 17:20:33,450 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-08-21 17:20:33,450 INFO L376 AbstractCegarLoop]: Hoare is true [2020-08-21 17:20:33,451 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-08-21 17:20:33,451 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-08-21 17:20:33,451 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-08-21 17:20:33,451 INFO L380 AbstractCegarLoop]: Difference is false [2020-08-21 17:20:33,452 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-08-21 17:20:33,452 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-08-21 17:20:33,474 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states. [2020-08-21 17:20:33,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-08-21 17:20:33,482 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 17:20:33,483 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-21 17:20:33,484 INFO L427 AbstractCegarLoop]: === Iteration 1 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 17:20:33,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 17:20:33,490 INFO L82 PathProgramCache]: Analyzing trace with hash -1530382191, now seen corresponding path program 1 times [2020-08-21 17:20:33,498 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 17:20:33,499 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1238882180] [2020-08-21 17:20:33,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 17:20:33,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:20:33,841 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 17:20:33,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:20:33,902 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-21 17:20:33,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:20:33,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-21 17:20:33,929 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1238882180] [2020-08-21 17:20:33,930 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-21 17:20:33,931 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-08-21 17:20:33,932 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978121670] [2020-08-21 17:20:33,954 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-08-21 17:20:33,955 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 17:20:33,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-08-21 17:20:33,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-08-21 17:20:33,967 INFO L87 Difference]: Start difference. First operand 151 states. Second operand 5 states. [2020-08-21 17:20:34,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 17:20:34,609 INFO L93 Difference]: Finished difference Result 303 states and 463 transitions. [2020-08-21 17:20:34,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-08-21 17:20:34,612 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2020-08-21 17:20:34,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 17:20:34,637 INFO L225 Difference]: With dead ends: 303 [2020-08-21 17:20:34,638 INFO L226 Difference]: Without dead ends: 157 [2020-08-21 17:20:34,649 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-08-21 17:20:34,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2020-08-21 17:20:34,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 140. [2020-08-21 17:20:34,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2020-08-21 17:20:34,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 190 transitions. [2020-08-21 17:20:34,751 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 190 transitions. Word has length 20 [2020-08-21 17:20:34,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 17:20:34,751 INFO L479 AbstractCegarLoop]: Abstraction has 140 states and 190 transitions. [2020-08-21 17:20:34,751 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-08-21 17:20:34,752 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 190 transitions. [2020-08-21 17:20:34,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-08-21 17:20:34,753 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 17:20:34,754 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-21 17:20:34,754 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-08-21 17:20:34,754 INFO L427 AbstractCegarLoop]: === Iteration 2 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 17:20:34,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 17:20:34,755 INFO L82 PathProgramCache]: Analyzing trace with hash 1141575010, now seen corresponding path program 1 times [2020-08-21 17:20:34,755 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 17:20:34,756 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1222734229] [2020-08-21 17:20:34,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 17:20:34,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:20:35,011 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 17:20:35,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:20:35,057 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-21 17:20:35,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:20:35,105 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-21 17:20:35,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:20:35,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-21 17:20:35,115 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1222734229] [2020-08-21 17:20:35,116 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-21 17:20:35,116 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-08-21 17:20:35,116 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211599659] [2020-08-21 17:20:35,119 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-08-21 17:20:35,120 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 17:20:35,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-08-21 17:20:35,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-08-21 17:20:35,121 INFO L87 Difference]: Start difference. First operand 140 states and 190 transitions. Second operand 6 states. [2020-08-21 17:20:35,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 17:20:35,834 INFO L93 Difference]: Finished difference Result 275 states and 370 transitions. [2020-08-21 17:20:35,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-08-21 17:20:35,835 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2020-08-21 17:20:35,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 17:20:35,838 INFO L225 Difference]: With dead ends: 275 [2020-08-21 17:20:35,840 INFO L226 Difference]: Without dead ends: 219 [2020-08-21 17:20:35,841 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-08-21 17:20:35,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2020-08-21 17:20:35,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 195. [2020-08-21 17:20:35,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2020-08-21 17:20:35,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 259 transitions. [2020-08-21 17:20:35,901 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 259 transitions. Word has length 26 [2020-08-21 17:20:35,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 17:20:35,903 INFO L479 AbstractCegarLoop]: Abstraction has 195 states and 259 transitions. [2020-08-21 17:20:35,903 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-08-21 17:20:35,903 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 259 transitions. [2020-08-21 17:20:35,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-08-21 17:20:35,904 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 17:20:35,904 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-21 17:20:35,904 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-08-21 17:20:35,904 INFO L427 AbstractCegarLoop]: === Iteration 3 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 17:20:35,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 17:20:35,905 INFO L82 PathProgramCache]: Analyzing trace with hash 1029098174, now seen corresponding path program 1 times [2020-08-21 17:20:35,905 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 17:20:35,905 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1798105400] [2020-08-21 17:20:35,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 17:20:35,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:20:36,027 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 17:20:36,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:20:36,072 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-21 17:20:36,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:20:36,094 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-21 17:20:36,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:20:36,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-21 17:20:36,102 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1798105400] [2020-08-21 17:20:36,102 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-21 17:20:36,102 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-08-21 17:20:36,103 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600922531] [2020-08-21 17:20:36,103 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-08-21 17:20:36,103 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 17:20:36,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-08-21 17:20:36,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-08-21 17:20:36,104 INFO L87 Difference]: Start difference. First operand 195 states and 259 transitions. Second operand 6 states. [2020-08-21 17:20:36,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 17:20:36,512 INFO L93 Difference]: Finished difference Result 316 states and 413 transitions. [2020-08-21 17:20:36,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-08-21 17:20:36,513 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2020-08-21 17:20:36,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 17:20:36,517 INFO L225 Difference]: With dead ends: 316 [2020-08-21 17:20:36,519 INFO L226 Difference]: Without dead ends: 254 [2020-08-21 17:20:36,520 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-08-21 17:20:36,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2020-08-21 17:20:36,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 217. [2020-08-21 17:20:36,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2020-08-21 17:20:36,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 289 transitions. [2020-08-21 17:20:36,583 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 289 transitions. Word has length 27 [2020-08-21 17:20:36,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 17:20:36,583 INFO L479 AbstractCegarLoop]: Abstraction has 217 states and 289 transitions. [2020-08-21 17:20:36,583 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-08-21 17:20:36,584 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 289 transitions. [2020-08-21 17:20:36,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-08-21 17:20:36,588 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 17:20:36,589 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-21 17:20:36,589 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-08-21 17:20:36,589 INFO L427 AbstractCegarLoop]: === Iteration 4 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 17:20:36,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 17:20:36,590 INFO L82 PathProgramCache]: Analyzing trace with hash 742933031, now seen corresponding path program 1 times [2020-08-21 17:20:36,590 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 17:20:36,590 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1242731672] [2020-08-21 17:20:36,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 17:20:36,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:20:36,692 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 17:20:36,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:20:36,728 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-21 17:20:36,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:20:36,749 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-21 17:20:36,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:20:36,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-21 17:20:36,756 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1242731672] [2020-08-21 17:20:36,756 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-21 17:20:36,756 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-08-21 17:20:36,756 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180007479] [2020-08-21 17:20:36,757 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-08-21 17:20:36,757 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 17:20:36,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-08-21 17:20:36,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-08-21 17:20:36,758 INFO L87 Difference]: Start difference. First operand 217 states and 289 transitions. Second operand 6 states. [2020-08-21 17:20:37,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 17:20:37,280 INFO L93 Difference]: Finished difference Result 220 states and 291 transitions. [2020-08-21 17:20:37,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-08-21 17:20:37,280 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 37 [2020-08-21 17:20:37,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 17:20:37,282 INFO L225 Difference]: With dead ends: 220 [2020-08-21 17:20:37,283 INFO L226 Difference]: Without dead ends: 217 [2020-08-21 17:20:37,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-08-21 17:20:37,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2020-08-21 17:20:37,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2020-08-21 17:20:37,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2020-08-21 17:20:37,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 288 transitions. [2020-08-21 17:20:37,321 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 288 transitions. Word has length 37 [2020-08-21 17:20:37,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 17:20:37,321 INFO L479 AbstractCegarLoop]: Abstraction has 217 states and 288 transitions. [2020-08-21 17:20:37,321 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-08-21 17:20:37,321 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 288 transitions. [2020-08-21 17:20:37,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2020-08-21 17:20:37,331 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 17:20:37,331 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-21 17:20:37,331 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-08-21 17:20:37,331 INFO L427 AbstractCegarLoop]: === Iteration 5 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 17:20:37,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 17:20:37,332 INFO L82 PathProgramCache]: Analyzing trace with hash 324263340, now seen corresponding path program 1 times [2020-08-21 17:20:37,332 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 17:20:37,332 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [796266285] [2020-08-21 17:20:37,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 17:20:37,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:20:37,448 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 17:20:37,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:20:37,487 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-21 17:20:37,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:20:37,506 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-21 17:20:37,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:20:37,519 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-08-21 17:20:37,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:20:37,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-21 17:20:37,537 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [796266285] [2020-08-21 17:20:37,537 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-21 17:20:37,538 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-08-21 17:20:37,538 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144777486] [2020-08-21 17:20:37,538 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-08-21 17:20:37,539 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 17:20:37,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-08-21 17:20:37,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-08-21 17:20:37,539 INFO L87 Difference]: Start difference. First operand 217 states and 288 transitions. Second operand 8 states. [2020-08-21 17:20:38,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 17:20:38,179 INFO L93 Difference]: Finished difference Result 274 states and 356 transitions. [2020-08-21 17:20:38,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-08-21 17:20:38,186 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 45 [2020-08-21 17:20:38,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 17:20:38,188 INFO L225 Difference]: With dead ends: 274 [2020-08-21 17:20:38,188 INFO L226 Difference]: Without dead ends: 208 [2020-08-21 17:20:38,189 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2020-08-21 17:20:38,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2020-08-21 17:20:38,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 190. [2020-08-21 17:20:38,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2020-08-21 17:20:38,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 250 transitions. [2020-08-21 17:20:38,210 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 250 transitions. Word has length 45 [2020-08-21 17:20:38,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 17:20:38,212 INFO L479 AbstractCegarLoop]: Abstraction has 190 states and 250 transitions. [2020-08-21 17:20:38,212 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-08-21 17:20:38,212 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 250 transitions. [2020-08-21 17:20:38,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-08-21 17:20:38,214 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 17:20:38,215 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-21 17:20:38,215 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-08-21 17:20:38,215 INFO L427 AbstractCegarLoop]: === Iteration 6 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 17:20:38,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 17:20:38,215 INFO L82 PathProgramCache]: Analyzing trace with hash 726030577, now seen corresponding path program 1 times [2020-08-21 17:20:38,216 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 17:20:38,216 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2108135147] [2020-08-21 17:20:38,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 17:20:38,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:20:38,328 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 17:20:38,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:20:38,365 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-21 17:20:38,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:20:38,386 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-21 17:20:38,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:20:38,397 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-08-21 17:20:38,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:20:38,400 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-21 17:20:38,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:20:38,413 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2020-08-21 17:20:38,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:20:38,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-21 17:20:38,423 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2108135147] [2020-08-21 17:20:38,424 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-21 17:20:38,424 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-08-21 17:20:38,424 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309904469] [2020-08-21 17:20:38,425 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-08-21 17:20:38,425 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 17:20:38,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-08-21 17:20:38,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-08-21 17:20:38,426 INFO L87 Difference]: Start difference. First operand 190 states and 250 transitions. Second operand 8 states. [2020-08-21 17:20:38,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 17:20:38,890 INFO L93 Difference]: Finished difference Result 258 states and 336 transitions. [2020-08-21 17:20:38,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-08-21 17:20:38,890 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 51 [2020-08-21 17:20:38,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 17:20:38,894 INFO L225 Difference]: With dead ends: 258 [2020-08-21 17:20:38,894 INFO L226 Difference]: Without dead ends: 197 [2020-08-21 17:20:38,895 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2020-08-21 17:20:38,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2020-08-21 17:20:38,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 188. [2020-08-21 17:20:38,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2020-08-21 17:20:38,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 246 transitions. [2020-08-21 17:20:38,919 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 246 transitions. Word has length 51 [2020-08-21 17:20:38,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 17:20:38,920 INFO L479 AbstractCegarLoop]: Abstraction has 188 states and 246 transitions. [2020-08-21 17:20:38,920 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-08-21 17:20:38,920 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 246 transitions. [2020-08-21 17:20:38,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-08-21 17:20:38,922 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 17:20:38,922 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-21 17:20:38,923 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-08-21 17:20:38,923 INFO L427 AbstractCegarLoop]: === Iteration 7 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 17:20:38,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 17:20:38,923 INFO L82 PathProgramCache]: Analyzing trace with hash 572107035, now seen corresponding path program 1 times [2020-08-21 17:20:38,923 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 17:20:38,925 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1026179785] [2020-08-21 17:20:38,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 17:20:38,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:20:39,021 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 17:20:39,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:20:39,056 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-21 17:20:39,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:20:39,078 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-21 17:20:39,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:20:39,097 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-08-21 17:20:39,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:20:39,133 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-21 17:20:39,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:20:39,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-21 17:20:39,148 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1026179785] [2020-08-21 17:20:39,148 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-21 17:20:39,148 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-08-21 17:20:39,148 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759211065] [2020-08-21 17:20:39,149 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-08-21 17:20:39,149 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 17:20:39,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-08-21 17:20:39,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2020-08-21 17:20:39,150 INFO L87 Difference]: Start difference. First operand 188 states and 246 transitions. Second operand 10 states. [2020-08-21 17:20:39,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 17:20:39,984 INFO L93 Difference]: Finished difference Result 243 states and 316 transitions. [2020-08-21 17:20:39,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-08-21 17:20:39,985 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 50 [2020-08-21 17:20:39,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 17:20:39,987 INFO L225 Difference]: With dead ends: 243 [2020-08-21 17:20:39,987 INFO L226 Difference]: Without dead ends: 238 [2020-08-21 17:20:39,988 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2020-08-21 17:20:39,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2020-08-21 17:20:40,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 205. [2020-08-21 17:20:40,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2020-08-21 17:20:40,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 267 transitions. [2020-08-21 17:20:40,005 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 267 transitions. Word has length 50 [2020-08-21 17:20:40,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 17:20:40,005 INFO L479 AbstractCegarLoop]: Abstraction has 205 states and 267 transitions. [2020-08-21 17:20:40,006 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-08-21 17:20:40,006 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 267 transitions. [2020-08-21 17:20:40,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-08-21 17:20:40,007 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 17:20:40,007 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-21 17:20:40,007 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-08-21 17:20:40,007 INFO L427 AbstractCegarLoop]: === Iteration 8 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 17:20:40,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 17:20:40,008 INFO L82 PathProgramCache]: Analyzing trace with hash 176400751, now seen corresponding path program 1 times [2020-08-21 17:20:40,008 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 17:20:40,008 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1124442067] [2020-08-21 17:20:40,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 17:20:40,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:20:40,083 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 17:20:40,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:20:40,118 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-21 17:20:40,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:20:40,158 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-21 17:20:40,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:20:40,186 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-08-21 17:20:40,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:20:40,243 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-21 17:20:40,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:20:40,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-21 17:20:40,271 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1124442067] [2020-08-21 17:20:40,271 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-21 17:20:40,271 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-08-21 17:20:40,272 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199264027] [2020-08-21 17:20:40,272 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-08-21 17:20:40,273 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 17:20:40,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-08-21 17:20:40,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2020-08-21 17:20:40,273 INFO L87 Difference]: Start difference. First operand 205 states and 267 transitions. Second operand 14 states. [2020-08-21 17:20:41,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 17:20:41,513 INFO L93 Difference]: Finished difference Result 246 states and 313 transitions. [2020-08-21 17:20:41,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-08-21 17:20:41,514 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 51 [2020-08-21 17:20:41,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 17:20:41,516 INFO L225 Difference]: With dead ends: 246 [2020-08-21 17:20:41,516 INFO L226 Difference]: Without dead ends: 222 [2020-08-21 17:20:41,517 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=160, Invalid=542, Unknown=0, NotChecked=0, Total=702 [2020-08-21 17:20:41,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2020-08-21 17:20:41,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 188. [2020-08-21 17:20:41,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2020-08-21 17:20:41,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 244 transitions. [2020-08-21 17:20:41,532 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 244 transitions. Word has length 51 [2020-08-21 17:20:41,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 17:20:41,533 INFO L479 AbstractCegarLoop]: Abstraction has 188 states and 244 transitions. [2020-08-21 17:20:41,533 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-08-21 17:20:41,533 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 244 transitions. [2020-08-21 17:20:41,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-08-21 17:20:41,534 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 17:20:41,534 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-21 17:20:41,534 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-08-21 17:20:41,534 INFO L427 AbstractCegarLoop]: === Iteration 9 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 17:20:41,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 17:20:41,535 INFO L82 PathProgramCache]: Analyzing trace with hash 1461171158, now seen corresponding path program 1 times [2020-08-21 17:20:41,535 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 17:20:41,535 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1118711501] [2020-08-21 17:20:41,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 17:20:41,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:20:41,606 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 17:20:41,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:20:41,645 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-21 17:20:41,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:20:41,664 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-21 17:20:41,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:20:41,687 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-08-21 17:20:41,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:20:41,723 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-21 17:20:41,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:20:41,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-21 17:20:41,732 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1118711501] [2020-08-21 17:20:41,733 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-21 17:20:41,733 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-08-21 17:20:41,733 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140977685] [2020-08-21 17:20:41,735 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-08-21 17:20:41,735 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 17:20:41,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-08-21 17:20:41,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-08-21 17:20:41,738 INFO L87 Difference]: Start difference. First operand 188 states and 244 transitions. Second operand 8 states. [2020-08-21 17:20:41,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 17:20:41,997 INFO L93 Difference]: Finished difference Result 203 states and 262 transitions. [2020-08-21 17:20:41,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-08-21 17:20:41,997 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 52 [2020-08-21 17:20:41,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 17:20:41,998 INFO L225 Difference]: With dead ends: 203 [2020-08-21 17:20:41,999 INFO L226 Difference]: Without dead ends: 91 [2020-08-21 17:20:41,999 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2020-08-21 17:20:42,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2020-08-21 17:20:42,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2020-08-21 17:20:42,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2020-08-21 17:20:42,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 102 transitions. [2020-08-21 17:20:42,008 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 102 transitions. Word has length 52 [2020-08-21 17:20:42,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 17:20:42,008 INFO L479 AbstractCegarLoop]: Abstraction has 91 states and 102 transitions. [2020-08-21 17:20:42,008 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-08-21 17:20:42,009 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 102 transitions. [2020-08-21 17:20:42,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2020-08-21 17:20:42,009 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 17:20:42,010 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-21 17:20:42,010 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-08-21 17:20:42,010 INFO L427 AbstractCegarLoop]: === Iteration 10 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 17:20:42,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 17:20:42,010 INFO L82 PathProgramCache]: Analyzing trace with hash -1516710605, now seen corresponding path program 1 times [2020-08-21 17:20:42,010 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 17:20:42,011 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1129011387] [2020-08-21 17:20:42,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 17:20:42,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:20:42,081 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 17:20:42,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:20:42,123 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-21 17:20:42,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:20:42,159 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-21 17:20:42,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:20:42,176 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-08-21 17:20:42,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:20:42,211 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-21 17:20:42,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:20:42,213 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-21 17:20:42,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:20:42,226 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-21 17:20:42,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:20:42,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-21 17:20:42,237 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1129011387] [2020-08-21 17:20:42,237 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-21 17:20:42,237 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-08-21 17:20:42,238 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404658091] [2020-08-21 17:20:42,238 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-08-21 17:20:42,238 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 17:20:42,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-08-21 17:20:42,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2020-08-21 17:20:42,239 INFO L87 Difference]: Start difference. First operand 91 states and 102 transitions. Second operand 11 states. [2020-08-21 17:20:42,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 17:20:42,673 INFO L93 Difference]: Finished difference Result 119 states and 135 transitions. [2020-08-21 17:20:42,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-08-21 17:20:42,673 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 59 [2020-08-21 17:20:42,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 17:20:42,674 INFO L225 Difference]: With dead ends: 119 [2020-08-21 17:20:42,674 INFO L226 Difference]: Without dead ends: 91 [2020-08-21 17:20:42,675 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2020-08-21 17:20:42,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2020-08-21 17:20:42,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2020-08-21 17:20:42,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2020-08-21 17:20:42,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 101 transitions. [2020-08-21 17:20:42,689 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 101 transitions. Word has length 59 [2020-08-21 17:20:42,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 17:20:42,689 INFO L479 AbstractCegarLoop]: Abstraction has 91 states and 101 transitions. [2020-08-21 17:20:42,689 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-08-21 17:20:42,689 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 101 transitions. [2020-08-21 17:20:42,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-08-21 17:20:42,690 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 17:20:42,690 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-21 17:20:42,690 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-08-21 17:20:42,690 INFO L427 AbstractCegarLoop]: === Iteration 11 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 17:20:42,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 17:20:42,691 INFO L82 PathProgramCache]: Analyzing trace with hash -14076392, now seen corresponding path program 1 times [2020-08-21 17:20:42,691 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 17:20:42,691 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [643350587] [2020-08-21 17:20:42,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 17:20:42,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:20:42,779 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 17:20:42,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:20:42,814 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-21 17:20:42,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:20:42,833 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-21 17:20:42,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:20:42,846 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-08-21 17:20:42,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:20:42,877 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-21 17:20:42,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:20:42,880 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-21 17:20:42,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:20:42,890 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-21 17:20:42,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:20:42,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-21 17:20:42,898 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [643350587] [2020-08-21 17:20:42,899 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-21 17:20:42,899 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-08-21 17:20:42,899 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060998268] [2020-08-21 17:20:42,900 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-08-21 17:20:42,900 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 17:20:42,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-08-21 17:20:42,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2020-08-21 17:20:42,901 INFO L87 Difference]: Start difference. First operand 91 states and 101 transitions. Second operand 9 states. [2020-08-21 17:20:43,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 17:20:43,080 INFO L93 Difference]: Finished difference Result 122 states and 138 transitions. [2020-08-21 17:20:43,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-08-21 17:20:43,080 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 61 [2020-08-21 17:20:43,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 17:20:43,081 INFO L225 Difference]: With dead ends: 122 [2020-08-21 17:20:43,082 INFO L226 Difference]: Without dead ends: 94 [2020-08-21 17:20:43,082 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2020-08-21 17:20:43,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2020-08-21 17:20:43,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2020-08-21 17:20:43,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2020-08-21 17:20:43,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 104 transitions. [2020-08-21 17:20:43,092 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 104 transitions. Word has length 61 [2020-08-21 17:20:43,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 17:20:43,092 INFO L479 AbstractCegarLoop]: Abstraction has 94 states and 104 transitions. [2020-08-21 17:20:43,093 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-08-21 17:20:43,093 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 104 transitions. [2020-08-21 17:20:43,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-08-21 17:20:43,093 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 17:20:43,094 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-21 17:20:43,094 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-08-21 17:20:43,094 INFO L427 AbstractCegarLoop]: === Iteration 12 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 17:20:43,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 17:20:43,094 INFO L82 PathProgramCache]: Analyzing trace with hash -600882406, now seen corresponding path program 1 times [2020-08-21 17:20:43,095 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 17:20:43,095 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1946387929] [2020-08-21 17:20:43,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 17:20:43,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:20:43,164 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 17:20:43,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:20:43,197 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-21 17:20:43,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:20:43,217 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-21 17:20:43,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:20:43,231 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-08-21 17:20:43,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:20:43,271 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-21 17:20:43,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:20:43,274 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-21 17:20:43,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:20:43,287 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-21 17:20:43,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:20:43,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-21 17:20:43,293 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1946387929] [2020-08-21 17:20:43,294 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-21 17:20:43,294 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-08-21 17:20:43,294 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173971290] [2020-08-21 17:20:43,294 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-08-21 17:20:43,295 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 17:20:43,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-08-21 17:20:43,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2020-08-21 17:20:43,295 INFO L87 Difference]: Start difference. First operand 94 states and 104 transitions. Second operand 12 states. [2020-08-21 17:20:43,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 17:20:43,622 INFO L93 Difference]: Finished difference Result 112 states and 124 transitions. [2020-08-21 17:20:43,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-08-21 17:20:43,623 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 61 [2020-08-21 17:20:43,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 17:20:43,626 INFO L225 Difference]: With dead ends: 112 [2020-08-21 17:20:43,626 INFO L226 Difference]: Without dead ends: 93 [2020-08-21 17:20:43,626 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2020-08-21 17:20:43,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2020-08-21 17:20:43,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 89. [2020-08-21 17:20:43,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2020-08-21 17:20:43,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 97 transitions. [2020-08-21 17:20:43,636 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 97 transitions. Word has length 61 [2020-08-21 17:20:43,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 17:20:43,636 INFO L479 AbstractCegarLoop]: Abstraction has 89 states and 97 transitions. [2020-08-21 17:20:43,636 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-08-21 17:20:43,636 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 97 transitions. [2020-08-21 17:20:43,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2020-08-21 17:20:43,637 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 17:20:43,637 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-21 17:20:43,637 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-08-21 17:20:43,637 INFO L427 AbstractCegarLoop]: === Iteration 13 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 17:20:43,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 17:20:43,638 INFO L82 PathProgramCache]: Analyzing trace with hash -673462309, now seen corresponding path program 1 times [2020-08-21 17:20:43,638 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 17:20:43,638 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [358602309] [2020-08-21 17:20:43,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 17:20:43,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:20:43,722 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 17:20:43,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:20:43,753 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-21 17:20:43,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:20:43,772 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-21 17:20:43,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:20:43,784 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-08-21 17:20:43,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:20:43,799 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-21 17:20:43,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:20:43,801 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-21 17:20:43,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:20:43,816 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-21 17:20:43,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:20:43,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-21 17:20:43,823 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [358602309] [2020-08-21 17:20:43,823 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-21 17:20:43,823 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-08-21 17:20:43,823 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191525673] [2020-08-21 17:20:43,824 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-08-21 17:20:43,824 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 17:20:43,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-08-21 17:20:43,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2020-08-21 17:20:43,825 INFO L87 Difference]: Start difference. First operand 89 states and 97 transitions. Second operand 9 states. [2020-08-21 17:20:43,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 17:20:43,986 INFO L93 Difference]: Finished difference Result 105 states and 114 transitions. [2020-08-21 17:20:43,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-08-21 17:20:43,986 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 62 [2020-08-21 17:20:43,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 17:20:43,987 INFO L225 Difference]: With dead ends: 105 [2020-08-21 17:20:43,987 INFO L226 Difference]: Without dead ends: 100 [2020-08-21 17:20:43,988 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-08-21 17:20:43,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2020-08-21 17:20:43,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 91. [2020-08-21 17:20:43,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2020-08-21 17:20:43,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 98 transitions. [2020-08-21 17:20:43,996 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 98 transitions. Word has length 62 [2020-08-21 17:20:43,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 17:20:43,996 INFO L479 AbstractCegarLoop]: Abstraction has 91 states and 98 transitions. [2020-08-21 17:20:43,996 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-08-21 17:20:43,996 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 98 transitions. [2020-08-21 17:20:43,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2020-08-21 17:20:43,997 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 17:20:43,997 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-21 17:20:43,998 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-08-21 17:20:43,998 INFO L427 AbstractCegarLoop]: === Iteration 14 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 17:20:43,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 17:20:43,998 INFO L82 PathProgramCache]: Analyzing trace with hash 475938380, now seen corresponding path program 1 times [2020-08-21 17:20:43,998 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 17:20:43,999 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [747214193] [2020-08-21 17:20:43,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 17:20:44,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:20:44,069 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 17:20:44,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:20:44,103 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-21 17:20:44,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:20:44,123 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-21 17:20:44,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:20:44,136 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-08-21 17:20:44,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:20:44,192 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-21 17:20:44,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:20:44,196 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-21 17:20:44,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:20:44,216 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-21 17:20:44,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:20:44,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-21 17:20:44,225 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [747214193] [2020-08-21 17:20:44,226 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-21 17:20:44,226 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-08-21 17:20:44,226 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934377844] [2020-08-21 17:20:44,227 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-08-21 17:20:44,227 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 17:20:44,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-08-21 17:20:44,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2020-08-21 17:20:44,228 INFO L87 Difference]: Start difference. First operand 91 states and 98 transitions. Second operand 12 states. [2020-08-21 17:20:44,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 17:20:44,614 INFO L93 Difference]: Finished difference Result 98 states and 104 transitions. [2020-08-21 17:20:44,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-08-21 17:20:44,615 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 62 [2020-08-21 17:20:44,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 17:20:44,617 INFO L225 Difference]: With dead ends: 98 [2020-08-21 17:20:44,617 INFO L226 Difference]: Without dead ends: 91 [2020-08-21 17:20:44,617 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2020-08-21 17:20:44,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2020-08-21 17:20:44,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2020-08-21 17:20:44,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2020-08-21 17:20:44,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 97 transitions. [2020-08-21 17:20:44,633 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 97 transitions. Word has length 62 [2020-08-21 17:20:44,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 17:20:44,633 INFO L479 AbstractCegarLoop]: Abstraction has 91 states and 97 transitions. [2020-08-21 17:20:44,634 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-08-21 17:20:44,634 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 97 transitions. [2020-08-21 17:20:44,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-08-21 17:20:44,635 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 17:20:44,635 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-21 17:20:44,636 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-08-21 17:20:44,636 INFO L427 AbstractCegarLoop]: === Iteration 15 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 17:20:44,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 17:20:44,636 INFO L82 PathProgramCache]: Analyzing trace with hash 359859562, now seen corresponding path program 1 times [2020-08-21 17:20:44,637 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 17:20:44,637 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1943279400] [2020-08-21 17:20:44,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 17:20:44,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:20:44,781 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 17:20:44,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:20:44,832 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-21 17:20:44,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:20:44,865 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-21 17:20:44,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:20:44,886 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-08-21 17:20:44,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:20:44,905 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-21 17:20:44,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:20:44,910 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-21 17:20:44,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:20:44,928 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-21 17:20:44,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:20:44,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-21 17:20:44,945 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1943279400] [2020-08-21 17:20:44,946 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-21 17:20:44,946 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-08-21 17:20:44,946 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238973948] [2020-08-21 17:20:44,947 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-08-21 17:20:44,947 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 17:20:44,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-08-21 17:20:44,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2020-08-21 17:20:44,948 INFO L87 Difference]: Start difference. First operand 91 states and 97 transitions. Second operand 10 states. [2020-08-21 17:20:45,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 17:20:45,235 INFO L93 Difference]: Finished difference Result 107 states and 114 transitions. [2020-08-21 17:20:45,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-08-21 17:20:45,236 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 63 [2020-08-21 17:20:45,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 17:20:45,237 INFO L225 Difference]: With dead ends: 107 [2020-08-21 17:20:45,237 INFO L226 Difference]: Without dead ends: 76 [2020-08-21 17:20:45,238 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-08-21 17:20:45,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2020-08-21 17:20:45,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2020-08-21 17:20:45,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2020-08-21 17:20:45,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 79 transitions. [2020-08-21 17:20:45,247 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 79 transitions. Word has length 63 [2020-08-21 17:20:45,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 17:20:45,247 INFO L479 AbstractCegarLoop]: Abstraction has 76 states and 79 transitions. [2020-08-21 17:20:45,247 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-08-21 17:20:45,247 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 79 transitions. [2020-08-21 17:20:45,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-08-21 17:20:45,248 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 17:20:45,248 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-21 17:20:45,249 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-08-21 17:20:45,249 INFO L427 AbstractCegarLoop]: === Iteration 16 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 17:20:45,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 17:20:45,249 INFO L82 PathProgramCache]: Analyzing trace with hash 1228040100, now seen corresponding path program 1 times [2020-08-21 17:20:45,249 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 17:20:45,250 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [211659987] [2020-08-21 17:20:45,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 17:20:45,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:20:45,313 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 17:20:45,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:20:45,345 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-21 17:20:45,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:20:45,364 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-21 17:20:45,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:20:45,376 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-08-21 17:20:45,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:20:45,390 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-21 17:20:45,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:20:45,393 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-21 17:20:45,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:20:45,403 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-21 17:20:45,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:20:45,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-21 17:20:45,411 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [211659987] [2020-08-21 17:20:45,412 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-21 17:20:45,412 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-08-21 17:20:45,412 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784464414] [2020-08-21 17:20:45,412 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-08-21 17:20:45,413 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 17:20:45,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-08-21 17:20:45,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2020-08-21 17:20:45,413 INFO L87 Difference]: Start difference. First operand 76 states and 79 transitions. Second operand 9 states. [2020-08-21 17:20:45,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 17:20:45,661 INFO L93 Difference]: Finished difference Result 141 states and 146 transitions. [2020-08-21 17:20:45,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-08-21 17:20:45,661 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 63 [2020-08-21 17:20:45,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 17:20:45,664 INFO L225 Difference]: With dead ends: 141 [2020-08-21 17:20:45,664 INFO L226 Difference]: Without dead ends: 134 [2020-08-21 17:20:45,665 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2020-08-21 17:20:45,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2020-08-21 17:20:45,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 133. [2020-08-21 17:20:45,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2020-08-21 17:20:45,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 138 transitions. [2020-08-21 17:20:45,678 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 138 transitions. Word has length 63 [2020-08-21 17:20:45,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 17:20:45,679 INFO L479 AbstractCegarLoop]: Abstraction has 133 states and 138 transitions. [2020-08-21 17:20:45,679 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-08-21 17:20:45,679 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 138 transitions. [2020-08-21 17:20:45,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-08-21 17:20:45,680 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 17:20:45,680 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-21 17:20:45,680 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-08-21 17:20:45,680 INFO L427 AbstractCegarLoop]: === Iteration 17 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 17:20:45,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 17:20:45,681 INFO L82 PathProgramCache]: Analyzing trace with hash -1291919834, now seen corresponding path program 1 times [2020-08-21 17:20:45,681 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 17:20:45,681 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1340613534] [2020-08-21 17:20:45,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 17:20:45,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:20:45,788 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 17:20:45,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:20:45,823 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-21 17:20:45,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:20:45,848 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-21 17:20:45,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:20:45,869 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-08-21 17:20:45,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:20:45,921 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-21 17:20:45,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:20:45,924 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-21 17:20:45,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:20:45,941 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-21 17:20:45,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:20:45,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-21 17:20:45,960 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1340613534] [2020-08-21 17:20:45,960 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-21 17:20:45,960 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-08-21 17:20:45,960 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094400333] [2020-08-21 17:20:45,961 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-08-21 17:20:45,961 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 17:20:45,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-08-21 17:20:45,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2020-08-21 17:20:45,962 INFO L87 Difference]: Start difference. First operand 133 states and 138 transitions. Second operand 12 states. [2020-08-21 17:20:46,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 17:20:46,265 INFO L93 Difference]: Finished difference Result 144 states and 149 transitions. [2020-08-21 17:20:46,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-08-21 17:20:46,266 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 63 [2020-08-21 17:20:46,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 17:20:46,267 INFO L225 Difference]: With dead ends: 144 [2020-08-21 17:20:46,267 INFO L226 Difference]: Without dead ends: 133 [2020-08-21 17:20:46,268 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2020-08-21 17:20:46,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2020-08-21 17:20:46,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2020-08-21 17:20:46,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2020-08-21 17:20:46,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 136 transitions. [2020-08-21 17:20:46,284 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 136 transitions. Word has length 63 [2020-08-21 17:20:46,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 17:20:46,284 INFO L479 AbstractCegarLoop]: Abstraction has 133 states and 136 transitions. [2020-08-21 17:20:46,285 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-08-21 17:20:46,285 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 136 transitions. [2020-08-21 17:20:46,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2020-08-21 17:20:46,286 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 17:20:46,287 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-21 17:20:46,287 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-08-21 17:20:46,287 INFO L427 AbstractCegarLoop]: === Iteration 18 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 17:20:46,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 17:20:46,287 INFO L82 PathProgramCache]: Analyzing trace with hash 1154361885, now seen corresponding path program 1 times [2020-08-21 17:20:46,288 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 17:20:46,288 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1193741855] [2020-08-21 17:20:46,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 17:20:46,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:20:46,367 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 17:20:46,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:20:46,399 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-21 17:20:46,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:20:46,417 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-21 17:20:46,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:20:46,430 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-08-21 17:20:46,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:20:46,455 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-21 17:20:46,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:20:46,458 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-21 17:20:46,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:20:46,467 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-21 17:20:46,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:20:46,486 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2020-08-21 17:20:46,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:20:46,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-21 17:20:46,501 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1193741855] [2020-08-21 17:20:46,501 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-21 17:20:46,501 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-08-21 17:20:46,501 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394284280] [2020-08-21 17:20:46,504 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-08-21 17:20:46,505 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 17:20:46,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-08-21 17:20:46,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2020-08-21 17:20:46,506 INFO L87 Difference]: Start difference. First operand 133 states and 136 transitions. Second operand 11 states. [2020-08-21 17:20:46,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 17:20:46,692 INFO L93 Difference]: Finished difference Result 133 states and 136 transitions. [2020-08-21 17:20:46,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-08-21 17:20:46,693 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 74 [2020-08-21 17:20:46,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 17:20:46,693 INFO L225 Difference]: With dead ends: 133 [2020-08-21 17:20:46,693 INFO L226 Difference]: Without dead ends: 0 [2020-08-21 17:20:46,694 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2020-08-21 17:20:46,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-08-21 17:20:46,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-08-21 17:20:46,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-08-21 17:20:46,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-08-21 17:20:46,695 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 74 [2020-08-21 17:20:46,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 17:20:46,695 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-08-21 17:20:46,695 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-08-21 17:20:46,695 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-08-21 17:20:46,695 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-08-21 17:20:46,696 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-08-21 17:20:46,698 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-08-21 17:20:47,487 WARN L193 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 52 [2020-08-21 17:20:47,649 WARN L193 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 52 [2020-08-21 17:20:47,958 WARN L193 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 48 [2020-08-21 17:20:48,279 WARN L193 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 60 [2020-08-21 17:20:48,452 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 62 [2020-08-21 17:20:48,718 WARN L193 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 56 [2020-08-21 17:20:48,922 WARN L193 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 36 [2020-08-21 17:20:49,173 WARN L193 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 50 [2020-08-21 17:20:49,489 WARN L193 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 38 [2020-08-21 17:20:49,657 WARN L193 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 51 [2020-08-21 17:20:49,872 WARN L193 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 53 [2020-08-21 17:20:50,051 WARN L193 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 52 [2020-08-21 17:20:50,190 WARN L193 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 36 [2020-08-21 17:20:50,564 WARN L193 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 58 [2020-08-21 17:20:50,738 WARN L193 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 50 [2020-08-21 17:20:50,866 WARN L193 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 50 [2020-08-21 17:20:51,012 WARN L193 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 57 [2020-08-21 17:20:51,123 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 71 [2020-08-21 17:20:51,346 WARN L193 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 48 [2020-08-21 17:20:51,505 WARN L193 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 50 [2020-08-21 17:20:51,769 WARN L193 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 50 [2020-08-21 17:20:52,039 WARN L193 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 53 [2020-08-21 17:20:52,172 WARN L193 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 54 [2020-08-21 17:20:52,554 WARN L193 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 36 [2020-08-21 17:20:52,602 INFO L264 CegarLoopResult]: At program point KeSetEventENTRY(lines 513 520) the Hoare annotation is: (or (not (<= (+ ~s~0 2) ~SKIP1~0)) (not (<= 1 ~compRegistered~0)) (not (<= ~NP~0 1)) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~pended~0 0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (<= 1 ~NP~0)) (not (= ~s~0 ~NP~0))) [2020-08-21 17:20:52,602 INFO L268 CegarLoopResult]: For program point KeSetEventFINAL(lines 513 520) no Hoare annotation was computed. [2020-08-21 17:20:52,602 INFO L268 CegarLoopResult]: For program point KeSetEventEXIT(lines 513 520) no Hoare annotation was computed. [2020-08-21 17:20:52,603 INFO L264 CegarLoopResult]: At program point KbFilter_CompleteENTRY(lines 563 573) the Hoare annotation is: (or (not (<= (+ ~s~0 2) ~SKIP1~0)) (not (<= 1 ~compRegistered~0)) (not (<= ~NP~0 1)) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~pended~0 0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (<= 1 ~NP~0)) (not (= ~s~0 ~NP~0))) [2020-08-21 17:20:52,603 INFO L264 CegarLoopResult]: At program point L569(line 569) the Hoare annotation is: (or (not (<= (+ ~s~0 2) ~SKIP1~0)) (not (<= 1 ~compRegistered~0)) (not (<= ~NP~0 1)) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~pended~0 0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (<= 1 ~NP~0)) (not (= ~s~0 ~NP~0))) [2020-08-21 17:20:52,603 INFO L268 CegarLoopResult]: For program point L569-1(line 569) no Hoare annotation was computed. [2020-08-21 17:20:52,603 INFO L268 CegarLoopResult]: For program point KbFilter_CompleteFINAL(lines 563 573) no Hoare annotation was computed. [2020-08-21 17:20:52,604 INFO L268 CegarLoopResult]: For program point KbFilter_CompleteEXIT(lines 563 573) no Hoare annotation was computed. [2020-08-21 17:20:52,604 INFO L268 CegarLoopResult]: For program point stub_driver_initEXIT(lines 35 48) no Hoare annotation was computed. [2020-08-21 17:20:52,604 INFO L264 CegarLoopResult]: At program point stub_driver_initENTRY(lines 35 48) the Hoare annotation is: (or (not (<= ~NP~0 1)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (and (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |old(~compRegistered~0)| ~compRegistered~0) (= ~pended~0 |old(~pended~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~compFptr~0 |old(~compFptr~0)|) (= ~s~0 ~NP~0) (= |old(~customIrp~0)| ~customIrp~0)) (not (= |old(~compRegistered~0)| 0)) (not (= ~NP~0 |old(~s~0)|)) (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= 1 ~NP~0)) (not (<= |old(~pended~0)| 0))) [2020-08-21 17:20:52,604 INFO L268 CegarLoopResult]: For program point stub_driver_initFINAL(lines 35 48) no Hoare annotation was computed. [2020-08-21 17:20:52,604 INFO L268 CegarLoopResult]: For program point _BLAST_initFINAL(lines 49 70) no Hoare annotation was computed. [2020-08-21 17:20:52,605 INFO L264 CegarLoopResult]: At program point _BLAST_initENTRY(lines 49 70) the Hoare annotation is: (or (not (<= |old(~IPC~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (and (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 ~NP~0) (= ~MPR3~0 |old(~MPR3~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~IPC~0 |old(~IPC~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~DC~0 |old(~DC~0)|) (= |old(~compRegistered~0)| ~compRegistered~0) (= ~pended~0 |old(~pended~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~compFptr~0 |old(~compFptr~0)|) (= ~SKIP1~0 ~s~0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (<= |old(~pended~0)| 0))) [2020-08-21 17:20:52,605 INFO L268 CegarLoopResult]: For program point _BLAST_initEXIT(lines 49 70) no Hoare annotation was computed. [2020-08-21 17:20:52,605 INFO L271 CegarLoopResult]: At program point errorFnENTRY(lines 575 582) the Hoare annotation is: true [2020-08-21 17:20:52,605 INFO L268 CegarLoopResult]: For program point errorFnFINAL(lines 575 582) no Hoare annotation was computed. [2020-08-21 17:20:52,605 INFO L268 CegarLoopResult]: For program point errorFnEXIT(lines 575 582) no Hoare annotation was computed. [2020-08-21 17:20:52,605 INFO L268 CegarLoopResult]: For program point errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION(line 579) no Hoare annotation was computed. [2020-08-21 17:20:52,605 INFO L264 CegarLoopResult]: At program point L382(lines 375 415) the Hoare annotation is: (or (not (<= |old(~IPC~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (and (<= (+ ~NP~0 2) ~SKIP1~0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= ~pended~0 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (<= |old(~pended~0)| 0))) [2020-08-21 17:20:52,606 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 286 420) no Hoare annotation was computed. [2020-08-21 17:20:52,606 INFO L268 CegarLoopResult]: For program point L407(lines 407 409) no Hoare annotation was computed. [2020-08-21 17:20:52,606 INFO L264 CegarLoopResult]: At program point L374(lines 367 416) the Hoare annotation is: (or (not (<= |old(~IPC~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (and (<= (+ ~NP~0 2) ~SKIP1~0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= ~pended~0 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (<= |old(~pended~0)| 0))) [2020-08-21 17:20:52,606 INFO L268 CegarLoopResult]: For program point L383(lines 367 416) no Hoare annotation was computed. [2020-08-21 17:20:52,606 INFO L268 CegarLoopResult]: For program point L350(lines 350 365) no Hoare annotation was computed. [2020-08-21 17:20:52,606 INFO L268 CegarLoopResult]: For program point L384(lines 384 413) no Hoare annotation was computed. [2020-08-21 17:20:52,606 INFO L264 CegarLoopResult]: At program point L351(lines 350 365) the Hoare annotation is: (or (not (<= |old(~IPC~0)| |old(~s~0)|)) (and (<= (+ ~NP~0 2) ~SKIP1~0) (= ~compRegistered~0 0) (= ~s~0 ~NP~0) (<= ~NP~0 1) (<= 0 main_~status~1) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ ~NP~0 4) ~MPR1~0) (<= 1 ~NP~0) (<= ~pended~0 0)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (<= |old(~pended~0)| 0))) [2020-08-21 17:20:52,607 INFO L268 CegarLoopResult]: For program point L376(lines 376 380) no Hoare annotation was computed. [2020-08-21 17:20:52,607 INFO L268 CegarLoopResult]: For program point L368(lines 368 372) no Hoare annotation was computed. [2020-08-21 17:20:52,607 INFO L268 CegarLoopResult]: For program point L335(lines 321 366) no Hoare annotation was computed. [2020-08-21 17:20:52,607 INFO L268 CegarLoopResult]: For program point mainFINAL(lines 286 420) no Hoare annotation was computed. [2020-08-21 17:20:52,607 INFO L268 CegarLoopResult]: For program point L385(lines 385 412) no Hoare annotation was computed. [2020-08-21 17:20:52,607 INFO L264 CegarLoopResult]: At program point L319(line 319) the Hoare annotation is: (or (not (<= |old(~IPC~0)| |old(~s~0)|)) (and (= ~MPR3~0 ~s~0) (= ~compRegistered~0 0) (= ~s~0 ~NP~0) (= ~SKIP1~0 ~s~0) (<= ~IPC~0 ~s~0) (<= 0 main_~status~1) (= ~MPR1~0 ~NP~0) (<= ~pended~0 0)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (<= |old(~pended~0)| 0))) [2020-08-21 17:20:52,607 INFO L268 CegarLoopResult]: For program point L319-1(lines 295 419) no Hoare annotation was computed. [2020-08-21 17:20:52,608 INFO L264 CegarLoopResult]: At program point mainENTRY(lines 286 420) the Hoare annotation is: (or (not (<= |old(~IPC~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (and (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 ~NP~0) (= |old(~Executive~0)| ~Executive~0) (= ~MPR3~0 |old(~MPR3~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~KernelMode~0 |old(~KernelMode~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~IPC~0 |old(~IPC~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~DC~0 |old(~DC~0)|) (= |old(~compRegistered~0)| ~compRegistered~0) (= ~pended~0 |old(~pended~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~compFptr~0 |old(~compFptr~0)|) (= ~SKIP1~0 ~s~0) (= ~myStatus~0 |old(~myStatus~0)|)) (not (<= |old(~pended~0)| 0))) [2020-08-21 17:20:52,608 INFO L268 CegarLoopResult]: For program point L402(lines 402 410) no Hoare annotation was computed. [2020-08-21 17:20:52,608 INFO L264 CegarLoopResult]: At program point L394(lines 385 412) the Hoare annotation is: (or (not (<= |old(~IPC~0)| |old(~s~0)|)) (and (<= (+ ~NP~0 2) ~SKIP1~0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= ~pended~0 0)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (<= |old(~pended~0)| 0))) [2020-08-21 17:20:52,608 INFO L268 CegarLoopResult]: For program point L386(lines 386 392) no Hoare annotation was computed. [2020-08-21 17:20:52,608 INFO L264 CegarLoopResult]: At program point L353(lines 352 365) the Hoare annotation is: (or (not (<= |old(~IPC~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (<= 0 main_~status~1) (not (= |old(~s~0)| |old(~NP~0)|)) (not (<= |old(~pended~0)| 0))) [2020-08-21 17:20:52,608 INFO L268 CegarLoopResult]: For program point L403(lines 403 405) no Hoare annotation was computed. [2020-08-21 17:20:52,608 INFO L268 CegarLoopResult]: For program point L387(lines 387 389) no Hoare annotation was computed. [2020-08-21 17:20:52,609 INFO L264 CegarLoopResult]: At program point L321(lines 295 419) the Hoare annotation is: (or (not (<= |old(~IPC~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (and (<= (+ ~NP~0 2) ~SKIP1~0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= ~pended~0 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (<= |old(~pended~0)| 0))) [2020-08-21 17:20:52,609 INFO L268 CegarLoopResult]: For program point L338-1(lines 337 347) no Hoare annotation was computed. [2020-08-21 17:20:52,609 INFO L268 CegarLoopResult]: For program point L396(lines 396 400) no Hoare annotation was computed. [2020-08-21 17:20:52,609 INFO L268 CegarLoopResult]: For program point L330(lines 330 333) no Hoare annotation was computed. [2020-08-21 17:20:52,609 INFO L264 CegarLoopResult]: At program point L330-2(lines 330 333) the Hoare annotation is: (or (not (<= |old(~IPC~0)| |old(~s~0)|)) (and (<= (+ ~NP~0 2) ~SKIP1~0) (= ~compRegistered~0 0) (= ~s~0 ~NP~0) (<= ~NP~0 1) (<= 0 main_~status~1) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ ~NP~0 4) ~MPR1~0) (<= 1 ~NP~0) (<= ~pended~0 0)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (<= |old(~pended~0)| 0))) [2020-08-21 17:20:52,609 INFO L264 CegarLoopResult]: At program point L398(line 398) the Hoare annotation is: (or (not (<= |old(~IPC~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (<= |old(~pended~0)| 0))) [2020-08-21 17:20:52,609 INFO L268 CegarLoopResult]: For program point L357(line 357) no Hoare annotation was computed. [2020-08-21 17:20:52,610 INFO L268 CegarLoopResult]: For program point L477(lines 477 494) no Hoare annotation was computed. [2020-08-21 17:20:52,610 INFO L264 CegarLoopResult]: At program point L444(line 444) the Hoare annotation is: (let ((.cse0 (not (<= ~pended~0 0))) (.cse1 (not (<= (+ ~SKIP2~0 3) ~IPC~0)))) (and (or (and (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 ~NP~0)) (not (<= 1 ~compRegistered~0)) (not (<= ~NP~0 1)) (not (<= (+ |old(~s~0)| 2) ~SKIP1~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) .cse0 .cse1 (not (= ~NP~0 |old(~s~0)|)) (not (<= 1 ~NP~0))) (or .cse0 .cse1 (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= ~compRegistered~0 0))))) [2020-08-21 17:20:52,610 INFO L268 CegarLoopResult]: For program point L444-1(line 444) no Hoare annotation was computed. [2020-08-21 17:20:52,610 INFO L264 CegarLoopResult]: At program point L469(lines 442 497) the Hoare annotation is: (let ((.cse0 (not (<= ~pended~0 0))) (.cse1 (not (<= (+ ~SKIP2~0 3) ~IPC~0)))) (and (or .cse0 .cse1 (and (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~SKIP1~0 ~s~0)) (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= ~compRegistered~0 0))) (let ((.cse2 (= ~MPR1~0 ~s~0))) (or (not (<= 1 ~compRegistered~0)) (not (<= ~NP~0 1)) (not (<= (+ |old(~s~0)| 2) ~SKIP1~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) .cse0 .cse1 (not (= ~NP~0 |old(~s~0)|)) (and .cse2 (= ~setEventCalled~0 1) (<= IofCallDriver_~returnVal2~0 259) (<= 259 IofCallDriver_~returnVal2~0)) (and (<= IofCallDriver_~returnVal2~0 0) .cse2) (not (<= 1 ~NP~0)))))) [2020-08-21 17:20:52,610 INFO L264 CegarLoopResult]: At program point L457(lines 456 471) the Hoare annotation is: (let ((.cse0 (not (<= ~pended~0 0))) (.cse1 (not (<= (+ ~SKIP2~0 3) ~IPC~0)))) (and (or .cse0 .cse1 (and (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~SKIP1~0 ~s~0)) (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= ~compRegistered~0 0))) (or (not (<= 1 ~compRegistered~0)) (and (= ~MPR1~0 ~s~0) (= ~setEventCalled~0 1)) (not (<= ~NP~0 1)) (not (<= (+ |old(~s~0)| 2) ~SKIP1~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) .cse0 .cse1 (not (= ~NP~0 |old(~s~0)|)) (not (<= 1 ~NP~0))))) [2020-08-21 17:20:52,610 INFO L268 CegarLoopResult]: For program point L486(lines 486 493) no Hoare annotation was computed. [2020-08-21 17:20:52,611 INFO L268 CegarLoopResult]: For program point L449(lines 449 472) no Hoare annotation was computed. [2020-08-21 17:20:52,611 INFO L268 CegarLoopResult]: For program point L478(lines 478 484) no Hoare annotation was computed. [2020-08-21 17:20:52,611 INFO L264 CegarLoopResult]: At program point L445(line 445) the Hoare annotation is: (let ((.cse0 (not (<= ~pended~0 0))) (.cse1 (not (<= (+ ~SKIP2~0 3) ~IPC~0)))) (and (or (not (<= 1 ~compRegistered~0)) (not (<= ~NP~0 1)) (not (<= (+ |old(~s~0)| 2) ~SKIP1~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) .cse0 .cse1 (not (= ~NP~0 |old(~s~0)|)) (not (<= 1 ~NP~0)) (and (= ~setEventCalled~0 1) (= ~s~0 |old(~s~0)|))) (or .cse0 .cse1 (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= ~compRegistered~0 0))))) [2020-08-21 17:20:52,611 INFO L264 CegarLoopResult]: At program point IofCallDriverENTRY(lines 435 498) the Hoare annotation is: (let ((.cse2 (not (<= ~pended~0 0))) (.cse3 (not (<= (+ ~SKIP2~0 3) ~IPC~0))) (.cse0 (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|)) (.cse1 (= ~setEventCalled~0 |old(~setEventCalled~0)|))) (and (or (and .cse0 .cse1 (= ~s~0 ~NP~0)) (not (<= 1 ~compRegistered~0)) (not (<= ~NP~0 1)) (not (<= (+ |old(~s~0)| 2) ~SKIP1~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) .cse2 .cse3 (not (= ~NP~0 |old(~s~0)|)) (not (<= 1 ~NP~0))) (or .cse2 .cse3 (and .cse0 .cse1 (= ~SKIP1~0 ~s~0)) (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= ~compRegistered~0 0))))) [2020-08-21 17:20:52,611 INFO L264 CegarLoopResult]: At program point L491(line 491) the Hoare annotation is: (let ((.cse0 (not (<= ~pended~0 0))) (.cse1 (not (<= (+ ~SKIP2~0 3) ~IPC~0)))) (and (or .cse0 .cse1 (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= ~compRegistered~0 0))) (or (not (<= 1 ~compRegistered~0)) (not (<= ~NP~0 1)) (not (<= (+ |old(~s~0)| 2) ~SKIP1~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) .cse0 .cse1 (not (= ~NP~0 |old(~s~0)|)) (not (<= 1 ~NP~0))))) [2020-08-21 17:20:52,611 INFO L268 CegarLoopResult]: For program point L491-1(lines 473 495) no Hoare annotation was computed. [2020-08-21 17:20:52,612 INFO L268 CegarLoopResult]: For program point L454(lines 454 471) no Hoare annotation was computed. [2020-08-21 17:20:52,612 INFO L264 CegarLoopResult]: At program point L450(lines 449 472) the Hoare annotation is: (let ((.cse0 (not (<= ~pended~0 0))) (.cse1 (not (<= (+ ~SKIP2~0 3) ~IPC~0)))) (and (or .cse0 .cse1 (and (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~SKIP1~0 ~s~0)) (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= ~compRegistered~0 0))) (or (not (<= 1 ~compRegistered~0)) (= ~MPR1~0 ~s~0) (not (<= ~NP~0 1)) (not (<= (+ |old(~s~0)| 2) ~SKIP1~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) .cse0 .cse1 (not (= ~NP~0 |old(~s~0)|)) (not (<= 1 ~NP~0))))) [2020-08-21 17:20:52,612 INFO L268 CegarLoopResult]: For program point IofCallDriverFINAL(lines 435 498) no Hoare annotation was computed. [2020-08-21 17:20:52,612 INFO L268 CegarLoopResult]: For program point IofCallDriverEXIT(lines 435 498) no Hoare annotation was computed. [2020-08-21 17:20:52,612 INFO L264 CegarLoopResult]: At program point L455(lines 454 471) the Hoare annotation is: (let ((.cse0 (not (<= ~pended~0 0))) (.cse1 (not (<= (+ ~SKIP2~0 3) ~IPC~0)))) (and (or .cse0 .cse1 (and (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~SKIP1~0 ~s~0)) (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= ~compRegistered~0 0))) (or (not (<= 1 ~compRegistered~0)) (= ~MPR1~0 ~s~0) (not (<= ~NP~0 1)) (not (<= (+ |old(~s~0)| 2) ~SKIP1~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) .cse0 .cse1 (not (= ~NP~0 |old(~s~0)|)) (not (<= 1 ~NP~0))))) [2020-08-21 17:20:52,612 INFO L268 CegarLoopResult]: For program point L443(lines 443 446) no Hoare annotation was computed. [2020-08-21 17:20:52,612 INFO L268 CegarLoopResult]: For program point L443-1(lines 443 446) no Hoare annotation was computed. [2020-08-21 17:20:52,613 INFO L264 CegarLoopResult]: At program point L429(line 429) the Hoare annotation is: (or (not (<= 1 ~compRegistered~0)) (not (<= ~NP~0 1)) (not (<= (+ |old(~s~0)| 2) ~SKIP1~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (= ~setEventCalled~0 1)) (not (<= ~pended~0 0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= ~NP~0 |old(~s~0)|)) (not (<= 1 ~NP~0))) [2020-08-21 17:20:52,613 INFO L268 CegarLoopResult]: For program point L429-1(lines 421 434) no Hoare annotation was computed. [2020-08-21 17:20:52,613 INFO L264 CegarLoopResult]: At program point stubMoreProcessingRequiredENTRY(lines 421 434) the Hoare annotation is: (or (not (<= 1 ~compRegistered~0)) (not (<= ~NP~0 1)) (not (<= (+ |old(~s~0)| 2) ~SKIP1~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (= ~setEventCalled~0 1)) (= ~s~0 ~NP~0) (not (<= ~pended~0 0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= ~NP~0 |old(~s~0)|)) (not (<= 1 ~NP~0))) [2020-08-21 17:20:52,613 INFO L268 CegarLoopResult]: For program point stubMoreProcessingRequiredEXIT(lines 421 434) no Hoare annotation was computed. [2020-08-21 17:20:52,613 INFO L268 CegarLoopResult]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2020-08-21 17:20:52,613 INFO L264 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~compRegistered~0 |old(~compRegistered~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~SKIP2~0 |old(~SKIP2~0)|) (= ~NP~0 |old(~NP~0)|) (= ~MPR3~0 |old(~MPR3~0)|) (= ~KernelMode~0 |old(~KernelMode~0)|) (= ~s~0 |old(~s~0)|) (= ~SKIP1~0 |old(~SKIP1~0)|) (= ~IPC~0 |old(~IPC~0)|) (= ~DC~0 |old(~DC~0)|) (= ~pended~0 |old(~pended~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~compFptr~0 |old(~compFptr~0)|) (= ~customIrp~0 |old(~customIrp~0)|) (= ~UNLOADED~0 |old(~UNLOADED~0)|) (= ~Executive~0 |old(~Executive~0)|) (= ~myStatus~0 |old(~myStatus~0)|)) [2020-08-21 17:20:52,613 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-08-21 17:20:52,614 INFO L264 CegarLoopResult]: At program point L541(line 541) the Hoare annotation is: (let ((.cse0 (not (<= 1 ~compRegistered~0))) (.cse1 (not (<= ~NP~0 1))) (.cse2 (not (= |old(~setEventCalled~0)| 1))) (.cse3 (not (<= (+ ~NP~0 4) ~MPR1~0))) (.cse4 (not (<= ~pended~0 0))) (.cse5 (not (<= (+ ~SKIP2~0 3) ~IPC~0))) (.cse6 (not (<= 1 ~NP~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (= ~MPR3~0 |old(~s~0)|)) .cse6) (or .cse0 .cse1 .cse2 (not (<= (+ |old(~s~0)| 2) ~SKIP1~0)) .cse3 .cse4 .cse5 (not (= ~NP~0 |old(~s~0)|)) .cse6))) [2020-08-21 17:20:52,614 INFO L268 CegarLoopResult]: For program point L539(lines 539 543) no Hoare annotation was computed. [2020-08-21 17:20:52,614 INFO L268 CegarLoopResult]: For program point L539-1(lines 526 545) no Hoare annotation was computed. [2020-08-21 17:20:52,614 INFO L268 CegarLoopResult]: For program point KeWaitForSingleObjectEXIT(lines 521 562) no Hoare annotation was computed. [2020-08-21 17:20:52,614 INFO L268 CegarLoopResult]: For program point L527(lines 527 532) no Hoare annotation was computed. [2020-08-21 17:20:52,614 INFO L268 CegarLoopResult]: For program point L548(lines 548 560) no Hoare annotation was computed. [2020-08-21 17:20:52,614 INFO L268 CegarLoopResult]: For program point KeWaitForSingleObjectFINAL(lines 521 562) no Hoare annotation was computed. [2020-08-21 17:20:52,614 INFO L264 CegarLoopResult]: At program point L534(lines 526 545) the Hoare annotation is: (let ((.cse0 (not (<= 1 ~compRegistered~0))) (.cse1 (not (<= ~NP~0 1))) (.cse2 (not (= |old(~setEventCalled~0)| 1))) (.cse3 (not (<= (+ ~NP~0 4) ~MPR1~0))) (.cse4 (not (<= ~pended~0 0))) (.cse5 (not (<= (+ ~SKIP2~0 3) ~IPC~0))) (.cse6 (not (<= 1 ~NP~0)))) (and (or .cse0 .cse1 .cse2 (not (<= (+ |old(~s~0)| 2) ~SKIP1~0)) .cse3 .cse4 .cse5 (not (= ~NP~0 |old(~s~0)|)) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 ~NP~0) (= |old(~customIrp~0)| ~customIrp~0)) .cse6) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (= ~MPR3~0 |old(~s~0)|)) .cse6))) [2020-08-21 17:20:52,615 INFO L268 CegarLoopResult]: For program point L526(lines 526 545) no Hoare annotation was computed. [2020-08-21 17:20:52,615 INFO L264 CegarLoopResult]: At program point L551(lines 550 560) the Hoare annotation is: (let ((.cse0 (not (<= 1 ~compRegistered~0))) (.cse1 (not (<= ~NP~0 1))) (.cse2 (not (= |old(~setEventCalled~0)| 1))) (.cse3 (not (<= (+ ~NP~0 4) ~MPR1~0))) (.cse4 (not (<= ~pended~0 0))) (.cse5 (not (<= (+ ~SKIP2~0 3) ~IPC~0))) (.cse6 (not (<= 1 ~NP~0)))) (and (or .cse0 .cse1 .cse2 .cse3 (= ~s~0 ~NP~0) .cse4 .cse5 (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (= ~MPR3~0 |old(~s~0)|)) .cse6) (or .cse0 .cse1 .cse2 (not (<= (+ |old(~s~0)| 2) ~SKIP1~0)) .cse3 .cse4 .cse5 (not (= ~NP~0 |old(~s~0)|)) (= ~s~0 |old(~s~0)|) .cse6))) [2020-08-21 17:20:52,615 INFO L264 CegarLoopResult]: At program point KeWaitForSingleObjectENTRY(lines 521 562) the Hoare annotation is: (let ((.cse0 (not (<= 1 ~compRegistered~0))) (.cse1 (not (<= ~NP~0 1))) (.cse2 (not (= |old(~setEventCalled~0)| 1))) (.cse3 (not (<= (+ ~NP~0 4) ~MPR1~0))) (.cse4 (not (<= ~pended~0 0))) (.cse5 (not (<= (+ ~SKIP2~0 3) ~IPC~0))) (.cse6 (= ~setEventCalled~0 |old(~setEventCalled~0)|)) (.cse7 (= |old(~customIrp~0)| ~customIrp~0)) (.cse8 (not (<= 1 ~NP~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (and (= ~MPR3~0 ~s~0) .cse6 .cse7) (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (= ~MPR3~0 |old(~s~0)|)) .cse8) (or .cse0 .cse1 .cse2 (not (<= (+ |old(~s~0)| 2) ~SKIP1~0)) .cse3 .cse4 .cse5 (not (= ~NP~0 |old(~s~0)|)) (and .cse6 (= ~s~0 ~NP~0) .cse7) .cse8))) [2020-08-21 17:20:52,615 INFO L264 CegarLoopResult]: At program point L549(lines 548 560) the Hoare annotation is: (let ((.cse0 (not (<= 1 ~compRegistered~0))) (.cse1 (not (<= ~NP~0 1))) (.cse2 (not (= |old(~setEventCalled~0)| 1))) (.cse3 (not (<= (+ ~NP~0 4) ~MPR1~0))) (.cse4 (not (<= ~pended~0 0))) (.cse5 (not (<= (+ ~SKIP2~0 3) ~IPC~0))) (.cse6 (not (<= 1 ~NP~0)))) (and (or .cse0 .cse1 .cse2 .cse3 (= ~s~0 ~NP~0) .cse4 .cse5 (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (= ~MPR3~0 |old(~s~0)|)) .cse6) (or .cse0 .cse1 .cse2 (not (<= (+ |old(~s~0)| 2) ~SKIP1~0)) .cse3 .cse4 .cse5 (not (= ~NP~0 |old(~s~0)|)) (= ~s~0 |old(~s~0)|) .cse6))) [2020-08-21 17:20:52,615 INFO L264 CegarLoopResult]: At program point L507(line 507) the Hoare annotation is: (or (not (<= 1 ~compRegistered~0)) (not (<= ~pended~0 0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= ~NP~0 |old(~s~0)|)) (not (<= (+ ~NP~0 2) ~SKIP1~0))) [2020-08-21 17:20:52,616 INFO L268 CegarLoopResult]: For program point L507-1(lines 499 512) no Hoare annotation was computed. [2020-08-21 17:20:52,616 INFO L264 CegarLoopResult]: At program point IofCompleteRequestENTRY(lines 499 512) the Hoare annotation is: (or (not (<= 1 ~compRegistered~0)) (not (<= ~pended~0 0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= ~NP~0 |old(~s~0)|)) (not (<= (+ ~NP~0 2) ~SKIP1~0)) (= ~s~0 |old(~s~0)|)) [2020-08-21 17:20:52,616 INFO L268 CegarLoopResult]: For program point L503(lines 503 509) no Hoare annotation was computed. [2020-08-21 17:20:52,616 INFO L268 CegarLoopResult]: For program point IofCompleteRequestEXIT(lines 499 512) no Hoare annotation was computed. [2020-08-21 17:20:52,616 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-08-21 17:20:52,616 INFO L264 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: (and (= ~MPR3~0 ~s~0) (= ~compRegistered~0 0) (= ~s~0 ~NP~0) (= ~SKIP1~0 ~s~0) (<= ~IPC~0 ~s~0) (= ~MPR1~0 ~NP~0) (<= ~pended~0 0)) [2020-08-21 17:20:52,616 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-08-21 17:20:52,616 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-08-21 17:20:52,617 INFO L264 CegarLoopResult]: At program point L192(lines 192 194) the Hoare annotation is: (let ((.cse1 (<= 259 KbFilter_PnP_~status~0)) (.cse2 (= ~setEventCalled~0 1)) (.cse12 (<= 1 ~NP~0)) (.cse3 (<= 1 ~compRegistered~0)) (.cse13 (<= (+ ~NP~0 4) ~MPR1~0))) (let ((.cse0 (not (<= ~NP~0 1))) (.cse4 (not .cse13)) (.cse5 (not (<= ~pended~0 0))) (.cse6 (not (<= (+ ~SKIP2~0 3) ~IPC~0))) (.cse8 (not (= ~NP~0 |old(~s~0)|))) (.cse7 (not (= |old(~compRegistered~0)| 0))) (.cse9 (not (<= (+ ~NP~0 2) ~SKIP1~0))) (.cse10 (and .cse1 .cse2 .cse13 (= ~s~0 |old(~s~0)|) .cse12 .cse3)) (.cse11 (not .cse12))) (and (or .cse0 (and (= ~MPR3~0 ~s~0) .cse1 .cse2 (= KbFilter_PnP_~__cil_tmp23~0 259) .cse3) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse0 .cse4 .cse5 .cse6 .cse8 .cse7 .cse9 .cse10 .cse11 (not (<= (+ |old(~myStatus~0)| 1073741637) 0)) (<= (+ ~myStatus~0 1073741637) 0))))) [2020-08-21 17:20:52,617 INFO L268 CegarLoopResult]: For program point L192-1(lines 192 194) no Hoare annotation was computed. [2020-08-21 17:20:52,617 INFO L268 CegarLoopResult]: For program point L151(lines 151 265) no Hoare annotation was computed. [2020-08-21 17:20:52,617 INFO L268 CegarLoopResult]: For program point L118(lines 118 276) no Hoare annotation was computed. [2020-08-21 17:20:52,617 INFO L264 CegarLoopResult]: At program point L209(line 209) the Hoare annotation is: (or (not (<= ~NP~0 1)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~pended~0 0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= |old(~compRegistered~0)| 0)) (not (= ~NP~0 |old(~s~0)|)) (not (<= (+ ~NP~0 2) ~SKIP1~0)) (and (= ~s~0 ~NP~0) (<= 1 ~compRegistered~0)) (not (<= 1 ~NP~0))) [2020-08-21 17:20:52,617 INFO L264 CegarLoopResult]: At program point L176(line 176) the Hoare annotation is: (or (not (<= ~NP~0 1)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~pended~0 0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= |old(~compRegistered~0)| 0)) (not (= ~NP~0 |old(~s~0)|)) (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= 1 ~NP~0))) [2020-08-21 17:20:52,617 INFO L264 CegarLoopResult]: At program point L234(line 234) the Hoare annotation is: (or (not (<= ~NP~0 1)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~pended~0 0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= |old(~compRegistered~0)| 0)) (not (= ~NP~0 |old(~s~0)|)) (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= 1 ~NP~0))) [2020-08-21 17:20:52,617 INFO L268 CegarLoopResult]: For program point L234-1(lines 230 236) no Hoare annotation was computed. [2020-08-21 17:20:52,618 INFO L268 CegarLoopResult]: For program point L160(lines 160 262) no Hoare annotation was computed. [2020-08-21 17:20:52,618 INFO L268 CegarLoopResult]: For program point L127(lines 127 273) no Hoare annotation was computed. [2020-08-21 17:20:52,618 INFO L264 CegarLoopResult]: At program point L218(line 218) the Hoare annotation is: (or (not (<= ~NP~0 1)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~pended~0 0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= |old(~compRegistered~0)| 0)) (not (= ~NP~0 |old(~s~0)|)) (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= 1 ~NP~0))) [2020-08-21 17:20:52,618 INFO L264 CegarLoopResult]: At program point L185(lines 185 186) the Hoare annotation is: (let ((.cse0 (not (<= ~NP~0 1))) (.cse1 (not (<= (+ ~NP~0 4) ~MPR1~0))) (.cse2 (not (<= ~pended~0 0))) (.cse3 (not (<= (+ ~SKIP2~0 3) ~IPC~0))) (.cse4 (not (= |old(~compRegistered~0)| 0))) (.cse5 (not (= ~NP~0 |old(~s~0)|))) (.cse6 (not (<= (+ ~NP~0 2) ~SKIP1~0))) (.cse7 (not (<= 1 ~NP~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (and (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~s~0 |old(~s~0)|) (<= 1 ~compRegistered~0))) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= (+ ~myStatus~0 1073741637) 0) (not (<= (+ |old(~myStatus~0)| 1073741637) 0))))) [2020-08-21 17:20:52,618 INFO L268 CegarLoopResult]: For program point L218-1(lines 214 220) no Hoare annotation was computed. [2020-08-21 17:20:52,618 INFO L268 CegarLoopResult]: For program point L185-1(lines 185 186) no Hoare annotation was computed. [2020-08-21 17:20:52,618 INFO L268 CegarLoopResult]: For program point L169(lines 169 181) no Hoare annotation was computed. [2020-08-21 17:20:52,618 INFO L268 CegarLoopResult]: For program point L136(lines 136 270) no Hoare annotation was computed. [2020-08-21 17:20:52,619 INFO L268 CegarLoopResult]: For program point L103(lines 103 281) no Hoare annotation was computed. [2020-08-21 17:20:52,619 INFO L271 CegarLoopResult]: At program point L260(lines 164 261) the Hoare annotation is: true [2020-08-21 17:20:52,619 INFO L268 CegarLoopResult]: For program point KbFilter_PnPEXIT(lines 73 285) no Hoare annotation was computed. [2020-08-21 17:20:52,619 INFO L268 CegarLoopResult]: For program point L145(lines 145 267) no Hoare annotation was computed. [2020-08-21 17:20:52,619 INFO L268 CegarLoopResult]: For program point L112(lines 112 278) no Hoare annotation was computed. [2020-08-21 17:20:52,619 INFO L264 CegarLoopResult]: At program point L104(lines 103 281) the Hoare annotation is: (or (and (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |old(~compRegistered~0)| ~compRegistered~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 ~NP~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~myStatus~0 |old(~myStatus~0)|)) (not (<= ~NP~0 1)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~pended~0 0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= |old(~compRegistered~0)| 0)) (not (= ~NP~0 |old(~s~0)|)) (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= 1 ~NP~0))) [2020-08-21 17:20:52,619 INFO L268 CegarLoopResult]: For program point L154(lines 154 264) no Hoare annotation was computed. [2020-08-21 17:20:52,620 INFO L268 CegarLoopResult]: For program point L121(lines 121 275) no Hoare annotation was computed. [2020-08-21 17:20:52,620 INFO L264 CegarLoopResult]: At program point KbFilter_PnPENTRY(lines 73 285) the Hoare annotation is: (or (and (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |old(~compRegistered~0)| ~compRegistered~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 ~NP~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~myStatus~0 |old(~myStatus~0)|)) (not (<= ~NP~0 1)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~pended~0 0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= |old(~compRegistered~0)| 0)) (not (= ~NP~0 |old(~s~0)|)) (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= 1 ~NP~0))) [2020-08-21 17:20:52,620 INFO L264 CegarLoopResult]: At program point L171(line 171) the Hoare annotation is: (or (not (<= ~NP~0 1)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~pended~0 0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= |old(~compRegistered~0)| 0)) (not (= ~NP~0 |old(~s~0)|)) (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= 1 ~NP~0))) [2020-08-21 17:20:52,620 INFO L268 CegarLoopResult]: For program point KbFilter_PnPFINAL(lines 73 285) no Hoare annotation was computed. [2020-08-21 17:20:52,620 INFO L264 CegarLoopResult]: At program point L163(lines 109 279) the Hoare annotation is: (or (and (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |old(~compRegistered~0)| ~compRegistered~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 ~NP~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~myStatus~0 |old(~myStatus~0)|)) (not (<= ~NP~0 1)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~pended~0 0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= |old(~compRegistered~0)| 0)) (not (= ~NP~0 |old(~s~0)|)) (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= 1 ~NP~0))) [2020-08-21 17:20:52,620 INFO L268 CegarLoopResult]: For program point L130(lines 130 272) no Hoare annotation was computed. [2020-08-21 17:20:52,620 INFO L268 CegarLoopResult]: For program point L139(lines 139 269) no Hoare annotation was computed. [2020-08-21 17:20:52,620 INFO L268 CegarLoopResult]: For program point L106(lines 106 280) no Hoare annotation was computed. [2020-08-21 17:20:52,621 INFO L268 CegarLoopResult]: For program point L230(lines 230 236) no Hoare annotation was computed. [2020-08-21 17:20:52,621 INFO L264 CegarLoopResult]: At program point L255(lines 255 256) the Hoare annotation is: (or (not (<= ~NP~0 1)) (and (= ~compRegistered~0 0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~SKIP1~0 ~s~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~pended~0 0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= |old(~compRegistered~0)| 0)) (not (= ~NP~0 |old(~s~0)|)) (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= 1 ~NP~0))) [2020-08-21 17:20:52,621 INFO L268 CegarLoopResult]: For program point L255-1(lines 255 256) no Hoare annotation was computed. [2020-08-21 17:20:52,621 INFO L268 CegarLoopResult]: For program point L214(lines 214 220) no Hoare annotation was computed. [2020-08-21 17:20:52,621 INFO L268 CegarLoopResult]: For program point L148(lines 148 266) no Hoare annotation was computed. [2020-08-21 17:20:52,621 INFO L268 CegarLoopResult]: For program point L115(lines 115 277) no Hoare annotation was computed. [2020-08-21 17:20:52,621 INFO L264 CegarLoopResult]: At program point L107(lines 106 280) the Hoare annotation is: (or (and (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |old(~compRegistered~0)| ~compRegistered~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 ~NP~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~myStatus~0 |old(~myStatus~0)|)) (not (<= ~NP~0 1)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~pended~0 0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= |old(~compRegistered~0)| 0)) (not (= ~NP~0 |old(~s~0)|)) (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= 1 ~NP~0))) [2020-08-21 17:20:52,621 INFO L268 CegarLoopResult]: For program point L198(lines 198 204) no Hoare annotation was computed. [2020-08-21 17:20:52,622 INFO L268 CegarLoopResult]: For program point L190(lines 190 196) no Hoare annotation was computed. [2020-08-21 17:20:52,622 INFO L268 CegarLoopResult]: For program point L157(lines 157 263) no Hoare annotation was computed. [2020-08-21 17:20:52,622 INFO L268 CegarLoopResult]: For program point L124(lines 124 274) no Hoare annotation was computed. [2020-08-21 17:20:52,622 INFO L268 CegarLoopResult]: For program point L190-2(lines 164 259) no Hoare annotation was computed. [2020-08-21 17:20:52,622 INFO L264 CegarLoopResult]: At program point L240(line 240) the Hoare annotation is: (or (not (<= ~NP~0 1)) (and (= ~compRegistered~0 0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~SKIP1~0 ~s~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~pended~0 0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= |old(~compRegistered~0)| 0)) (not (= ~NP~0 |old(~s~0)|)) (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= 1 ~NP~0))) [2020-08-21 17:20:52,622 INFO L268 CegarLoopResult]: For program point L240-1(line 240) no Hoare annotation was computed. [2020-08-21 17:20:52,622 INFO L268 CegarLoopResult]: For program point L174(lines 174 180) no Hoare annotation was computed. [2020-08-21 17:20:52,622 INFO L268 CegarLoopResult]: For program point L174-1(lines 169 181) no Hoare annotation was computed. [2020-08-21 17:20:52,622 INFO L268 CegarLoopResult]: For program point L199(lines 199 203) no Hoare annotation was computed. [2020-08-21 17:20:52,623 INFO L268 CegarLoopResult]: For program point L133(lines 133 271) no Hoare annotation was computed. [2020-08-21 17:20:52,623 INFO L268 CegarLoopResult]: For program point L100(lines 100 282) no Hoare annotation was computed. [2020-08-21 17:20:52,623 INFO L264 CegarLoopResult]: At program point L224(lines 224 225) the Hoare annotation is: (or (not (<= ~NP~0 1)) (and (= ~compRegistered~0 0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~SKIP1~0 ~s~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~pended~0 0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= |old(~compRegistered~0)| 0)) (not (= ~NP~0 |old(~s~0)|)) (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= 1 ~NP~0))) [2020-08-21 17:20:52,623 INFO L268 CegarLoopResult]: For program point L224-1(lines 224 225) no Hoare annotation was computed. [2020-08-21 17:20:52,623 INFO L264 CegarLoopResult]: At program point L249(line 249) the Hoare annotation is: (or (not (<= ~NP~0 1)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~pended~0 0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= |old(~compRegistered~0)| 0)) (not (= ~NP~0 |old(~s~0)|)) (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= 1 ~NP~0))) [2020-08-21 17:20:52,623 INFO L268 CegarLoopResult]: For program point L249-1(lines 245 251) no Hoare annotation was computed. [2020-08-21 17:20:52,623 INFO L268 CegarLoopResult]: For program point L142(lines 142 268) no Hoare annotation was computed. [2020-08-21 17:20:52,623 INFO L268 CegarLoopResult]: For program point L109(lines 109 279) no Hoare annotation was computed. [2020-08-21 17:20:52,624 INFO L264 CegarLoopResult]: At program point L101(lines 100 282) the Hoare annotation is: (or (and (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |old(~compRegistered~0)| ~compRegistered~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 ~NP~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~myStatus~0 |old(~myStatus~0)|)) (not (<= ~NP~0 1)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~pended~0 0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= |old(~compRegistered~0)| 0)) (not (= ~NP~0 |old(~s~0)|)) (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= 1 ~NP~0))) [2020-08-21 17:20:52,659 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.08 05:20:52 BoogieIcfgContainer [2020-08-21 17:20:52,659 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-08-21 17:20:52,661 INFO L168 Benchmark]: Toolchain (without parser) took 20551.17 ms. Allocated memory was 141.6 MB in the beginning and 459.8 MB in the end (delta: 318.2 MB). Free memory was 104.1 MB in the beginning and 249.1 MB in the end (delta: -145.0 MB). Peak memory consumption was 332.3 MB. Max. memory is 7.1 GB. [2020-08-21 17:20:52,662 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 141.6 MB. Free memory was 123.1 MB in the beginning and 122.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-08-21 17:20:52,662 INFO L168 Benchmark]: CACSL2BoogieTranslator took 513.07 ms. Allocated memory was 141.6 MB in the beginning and 203.4 MB in the end (delta: 61.9 MB). Free memory was 103.8 MB in the beginning and 178.6 MB in the end (delta: -74.8 MB). Peak memory consumption was 24.9 MB. Max. memory is 7.1 GB. [2020-08-21 17:20:52,663 INFO L168 Benchmark]: Boogie Preprocessor took 53.11 ms. Allocated memory is still 203.4 MB. Free memory was 178.6 MB in the beginning and 176.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2020-08-21 17:20:52,663 INFO L168 Benchmark]: RCFGBuilder took 704.47 ms. Allocated memory is still 203.4 MB. Free memory was 176.6 MB in the beginning and 130.7 MB in the end (delta: 46.0 MB). Peak memory consumption was 46.0 MB. Max. memory is 7.1 GB. [2020-08-21 17:20:52,664 INFO L168 Benchmark]: TraceAbstraction took 19275.62 ms. Allocated memory was 203.4 MB in the beginning and 459.8 MB in the end (delta: 256.4 MB). Free memory was 130.0 MB in the beginning and 249.1 MB in the end (delta: -119.1 MB). Peak memory consumption was 296.4 MB. Max. memory is 7.1 GB. [2020-08-21 17:20:52,667 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 141.6 MB. Free memory was 123.1 MB in the beginning and 122.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 513.07 ms. Allocated memory was 141.6 MB in the beginning and 203.4 MB in the end (delta: 61.9 MB). Free memory was 103.8 MB in the beginning and 178.6 MB in the end (delta: -74.8 MB). Peak memory consumption was 24.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 53.11 ms. Allocated memory is still 203.4 MB. Free memory was 178.6 MB in the beginning and 176.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 704.47 ms. Allocated memory is still 203.4 MB. Free memory was 176.6 MB in the beginning and 130.7 MB in the end (delta: 46.0 MB). Peak memory consumption was 46.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 19275.62 ms. Allocated memory was 203.4 MB in the beginning and 459.8 MB in the end (delta: 256.4 MB). Free memory was 130.0 MB in the beginning and 249.1 MB in the end (delta: -119.1 MB). Peak memory consumption was 296.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 579]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 367]: Loop Invariant Derived loop invariant: ((((((!(\old(IPC) <= \old(s)) || !(\old(s) == \old(MPR3))) || ((NP + 2 <= SKIP1 && SKIP2 + 3 <= IPC) && pended <= 0)) || !(\old(SKIP1) == \old(s))) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(NP))) || !(\old(pended) <= 0) - InvariantResult [Line: 295]: Loop Invariant Derived loop invariant: ((((((!(\old(IPC) <= \old(s)) || !(\old(s) == \old(MPR3))) || ((NP + 2 <= SKIP1 && SKIP2 + 3 <= IPC) && pended <= 0)) || !(\old(SKIP1) == \old(s))) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(NP))) || !(\old(pended) <= 0) - InvariantResult [Line: 352]: Loop Invariant Derived loop invariant: ((((((!(\old(IPC) <= \old(s)) || !(\old(s) == \old(MPR3))) || !(\old(SKIP1) == \old(s))) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR1))) || 0 <= status) || !(\old(s) == \old(NP))) || !(\old(pended) <= 0) - InvariantResult [Line: 106]: Loop Invariant Derived loop invariant: ((((((((((((lowerDriverReturn == \old(lowerDriverReturn) && \old(compRegistered) == compRegistered) && setEventCalled == \old(setEventCalled)) && s == NP) && \old(customIrp) == customIrp) && myStatus == \old(myStatus)) || !(NP <= 1)) || !(NP + 4 <= MPR1)) || !(pended <= 0)) || !(SKIP2 + 3 <= IPC)) || !(\old(compRegistered) == 0)) || !(NP == \old(s))) || !(NP + 2 <= SKIP1)) || !(1 <= NP) - InvariantResult [Line: 109]: Loop Invariant Derived loop invariant: ((((((((((((lowerDriverReturn == \old(lowerDriverReturn) && \old(compRegistered) == compRegistered) && setEventCalled == \old(setEventCalled)) && s == NP) && \old(customIrp) == customIrp) && myStatus == \old(myStatus)) || !(NP <= 1)) || !(NP + 4 <= MPR1)) || !(pended <= 0)) || !(SKIP2 + 3 <= IPC)) || !(\old(compRegistered) == 0)) || !(NP == \old(s))) || !(NP + 2 <= SKIP1)) || !(1 <= NP) - InvariantResult [Line: 449]: Loop Invariant Derived loop invariant: (((((!(pended <= 0) || !(SKIP2 + 3 <= IPC)) || ((lowerDriverReturn == \old(lowerDriverReturn) && setEventCalled == \old(setEventCalled)) && SKIP1 == s)) || !(NP + 2 <= SKIP1)) || !(SKIP1 == \old(s))) || !(compRegistered == 0)) && ((((((((!(1 <= compRegistered) || MPR1 == s) || !(NP <= 1)) || !(\old(s) + 2 <= SKIP1)) || !(NP + 4 <= MPR1)) || !(pended <= 0)) || !(SKIP2 + 3 <= IPC)) || !(NP == \old(s))) || !(1 <= NP)) - InvariantResult [Line: 526]: Loop Invariant Derived loop invariant: (((((((((!(1 <= compRegistered) || !(NP <= 1)) || !(\old(setEventCalled) == 1)) || !(\old(s) + 2 <= SKIP1)) || !(NP + 4 <= MPR1)) || !(pended <= 0)) || !(SKIP2 + 3 <= IPC)) || !(NP == \old(s))) || ((setEventCalled == \old(setEventCalled) && s == NP) && \old(customIrp) == customIrp)) || !(1 <= NP)) && ((((((((!(1 <= compRegistered) || !(NP <= 1)) || !(\old(setEventCalled) == 1)) || !(NP + 4 <= MPR1)) || !(pended <= 0)) || !(SKIP2 + 3 <= IPC)) || !(NP + 2 <= SKIP1)) || !(MPR3 == \old(s))) || !(1 <= NP)) - InvariantResult [Line: 164]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 100]: Loop Invariant Derived loop invariant: ((((((((((((lowerDriverReturn == \old(lowerDriverReturn) && \old(compRegistered) == compRegistered) && setEventCalled == \old(setEventCalled)) && s == NP) && \old(customIrp) == customIrp) && myStatus == \old(myStatus)) || !(NP <= 1)) || !(NP + 4 <= MPR1)) || !(pended <= 0)) || !(SKIP2 + 3 <= IPC)) || !(\old(compRegistered) == 0)) || !(NP == \old(s))) || !(NP + 2 <= SKIP1)) || !(1 <= NP) - InvariantResult [Line: 456]: Loop Invariant Derived loop invariant: (((((!(pended <= 0) || !(SKIP2 + 3 <= IPC)) || ((lowerDriverReturn == \old(lowerDriverReturn) && setEventCalled == \old(setEventCalled)) && SKIP1 == s)) || !(NP + 2 <= SKIP1)) || !(SKIP1 == \old(s))) || !(compRegistered == 0)) && ((((((((!(1 <= compRegistered) || (MPR1 == s && setEventCalled == 1)) || !(NP <= 1)) || !(\old(s) + 2 <= SKIP1)) || !(NP + 4 <= MPR1)) || !(pended <= 0)) || !(SKIP2 + 3 <= IPC)) || !(NP == \old(s))) || !(1 <= NP)) - InvariantResult [Line: 548]: Loop Invariant Derived loop invariant: (((((((((!(1 <= compRegistered) || !(NP <= 1)) || !(\old(setEventCalled) == 1)) || !(NP + 4 <= MPR1)) || s == NP) || !(pended <= 0)) || !(SKIP2 + 3 <= IPC)) || !(NP + 2 <= SKIP1)) || !(MPR3 == \old(s))) || !(1 <= NP)) && (((((((((!(1 <= compRegistered) || !(NP <= 1)) || !(\old(setEventCalled) == 1)) || !(\old(s) + 2 <= SKIP1)) || !(NP + 4 <= MPR1)) || !(pended <= 0)) || !(SKIP2 + 3 <= IPC)) || !(NP == \old(s))) || s == \old(s)) || !(1 <= NP)) - InvariantResult [Line: 442]: Loop Invariant Derived loop invariant: (((((!(pended <= 0) || !(SKIP2 + 3 <= IPC)) || ((lowerDriverReturn == \old(lowerDriverReturn) && setEventCalled == \old(setEventCalled)) && SKIP1 == s)) || !(NP + 2 <= SKIP1)) || !(SKIP1 == \old(s))) || !(compRegistered == 0)) && (((((((((!(1 <= compRegistered) || !(NP <= 1)) || !(\old(s) + 2 <= SKIP1)) || !(NP + 4 <= MPR1)) || !(pended <= 0)) || !(SKIP2 + 3 <= IPC)) || !(NP == \old(s))) || (((MPR1 == s && setEventCalled == 1) && returnVal2 <= 259) && 259 <= returnVal2)) || (returnVal2 <= 0 && MPR1 == s)) || !(1 <= NP)) - InvariantResult [Line: 550]: Loop Invariant Derived loop invariant: (((((((((!(1 <= compRegistered) || !(NP <= 1)) || !(\old(setEventCalled) == 1)) || !(NP + 4 <= MPR1)) || s == NP) || !(pended <= 0)) || !(SKIP2 + 3 <= IPC)) || !(NP + 2 <= SKIP1)) || !(MPR3 == \old(s))) || !(1 <= NP)) && (((((((((!(1 <= compRegistered) || !(NP <= 1)) || !(\old(setEventCalled) == 1)) || !(\old(s) + 2 <= SKIP1)) || !(NP + 4 <= MPR1)) || !(pended <= 0)) || !(SKIP2 + 3 <= IPC)) || !(NP == \old(s))) || s == \old(s)) || !(1 <= NP)) - InvariantResult [Line: 375]: Loop Invariant Derived loop invariant: ((((((!(\old(IPC) <= \old(s)) || !(\old(s) == \old(MPR3))) || ((NP + 2 <= SKIP1 && SKIP2 + 3 <= IPC) && pended <= 0)) || !(\old(SKIP1) == \old(s))) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(NP))) || !(\old(pended) <= 0) - InvariantResult [Line: 103]: Loop Invariant Derived loop invariant: ((((((((((((lowerDriverReturn == \old(lowerDriverReturn) && \old(compRegistered) == compRegistered) && setEventCalled == \old(setEventCalled)) && s == NP) && \old(customIrp) == customIrp) && myStatus == \old(myStatus)) || !(NP <= 1)) || !(NP + 4 <= MPR1)) || !(pended <= 0)) || !(SKIP2 + 3 <= IPC)) || !(\old(compRegistered) == 0)) || !(NP == \old(s))) || !(NP + 2 <= SKIP1)) || !(1 <= NP) - InvariantResult [Line: 454]: Loop Invariant Derived loop invariant: (((((!(pended <= 0) || !(SKIP2 + 3 <= IPC)) || ((lowerDriverReturn == \old(lowerDriverReturn) && setEventCalled == \old(setEventCalled)) && SKIP1 == s)) || !(NP + 2 <= SKIP1)) || !(SKIP1 == \old(s))) || !(compRegistered == 0)) && ((((((((!(1 <= compRegistered) || MPR1 == s) || !(NP <= 1)) || !(\old(s) + 2 <= SKIP1)) || !(NP + 4 <= MPR1)) || !(pended <= 0)) || !(SKIP2 + 3 <= IPC)) || !(NP == \old(s))) || !(1 <= NP)) - InvariantResult [Line: 350]: Loop Invariant Derived loop invariant: ((((((!(\old(IPC) <= \old(s)) || ((((((((NP + 2 <= SKIP1 && compRegistered == 0) && s == NP) && NP <= 1) && 0 <= status) && SKIP2 + 3 <= IPC) && NP + 4 <= MPR1) && 1 <= NP) && pended <= 0)) || !(\old(s) == \old(MPR3))) || !(\old(SKIP1) == \old(s))) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(NP))) || !(\old(pended) <= 0) - InvariantResult [Line: 385]: Loop Invariant Derived loop invariant: ((((((!(\old(IPC) <= \old(s)) || ((NP + 2 <= SKIP1 && SKIP2 + 3 <= IPC) && pended <= 0)) || !(\old(s) == \old(MPR3))) || !(\old(SKIP1) == \old(s))) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(NP))) || !(\old(pended) <= 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 13 procedures, 151 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 13.2s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 8.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 5.9s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2162 SDtfs, 3407 SDslu, 2828 SDs, 0 SdLazy, 5133 SolverSat, 925 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 359 GetRequests, 174 SyntacticMatches, 3 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 3.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=217occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 18 MinimizatonAttempts, 186 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 53 LocationsWithAnnotation, 283 PreInvPairs, 349 NumberOfFragments, 3020 HoareAnnotationTreeSize, 283 FomulaSimplifications, 1712 FormulaSimplificationTreeSizeReduction, 0.4s HoareSimplificationTime, 53 FomulaSimplificationsInter, 7182 FormulaSimplificationTreeSizeReductionInter, 5.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.4s 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...