/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.assert.codeblocks.term.scoring.heuristic NUM_VARIABLES --traceabstraction.assert.codeblocks.term.scoring.heuristic.partitioning.strategy FIXED_NUM_PARTITIONS --traceabstraction.assert.codeblocks.term.scoring.heuristic.number.of.partitions 4 --traceabstraction.trace.refinement.strategy CAMEL_SMT_AM -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-79ed534 [2020-07-20 01:27:11,197 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-20 01:27:11,200 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-20 01:27:11,212 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-20 01:27:11,213 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-20 01:27:11,214 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-20 01:27:11,215 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-20 01:27:11,217 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-20 01:27:11,219 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-20 01:27:11,220 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-20 01:27:11,221 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-20 01:27:11,222 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-20 01:27:11,222 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-20 01:27:11,223 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-20 01:27:11,224 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-20 01:27:11,225 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-20 01:27:11,226 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-20 01:27:11,227 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-20 01:27:11,229 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-20 01:27:11,231 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-20 01:27:11,233 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-20 01:27:11,234 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-20 01:27:11,235 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-20 01:27:11,236 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-20 01:27:11,238 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-20 01:27:11,239 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-20 01:27:11,239 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-20 01:27:11,240 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-20 01:27:11,240 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-20 01:27:11,241 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-20 01:27:11,242 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-20 01:27:11,242 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-20 01:27:11,243 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-20 01:27:11,244 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-20 01:27:11,245 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-20 01:27:11,245 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-20 01:27:11,246 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-20 01:27:11,246 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-20 01:27:11,246 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-20 01:27:11,247 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-20 01:27:11,248 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-20 01:27:11,249 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-20 01:27:11,264 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-20 01:27:11,264 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-20 01:27:11,265 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-20 01:27:11,265 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-20 01:27:11,266 INFO L138 SettingsManager]: * Use SBE=true [2020-07-20 01:27:11,266 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-20 01:27:11,266 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-20 01:27:11,266 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-20 01:27:11,266 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-20 01:27:11,267 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-20 01:27:11,267 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-20 01:27:11,267 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-20 01:27:11,267 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-20 01:27:11,267 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-20 01:27:11,268 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-20 01:27:11,268 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-20 01:27:11,268 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-20 01:27:11,268 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-20 01:27:11,269 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-20 01:27:11,269 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-20 01:27:11,269 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-20 01:27:11,269 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-20 01:27:11,269 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-20 01:27:11,270 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-20 01:27:11,270 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-20 01:27:11,270 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-20 01:27:11,270 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 01:27:11,270 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-20 01:27:11,271 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-20 01:27:11,271 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Assert CodeBlocks Term Scoring Heuristic -> NUM_VARIABLES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Assert CodeBlocks Term Scoring Heuristic Partitioning Strategy -> FIXED_NUM_PARTITIONS Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Assert CodeBlocks Term Scoring Heuristic number of partitions -> 4 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> CAMEL_SMT_AM [2020-07-20 01:27:11,578 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-20 01:27:11,596 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-20 01:27:11,600 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-20 01:27:11,604 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-20 01:27:11,604 INFO L275 PluginConnector]: CDTParser initialized [2020-07-20 01:27:11,606 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ntdrivers-simplified/kbfiltr_simpl1.cil.c [2020-07-20 01:27:11,690 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9513e5c97/7eda92cbfb244521879b987e531518bf/FLAG5ddae2869 [2020-07-20 01:27:12,239 INFO L306 CDTParser]: Found 1 translation units. [2020-07-20 01:27:12,240 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers-simplified/kbfiltr_simpl1.cil.c [2020-07-20 01:27:12,251 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9513e5c97/7eda92cbfb244521879b987e531518bf/FLAG5ddae2869 [2020-07-20 01:27:12,564 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9513e5c97/7eda92cbfb244521879b987e531518bf [2020-07-20 01:27:12,575 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-20 01:27:12,578 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-20 01:27:12,579 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-20 01:27:12,580 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-20 01:27:12,583 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-20 01:27:12,584 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 01:27:12" (1/1) ... [2020-07-20 01:27:12,587 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35e69714 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 01:27:12, skipping insertion in model container [2020-07-20 01:27:12,588 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 01:27:12" (1/1) ... [2020-07-20 01:27:12,596 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-20 01:27:12,659 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-20 01:27:12,915 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-20 01:27:12,921 INFO L203 MainTranslator]: Completed pre-run [2020-07-20 01:27:13,100 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-20 01:27:13,120 INFO L208 MainTranslator]: Completed translation [2020-07-20 01:27:13,120 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 01:27:13 WrapperNode [2020-07-20 01:27:13,120 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-20 01:27:13,121 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-20 01:27:13,121 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-20 01:27:13,121 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-20 01:27:13,132 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 01:27:13" (1/1) ... [2020-07-20 01:27:13,133 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 01:27:13" (1/1) ... [2020-07-20 01:27:13,143 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 01:27:13" (1/1) ... [2020-07-20 01:27:13,143 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 01:27:13" (1/1) ... [2020-07-20 01:27:13,156 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 01:27:13" (1/1) ... [2020-07-20 01:27:13,164 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 01:27:13" (1/1) ... [2020-07-20 01:27:13,167 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 01:27:13" (1/1) ... [2020-07-20 01:27:13,172 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-20 01:27:13,172 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-20 01:27:13,173 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-20 01:27:13,173 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-20 01:27:13,174 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 01:27:13" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-20 01:27:13,236 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-20 01:27:13,236 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-20 01:27:13,236 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2020-07-20 01:27:13,236 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2020-07-20 01:27:13,236 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_PnP [2020-07-20 01:27:13,237 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-20 01:27:13,237 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2020-07-20 01:27:13,237 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2020-07-20 01:27:13,237 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2020-07-20 01:27:13,237 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2020-07-20 01:27:13,237 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2020-07-20 01:27:13,237 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_Complete [2020-07-20 01:27:13,238 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2020-07-20 01:27:13,238 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-20 01:27:13,238 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2020-07-20 01:27:13,238 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-20 01:27:13,238 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2020-07-20 01:27:13,238 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_PnP [2020-07-20 01:27:13,239 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2020-07-20 01:27:13,239 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2020-07-20 01:27:13,239 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2020-07-20 01:27:13,239 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_Complete [2020-07-20 01:27:13,239 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2020-07-20 01:27:13,239 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2020-07-20 01:27:13,240 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2020-07-20 01:27:13,240 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2020-07-20 01:27:13,240 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-20 01:27:13,240 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2020-07-20 01:27:13,240 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-20 01:27:13,240 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-20 01:27:13,555 WARN L775 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-07-20 01:27:13,654 INFO L728 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##14: assume !false; [2020-07-20 01:27:13,654 INFO L728 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##13: assume false; [2020-07-20 01:27:13,656 WARN L775 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-07-20 01:27:13,693 INFO L728 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##8: assume false; [2020-07-20 01:27:13,694 INFO L728 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##9: assume !false; [2020-07-20 01:27:13,706 WARN L775 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-07-20 01:27:13,728 INFO L728 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2020-07-20 01:27:13,728 INFO L728 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2020-07-20 01:27:13,742 WARN L775 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-07-20 01:27:13,891 INFO L728 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##43: assume false; [2020-07-20 01:27:13,892 INFO L728 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##44: assume !false; [2020-07-20 01:27:13,909 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-20 01:27:13,909 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-20 01:27:13,915 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 01:27:13 BoogieIcfgContainer [2020-07-20 01:27:13,915 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-20 01:27:13,917 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-20 01:27:13,917 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-20 01:27:13,921 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-20 01:27:13,921 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.07 01:27:12" (1/3) ... [2020-07-20 01:27:13,922 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@760d1dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 01:27:13, skipping insertion in model container [2020-07-20 01:27:13,923 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 01:27:13" (2/3) ... [2020-07-20 01:27:13,923 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@760d1dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 01:27:13, skipping insertion in model container [2020-07-20 01:27:13,923 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 01:27:13" (3/3) ... [2020-07-20 01:27:13,925 INFO L109 eAbstractionObserver]: Analyzing ICFG kbfiltr_simpl1.cil.c [2020-07-20 01:27:13,935 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-20 01:27:13,944 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-20 01:27:13,960 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-20 01:27:13,986 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-20 01:27:13,986 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-20 01:27:13,986 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-20 01:27:13,986 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-20 01:27:13,986 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-20 01:27:13,987 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-20 01:27:13,987 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-20 01:27:13,987 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-20 01:27:14,011 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states. [2020-07-20 01:27:14,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-07-20 01:27:14,020 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 01:27:14,021 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-07-20 01:27:14,021 INFO L427 AbstractCegarLoop]: === Iteration 1 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 01:27:14,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 01:27:14,028 INFO L82 PathProgramCache]: Analyzing trace with hash -1530382191, now seen corresponding path program 1 times [2020-07-20 01:27:14,038 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 01:27:14,038 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412941858] [2020-07-20 01:27:14,039 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@a832836 [2020-07-20 01:27:14,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 01:27:14,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 01:27:14,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 01:27:14,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 01:27:14,438 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412941858] [2020-07-20 01:27:14,439 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 01:27:14,439 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-20 01:27:14,440 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752737969] [2020-07-20 01:27:14,446 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-20 01:27:14,446 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 01:27:14,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-20 01:27:14,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-20 01:27:14,464 INFO L87 Difference]: Start difference. First operand 151 states. Second operand 5 states. [2020-07-20 01:27:15,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 01:27:15,162 INFO L93 Difference]: Finished difference Result 303 states and 463 transitions. [2020-07-20 01:27:15,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-20 01:27:15,163 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2020-07-20 01:27:15,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 01:27:15,178 INFO L225 Difference]: With dead ends: 303 [2020-07-20 01:27:15,179 INFO L226 Difference]: Without dead ends: 157 [2020-07-20 01:27:15,185 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-07-20 01:27:15,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2020-07-20 01:27:15,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 140. [2020-07-20 01:27:15,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2020-07-20 01:27:15,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 190 transitions. [2020-07-20 01:27:15,252 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 190 transitions. Word has length 20 [2020-07-20 01:27:15,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 01:27:15,253 INFO L479 AbstractCegarLoop]: Abstraction has 140 states and 190 transitions. [2020-07-20 01:27:15,253 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-20 01:27:15,253 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 190 transitions. [2020-07-20 01:27:15,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-20 01:27:15,254 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 01:27:15,255 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-07-20 01:27:15,255 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-20 01:27:15,255 INFO L427 AbstractCegarLoop]: === Iteration 2 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 01:27:15,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 01:27:15,256 INFO L82 PathProgramCache]: Analyzing trace with hash 1141575010, now seen corresponding path program 1 times [2020-07-20 01:27:15,256 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 01:27:15,256 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231815280] [2020-07-20 01:27:15,257 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@a832836 [2020-07-20 01:27:15,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 01:27:15,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 01:27:15,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 01:27:15,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 01:27:15,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 01:27:15,551 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231815280] [2020-07-20 01:27:15,552 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 01:27:15,552 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-20 01:27:15,552 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160053590] [2020-07-20 01:27:15,554 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-20 01:27:15,555 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 01:27:15,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-20 01:27:15,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-07-20 01:27:15,556 INFO L87 Difference]: Start difference. First operand 140 states and 190 transitions. Second operand 6 states. [2020-07-20 01:27:16,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 01:27:16,327 INFO L93 Difference]: Finished difference Result 275 states and 370 transitions. [2020-07-20 01:27:16,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-20 01:27:16,328 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2020-07-20 01:27:16,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 01:27:16,331 INFO L225 Difference]: With dead ends: 275 [2020-07-20 01:27:16,332 INFO L226 Difference]: Without dead ends: 219 [2020-07-20 01:27:16,333 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-07-20 01:27:16,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2020-07-20 01:27:16,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 195. [2020-07-20 01:27:16,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2020-07-20 01:27:16,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 259 transitions. [2020-07-20 01:27:16,363 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 259 transitions. Word has length 26 [2020-07-20 01:27:16,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 01:27:16,364 INFO L479 AbstractCegarLoop]: Abstraction has 195 states and 259 transitions. [2020-07-20 01:27:16,364 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-20 01:27:16,364 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 259 transitions. [2020-07-20 01:27:16,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-20 01:27:16,365 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 01:27:16,365 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-07-20 01:27:16,365 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-20 01:27:16,366 INFO L427 AbstractCegarLoop]: === Iteration 3 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 01:27:16,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 01:27:16,366 INFO L82 PathProgramCache]: Analyzing trace with hash 1029098174, now seen corresponding path program 1 times [2020-07-20 01:27:16,366 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 01:27:16,367 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189096917] [2020-07-20 01:27:16,367 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@a832836 [2020-07-20 01:27:16,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 01:27:16,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 01:27:16,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 01:27:16,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 01:27:16,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 01:27:16,564 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189096917] [2020-07-20 01:27:16,564 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 01:27:16,564 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-20 01:27:16,564 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964864951] [2020-07-20 01:27:16,565 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-20 01:27:16,565 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 01:27:16,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-20 01:27:16,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-07-20 01:27:16,566 INFO L87 Difference]: Start difference. First operand 195 states and 259 transitions. Second operand 6 states. [2020-07-20 01:27:16,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 01:27:16,971 INFO L93 Difference]: Finished difference Result 316 states and 413 transitions. [2020-07-20 01:27:16,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-20 01:27:16,971 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2020-07-20 01:27:16,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 01:27:16,975 INFO L225 Difference]: With dead ends: 316 [2020-07-20 01:27:16,975 INFO L226 Difference]: Without dead ends: 254 [2020-07-20 01:27:16,977 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-07-20 01:27:16,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2020-07-20 01:27:17,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 217. [2020-07-20 01:27:17,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2020-07-20 01:27:17,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 289 transitions. [2020-07-20 01:27:17,006 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 289 transitions. Word has length 27 [2020-07-20 01:27:17,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 01:27:17,006 INFO L479 AbstractCegarLoop]: Abstraction has 217 states and 289 transitions. [2020-07-20 01:27:17,006 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-20 01:27:17,007 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 289 transitions. [2020-07-20 01:27:17,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-07-20 01:27:17,008 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 01:27:17,009 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-07-20 01:27:17,009 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-20 01:27:17,009 INFO L427 AbstractCegarLoop]: === Iteration 4 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 01:27:17,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 01:27:17,010 INFO L82 PathProgramCache]: Analyzing trace with hash 742933031, now seen corresponding path program 1 times [2020-07-20 01:27:17,010 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 01:27:17,010 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662768308] [2020-07-20 01:27:17,010 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@a832836 [2020-07-20 01:27:17,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 01:27:17,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 01:27:17,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 01:27:17,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 01:27:17,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 01:27:17,186 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662768308] [2020-07-20 01:27:17,186 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 01:27:17,186 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-20 01:27:17,186 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263531108] [2020-07-20 01:27:17,187 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-20 01:27:17,187 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 01:27:17,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-20 01:27:17,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-07-20 01:27:17,188 INFO L87 Difference]: Start difference. First operand 217 states and 289 transitions. Second operand 6 states. [2020-07-20 01:27:17,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 01:27:17,746 INFO L93 Difference]: Finished difference Result 220 states and 291 transitions. [2020-07-20 01:27:17,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-20 01:27:17,747 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 37 [2020-07-20 01:27:17,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 01:27:17,750 INFO L225 Difference]: With dead ends: 220 [2020-07-20 01:27:17,750 INFO L226 Difference]: Without dead ends: 217 [2020-07-20 01:27:17,755 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-07-20 01:27:17,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2020-07-20 01:27:17,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2020-07-20 01:27:17,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2020-07-20 01:27:17,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 288 transitions. [2020-07-20 01:27:17,786 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 288 transitions. Word has length 37 [2020-07-20 01:27:17,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 01:27:17,786 INFO L479 AbstractCegarLoop]: Abstraction has 217 states and 288 transitions. [2020-07-20 01:27:17,786 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-20 01:27:17,786 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 288 transitions. [2020-07-20 01:27:17,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2020-07-20 01:27:17,789 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 01:27:17,789 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-07-20 01:27:17,789 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-20 01:27:17,790 INFO L427 AbstractCegarLoop]: === Iteration 5 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 01:27:17,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 01:27:17,790 INFO L82 PathProgramCache]: Analyzing trace with hash 324263340, now seen corresponding path program 1 times [2020-07-20 01:27:17,790 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 01:27:17,791 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882304208] [2020-07-20 01:27:17,791 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@a832836 [2020-07-20 01:27:17,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 01:27:17,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 01:27:17,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 01:27:17,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 01:27:17,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 01:27:17,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 01:27:17,966 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882304208] [2020-07-20 01:27:17,967 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 01:27:17,967 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-20 01:27:17,967 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997606389] [2020-07-20 01:27:17,968 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-20 01:27:17,968 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 01:27:17,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-20 01:27:17,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-07-20 01:27:17,969 INFO L87 Difference]: Start difference. First operand 217 states and 288 transitions. Second operand 8 states. [2020-07-20 01:27:18,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 01:27:18,753 INFO L93 Difference]: Finished difference Result 274 states and 356 transitions. [2020-07-20 01:27:18,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-20 01:27:18,754 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 45 [2020-07-20 01:27:18,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 01:27:18,756 INFO L225 Difference]: With dead ends: 274 [2020-07-20 01:27:18,756 INFO L226 Difference]: Without dead ends: 208 [2020-07-20 01:27:18,757 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-07-20 01:27:18,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2020-07-20 01:27:18,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 190. [2020-07-20 01:27:18,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2020-07-20 01:27:18,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 250 transitions. [2020-07-20 01:27:18,785 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 250 transitions. Word has length 45 [2020-07-20 01:27:18,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 01:27:18,786 INFO L479 AbstractCegarLoop]: Abstraction has 190 states and 250 transitions. [2020-07-20 01:27:18,786 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-20 01:27:18,786 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 250 transitions. [2020-07-20 01:27:18,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-07-20 01:27:18,789 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 01:27:18,789 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-07-20 01:27:18,789 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-20 01:27:18,789 INFO L427 AbstractCegarLoop]: === Iteration 6 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 01:27:18,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 01:27:18,790 INFO L82 PathProgramCache]: Analyzing trace with hash 726030577, now seen corresponding path program 1 times [2020-07-20 01:27:18,790 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 01:27:18,790 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055764403] [2020-07-20 01:27:18,790 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@a832836 [2020-07-20 01:27:18,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 01:27:18,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 01:27:18,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 01:27:18,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 01:27:18,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 01:27:18,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 01:27:18,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 01:27:18,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 01:27:18,973 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055764403] [2020-07-20 01:27:18,973 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 01:27:18,973 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-20 01:27:18,973 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217340577] [2020-07-20 01:27:18,974 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-20 01:27:18,974 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 01:27:18,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-20 01:27:18,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-07-20 01:27:18,975 INFO L87 Difference]: Start difference. First operand 190 states and 250 transitions. Second operand 8 states. [2020-07-20 01:27:19,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 01:27:19,519 INFO L93 Difference]: Finished difference Result 258 states and 336 transitions. [2020-07-20 01:27:19,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-20 01:27:19,519 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 51 [2020-07-20 01:27:19,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 01:27:19,522 INFO L225 Difference]: With dead ends: 258 [2020-07-20 01:27:19,523 INFO L226 Difference]: Without dead ends: 197 [2020-07-20 01:27:19,525 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-07-20 01:27:19,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2020-07-20 01:27:19,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 188. [2020-07-20 01:27:19,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2020-07-20 01:27:19,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 246 transitions. [2020-07-20 01:27:19,559 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 246 transitions. Word has length 51 [2020-07-20 01:27:19,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 01:27:19,560 INFO L479 AbstractCegarLoop]: Abstraction has 188 states and 246 transitions. [2020-07-20 01:27:19,560 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-20 01:27:19,560 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 246 transitions. [2020-07-20 01:27:19,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-07-20 01:27:19,571 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 01:27:19,571 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-07-20 01:27:19,571 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-20 01:27:19,571 INFO L427 AbstractCegarLoop]: === Iteration 7 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 01:27:19,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 01:27:19,572 INFO L82 PathProgramCache]: Analyzing trace with hash 572107035, now seen corresponding path program 1 times [2020-07-20 01:27:19,572 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 01:27:19,573 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408630850] [2020-07-20 01:27:19,573 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@a832836 [2020-07-20 01:27:19,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 01:27:19,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 01:27:19,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 01:27:19,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 01:27:19,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 01:27:19,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 01:27:19,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 01:27:19,890 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408630850] [2020-07-20 01:27:19,890 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 01:27:19,890 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-07-20 01:27:19,890 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593756360] [2020-07-20 01:27:19,891 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-20 01:27:19,891 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 01:27:19,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-20 01:27:19,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2020-07-20 01:27:19,891 INFO L87 Difference]: Start difference. First operand 188 states and 246 transitions. Second operand 10 states. [2020-07-20 01:27:20,608 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 59 [2020-07-20 01:27:20,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 01:27:20,900 INFO L93 Difference]: Finished difference Result 243 states and 316 transitions. [2020-07-20 01:27:20,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-20 01:27:20,902 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 50 [2020-07-20 01:27:20,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 01:27:20,907 INFO L225 Difference]: With dead ends: 243 [2020-07-20 01:27:20,907 INFO L226 Difference]: Without dead ends: 238 [2020-07-20 01:27:20,908 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-07-20 01:27:20,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2020-07-20 01:27:20,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 205. [2020-07-20 01:27:20,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2020-07-20 01:27:20,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 267 transitions. [2020-07-20 01:27:20,936 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 267 transitions. Word has length 50 [2020-07-20 01:27:20,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 01:27:20,937 INFO L479 AbstractCegarLoop]: Abstraction has 205 states and 267 transitions. [2020-07-20 01:27:20,937 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-20 01:27:20,937 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 267 transitions. [2020-07-20 01:27:20,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-07-20 01:27:20,939 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 01:27:20,940 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-07-20 01:27:20,940 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-20 01:27:20,940 INFO L427 AbstractCegarLoop]: === Iteration 8 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 01:27:20,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 01:27:20,941 INFO L82 PathProgramCache]: Analyzing trace with hash 176400751, now seen corresponding path program 1 times [2020-07-20 01:27:20,941 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 01:27:20,941 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552205982] [2020-07-20 01:27:20,942 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@a832836 [2020-07-20 01:27:20,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 01:27:21,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 01:27:21,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 01:27:21,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 01:27:21,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 01:27:21,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 01:27:21,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 01:27:21,222 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552205982] [2020-07-20 01:27:21,222 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 01:27:21,223 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-07-20 01:27:21,223 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368939349] [2020-07-20 01:27:21,223 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-07-20 01:27:21,224 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 01:27:21,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-07-20 01:27:21,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2020-07-20 01:27:21,225 INFO L87 Difference]: Start difference. First operand 205 states and 267 transitions. Second operand 14 states. [2020-07-20 01:27:22,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 01:27:22,582 INFO L93 Difference]: Finished difference Result 246 states and 313 transitions. [2020-07-20 01:27:22,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-07-20 01:27:22,583 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 51 [2020-07-20 01:27:22,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 01:27:22,585 INFO L225 Difference]: With dead ends: 246 [2020-07-20 01:27:22,589 INFO L226 Difference]: Without dead ends: 222 [2020-07-20 01:27:22,590 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-07-20 01:27:22,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2020-07-20 01:27:22,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 188. [2020-07-20 01:27:22,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2020-07-20 01:27:22,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 244 transitions. [2020-07-20 01:27:22,616 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 244 transitions. Word has length 51 [2020-07-20 01:27:22,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 01:27:22,625 INFO L479 AbstractCegarLoop]: Abstraction has 188 states and 244 transitions. [2020-07-20 01:27:22,626 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-07-20 01:27:22,626 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 244 transitions. [2020-07-20 01:27:22,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-07-20 01:27:22,629 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 01:27:22,629 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-07-20 01:27:22,630 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-20 01:27:22,630 INFO L427 AbstractCegarLoop]: === Iteration 9 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 01:27:22,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 01:27:22,630 INFO L82 PathProgramCache]: Analyzing trace with hash 1461171158, now seen corresponding path program 1 times [2020-07-20 01:27:22,631 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 01:27:22,631 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680739491] [2020-07-20 01:27:22,631 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@a832836 [2020-07-20 01:27:22,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 01:27:22,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 01:27:22,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 01:27:22,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 01:27:22,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 01:27:22,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 01:27:22,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 01:27:22,849 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680739491] [2020-07-20 01:27:22,849 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 01:27:22,850 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-20 01:27:22,850 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378526417] [2020-07-20 01:27:22,850 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-20 01:27:22,850 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 01:27:22,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-20 01:27:22,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-07-20 01:27:22,851 INFO L87 Difference]: Start difference. First operand 188 states and 244 transitions. Second operand 8 states. [2020-07-20 01:27:23,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 01:27:23,092 INFO L93 Difference]: Finished difference Result 203 states and 262 transitions. [2020-07-20 01:27:23,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-20 01:27:23,093 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 52 [2020-07-20 01:27:23,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 01:27:23,095 INFO L225 Difference]: With dead ends: 203 [2020-07-20 01:27:23,095 INFO L226 Difference]: Without dead ends: 91 [2020-07-20 01:27:23,096 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-07-20 01:27:23,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2020-07-20 01:27:23,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2020-07-20 01:27:23,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2020-07-20 01:27:23,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 102 transitions. [2020-07-20 01:27:23,109 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 102 transitions. Word has length 52 [2020-07-20 01:27:23,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 01:27:23,112 INFO L479 AbstractCegarLoop]: Abstraction has 91 states and 102 transitions. [2020-07-20 01:27:23,112 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-20 01:27:23,112 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 102 transitions. [2020-07-20 01:27:23,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2020-07-20 01:27:23,113 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 01:27:23,114 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-07-20 01:27:23,114 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-20 01:27:23,114 INFO L427 AbstractCegarLoop]: === Iteration 10 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 01:27:23,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 01:27:23,115 INFO L82 PathProgramCache]: Analyzing trace with hash -1516710605, now seen corresponding path program 1 times [2020-07-20 01:27:23,115 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 01:27:23,115 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81951958] [2020-07-20 01:27:23,116 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@a832836 [2020-07-20 01:27:23,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 01:27:23,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 01:27:23,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 01:27:23,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 01:27:23,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 01:27:23,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 01:27:23,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 01:27:23,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 01:27:23,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 01:27:23,370 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81951958] [2020-07-20 01:27:23,371 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 01:27:23,371 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-07-20 01:27:23,371 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358886413] [2020-07-20 01:27:23,373 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-20 01:27:23,373 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 01:27:23,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-20 01:27:23,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2020-07-20 01:27:23,374 INFO L87 Difference]: Start difference. First operand 91 states and 102 transitions. Second operand 11 states. [2020-07-20 01:27:23,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 01:27:23,823 INFO L93 Difference]: Finished difference Result 119 states and 135 transitions. [2020-07-20 01:27:23,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-20 01:27:23,824 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 59 [2020-07-20 01:27:23,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 01:27:23,825 INFO L225 Difference]: With dead ends: 119 [2020-07-20 01:27:23,825 INFO L226 Difference]: Without dead ends: 91 [2020-07-20 01:27:23,826 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-07-20 01:27:23,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2020-07-20 01:27:23,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2020-07-20 01:27:23,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2020-07-20 01:27:23,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 101 transitions. [2020-07-20 01:27:23,836 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 101 transitions. Word has length 59 [2020-07-20 01:27:23,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 01:27:23,837 INFO L479 AbstractCegarLoop]: Abstraction has 91 states and 101 transitions. [2020-07-20 01:27:23,837 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-20 01:27:23,837 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 101 transitions. [2020-07-20 01:27:23,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-07-20 01:27:23,838 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 01:27:23,838 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-07-20 01:27:23,838 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-20 01:27:23,838 INFO L427 AbstractCegarLoop]: === Iteration 11 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 01:27:23,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 01:27:23,839 INFO L82 PathProgramCache]: Analyzing trace with hash -14076392, now seen corresponding path program 1 times [2020-07-20 01:27:23,839 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 01:27:23,839 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847533471] [2020-07-20 01:27:23,839 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@a832836 [2020-07-20 01:27:23,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 01:27:23,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 01:27:23,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 01:27:23,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 01:27:23,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 01:27:23,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 01:27:23,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 01:27:24,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 01:27:24,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 01:27:24,017 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847533471] [2020-07-20 01:27:24,018 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 01:27:24,018 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-07-20 01:27:24,018 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130277558] [2020-07-20 01:27:24,018 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-20 01:27:24,019 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 01:27:24,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-20 01:27:24,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2020-07-20 01:27:24,019 INFO L87 Difference]: Start difference. First operand 91 states and 101 transitions. Second operand 9 states. [2020-07-20 01:27:24,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 01:27:24,253 INFO L93 Difference]: Finished difference Result 125 states and 141 transitions. [2020-07-20 01:27:24,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-20 01:27:24,254 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 61 [2020-07-20 01:27:24,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 01:27:24,255 INFO L225 Difference]: With dead ends: 125 [2020-07-20 01:27:24,255 INFO L226 Difference]: Without dead ends: 97 [2020-07-20 01:27:24,256 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2020-07-20 01:27:24,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2020-07-20 01:27:24,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 94. [2020-07-20 01:27:24,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2020-07-20 01:27:24,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 104 transitions. [2020-07-20 01:27:24,268 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 104 transitions. Word has length 61 [2020-07-20 01:27:24,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 01:27:24,269 INFO L479 AbstractCegarLoop]: Abstraction has 94 states and 104 transitions. [2020-07-20 01:27:24,269 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-20 01:27:24,269 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 104 transitions. [2020-07-20 01:27:24,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-07-20 01:27:24,270 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 01:27:24,270 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-07-20 01:27:24,271 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-07-20 01:27:24,271 INFO L427 AbstractCegarLoop]: === Iteration 12 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 01:27:24,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 01:27:24,271 INFO L82 PathProgramCache]: Analyzing trace with hash -600882406, now seen corresponding path program 1 times [2020-07-20 01:27:24,272 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 01:27:24,272 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631537140] [2020-07-20 01:27:24,272 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@a832836 [2020-07-20 01:27:24,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 01:27:24,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 01:27:24,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 01:27:24,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 01:27:24,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 01:27:24,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 01:27:24,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 01:27:24,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 01:27:24,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 01:27:24,547 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631537140] [2020-07-20 01:27:24,548 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 01:27:24,548 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-07-20 01:27:24,548 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717971376] [2020-07-20 01:27:24,549 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-20 01:27:24,549 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 01:27:24,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-20 01:27:24,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2020-07-20 01:27:24,550 INFO L87 Difference]: Start difference. First operand 94 states and 104 transitions. Second operand 12 states. [2020-07-20 01:27:24,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 01:27:24,953 INFO L93 Difference]: Finished difference Result 112 states and 124 transitions. [2020-07-20 01:27:24,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-20 01:27:24,954 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 61 [2020-07-20 01:27:24,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 01:27:24,955 INFO L225 Difference]: With dead ends: 112 [2020-07-20 01:27:24,956 INFO L226 Difference]: Without dead ends: 93 [2020-07-20 01:27:24,956 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-07-20 01:27:24,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2020-07-20 01:27:24,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 89. [2020-07-20 01:27:24,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2020-07-20 01:27:24,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 97 transitions. [2020-07-20 01:27:24,965 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 97 transitions. Word has length 61 [2020-07-20 01:27:24,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 01:27:24,966 INFO L479 AbstractCegarLoop]: Abstraction has 89 states and 97 transitions. [2020-07-20 01:27:24,966 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-20 01:27:24,966 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 97 transitions. [2020-07-20 01:27:24,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2020-07-20 01:27:24,967 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 01:27:24,967 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-07-20 01:27:24,967 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-07-20 01:27:24,967 INFO L427 AbstractCegarLoop]: === Iteration 13 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 01:27:24,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 01:27:24,968 INFO L82 PathProgramCache]: Analyzing trace with hash -673462309, now seen corresponding path program 1 times [2020-07-20 01:27:24,968 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 01:27:24,968 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691223283] [2020-07-20 01:27:24,968 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@a832836 [2020-07-20 01:27:24,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 01:27:25,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 01:27:25,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 01:27:25,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 01:27:25,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 01:27:25,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 01:27:25,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 01:27:25,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 01:27:25,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 01:27:25,143 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691223283] [2020-07-20 01:27:25,143 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 01:27:25,143 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-07-20 01:27:25,143 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165885232] [2020-07-20 01:27:25,144 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-20 01:27:25,144 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 01:27:25,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-20 01:27:25,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2020-07-20 01:27:25,145 INFO L87 Difference]: Start difference. First operand 89 states and 97 transitions. Second operand 9 states. [2020-07-20 01:27:25,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 01:27:25,324 INFO L93 Difference]: Finished difference Result 105 states and 114 transitions. [2020-07-20 01:27:25,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-20 01:27:25,329 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 62 [2020-07-20 01:27:25,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 01:27:25,330 INFO L225 Difference]: With dead ends: 105 [2020-07-20 01:27:25,330 INFO L226 Difference]: Without dead ends: 100 [2020-07-20 01:27:25,331 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-07-20 01:27:25,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2020-07-20 01:27:25,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 91. [2020-07-20 01:27:25,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2020-07-20 01:27:25,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 98 transitions. [2020-07-20 01:27:25,340 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 98 transitions. Word has length 62 [2020-07-20 01:27:25,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 01:27:25,341 INFO L479 AbstractCegarLoop]: Abstraction has 91 states and 98 transitions. [2020-07-20 01:27:25,341 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-20 01:27:25,341 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 98 transitions. [2020-07-20 01:27:25,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2020-07-20 01:27:25,342 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 01:27:25,342 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-07-20 01:27:25,342 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-07-20 01:27:25,342 INFO L427 AbstractCegarLoop]: === Iteration 14 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 01:27:25,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 01:27:25,343 INFO L82 PathProgramCache]: Analyzing trace with hash 475938380, now seen corresponding path program 1 times [2020-07-20 01:27:25,343 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 01:27:25,343 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151581548] [2020-07-20 01:27:25,343 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@a832836 [2020-07-20 01:27:25,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 01:27:25,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 01:27:25,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 01:27:25,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 01:27:25,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 01:27:25,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 01:27:25,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 01:27:25,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 01:27:25,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 01:27:25,595 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151581548] [2020-07-20 01:27:25,595 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 01:27:25,595 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-07-20 01:27:25,595 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388476736] [2020-07-20 01:27:25,595 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-20 01:27:25,596 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 01:27:25,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-20 01:27:25,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2020-07-20 01:27:25,596 INFO L87 Difference]: Start difference. First operand 91 states and 98 transitions. Second operand 12 states. [2020-07-20 01:27:25,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 01:27:25,914 INFO L93 Difference]: Finished difference Result 98 states and 104 transitions. [2020-07-20 01:27:25,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-20 01:27:25,914 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 62 [2020-07-20 01:27:25,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 01:27:25,915 INFO L225 Difference]: With dead ends: 98 [2020-07-20 01:27:25,915 INFO L226 Difference]: Without dead ends: 91 [2020-07-20 01:27:25,916 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-07-20 01:27:25,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2020-07-20 01:27:25,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2020-07-20 01:27:25,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2020-07-20 01:27:25,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 97 transitions. [2020-07-20 01:27:25,926 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 97 transitions. Word has length 62 [2020-07-20 01:27:25,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 01:27:25,926 INFO L479 AbstractCegarLoop]: Abstraction has 91 states and 97 transitions. [2020-07-20 01:27:25,926 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-20 01:27:25,926 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 97 transitions. [2020-07-20 01:27:25,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-07-20 01:27:25,927 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 01:27:25,927 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-07-20 01:27:25,927 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-07-20 01:27:25,927 INFO L427 AbstractCegarLoop]: === Iteration 15 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 01:27:25,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 01:27:25,928 INFO L82 PathProgramCache]: Analyzing trace with hash 359859562, now seen corresponding path program 1 times [2020-07-20 01:27:25,928 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 01:27:25,928 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953435933] [2020-07-20 01:27:25,928 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@a832836 [2020-07-20 01:27:25,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 01:27:26,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 01:27:26,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 01:27:26,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 01:27:26,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 01:27:26,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 01:27:26,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 01:27:26,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 01:27:26,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 01:27:26,146 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953435933] [2020-07-20 01:27:26,147 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 01:27:26,147 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-07-20 01:27:26,147 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84702550] [2020-07-20 01:27:26,147 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-20 01:27:26,148 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 01:27:26,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-20 01:27:26,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2020-07-20 01:27:26,148 INFO L87 Difference]: Start difference. First operand 91 states and 97 transitions. Second operand 10 states. [2020-07-20 01:27:26,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 01:27:26,557 INFO L93 Difference]: Finished difference Result 107 states and 114 transitions. [2020-07-20 01:27:26,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-20 01:27:26,558 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 63 [2020-07-20 01:27:26,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 01:27:26,559 INFO L225 Difference]: With dead ends: 107 [2020-07-20 01:27:26,559 INFO L226 Difference]: Without dead ends: 76 [2020-07-20 01:27:26,560 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2020-07-20 01:27:26,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2020-07-20 01:27:26,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2020-07-20 01:27:26,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2020-07-20 01:27:26,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 79 transitions. [2020-07-20 01:27:26,574 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 79 transitions. Word has length 63 [2020-07-20 01:27:26,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 01:27:26,575 INFO L479 AbstractCegarLoop]: Abstraction has 76 states and 79 transitions. [2020-07-20 01:27:26,575 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-20 01:27:26,575 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 79 transitions. [2020-07-20 01:27:26,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-07-20 01:27:26,576 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 01:27:26,576 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-07-20 01:27:26,576 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-07-20 01:27:26,576 INFO L427 AbstractCegarLoop]: === Iteration 16 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 01:27:26,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 01:27:26,577 INFO L82 PathProgramCache]: Analyzing trace with hash 1228040100, now seen corresponding path program 1 times [2020-07-20 01:27:26,577 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 01:27:26,577 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100534957] [2020-07-20 01:27:26,577 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@a832836 [2020-07-20 01:27:26,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 01:27:26,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 01:27:26,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 01:27:26,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 01:27:26,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 01:27:26,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 01:27:26,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 01:27:26,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 01:27:26,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 01:27:26,813 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100534957] [2020-07-20 01:27:26,815 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 01:27:26,815 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-07-20 01:27:26,815 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605737799] [2020-07-20 01:27:26,816 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-20 01:27:26,816 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 01:27:26,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-20 01:27:26,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2020-07-20 01:27:26,817 INFO L87 Difference]: Start difference. First operand 76 states and 79 transitions. Second operand 9 states. [2020-07-20 01:27:27,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 01:27:27,112 INFO L93 Difference]: Finished difference Result 141 states and 146 transitions. [2020-07-20 01:27:27,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-20 01:27:27,112 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 63 [2020-07-20 01:27:27,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 01:27:27,114 INFO L225 Difference]: With dead ends: 141 [2020-07-20 01:27:27,114 INFO L226 Difference]: Without dead ends: 134 [2020-07-20 01:27:27,115 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-07-20 01:27:27,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2020-07-20 01:27:27,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 133. [2020-07-20 01:27:27,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2020-07-20 01:27:27,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 138 transitions. [2020-07-20 01:27:27,140 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 138 transitions. Word has length 63 [2020-07-20 01:27:27,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 01:27:27,141 INFO L479 AbstractCegarLoop]: Abstraction has 133 states and 138 transitions. [2020-07-20 01:27:27,141 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-20 01:27:27,141 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 138 transitions. [2020-07-20 01:27:27,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-07-20 01:27:27,142 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 01:27:27,142 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-07-20 01:27:27,142 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-07-20 01:27:27,143 INFO L427 AbstractCegarLoop]: === Iteration 17 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 01:27:27,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 01:27:27,143 INFO L82 PathProgramCache]: Analyzing trace with hash -1291919834, now seen corresponding path program 1 times [2020-07-20 01:27:27,143 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 01:27:27,144 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237010778] [2020-07-20 01:27:27,144 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@a832836 [2020-07-20 01:27:27,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 01:27:27,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 01:27:27,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 01:27:27,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 01:27:27,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 01:27:27,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 01:27:27,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 01:27:27,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 01:27:27,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 01:27:27,491 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237010778] [2020-07-20 01:27:27,492 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 01:27:27,492 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-07-20 01:27:27,492 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192926618] [2020-07-20 01:27:27,493 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-20 01:27:27,493 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 01:27:27,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-20 01:27:27,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2020-07-20 01:27:27,494 INFO L87 Difference]: Start difference. First operand 133 states and 138 transitions. Second operand 12 states. [2020-07-20 01:27:27,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 01:27:27,827 INFO L93 Difference]: Finished difference Result 144 states and 149 transitions. [2020-07-20 01:27:27,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-20 01:27:27,827 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 63 [2020-07-20 01:27:27,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 01:27:27,828 INFO L225 Difference]: With dead ends: 144 [2020-07-20 01:27:27,828 INFO L226 Difference]: Without dead ends: 133 [2020-07-20 01:27:27,829 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-07-20 01:27:27,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2020-07-20 01:27:27,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2020-07-20 01:27:27,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2020-07-20 01:27:27,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 136 transitions. [2020-07-20 01:27:27,851 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 136 transitions. Word has length 63 [2020-07-20 01:27:27,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 01:27:27,851 INFO L479 AbstractCegarLoop]: Abstraction has 133 states and 136 transitions. [2020-07-20 01:27:27,851 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-20 01:27:27,851 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 136 transitions. [2020-07-20 01:27:27,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2020-07-20 01:27:27,854 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 01:27:27,855 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-07-20 01:27:27,855 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-07-20 01:27:27,855 INFO L427 AbstractCegarLoop]: === Iteration 18 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 01:27:27,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 01:27:27,856 INFO L82 PathProgramCache]: Analyzing trace with hash 1154361885, now seen corresponding path program 1 times [2020-07-20 01:27:27,856 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 01:27:27,857 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486834501] [2020-07-20 01:27:27,857 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@a832836 [2020-07-20 01:27:27,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 01:27:27,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 01:27:28,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 01:27:28,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 01:27:28,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 01:27:28,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 01:27:28,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 01:27:28,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 01:27:28,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 01:27:28,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 01:27:28,172 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486834501] [2020-07-20 01:27:28,173 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 01:27:28,173 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-07-20 01:27:28,173 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522608781] [2020-07-20 01:27:28,176 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-20 01:27:28,179 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 01:27:28,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-20 01:27:28,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2020-07-20 01:27:28,185 INFO L87 Difference]: Start difference. First operand 133 states and 136 transitions. Second operand 11 states. [2020-07-20 01:27:28,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 01:27:28,422 INFO L93 Difference]: Finished difference Result 133 states and 136 transitions. [2020-07-20 01:27:28,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-20 01:27:28,423 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 74 [2020-07-20 01:27:28,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 01:27:28,424 INFO L225 Difference]: With dead ends: 133 [2020-07-20 01:27:28,424 INFO L226 Difference]: Without dead ends: 0 [2020-07-20 01:27:28,426 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2020-07-20 01:27:28,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-20 01:27:28,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-20 01:27:28,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-20 01:27:28,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-20 01:27:28,427 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 74 [2020-07-20 01:27:28,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 01:27:28,430 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-20 01:27:28,430 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-20 01:27:28,430 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-20 01:27:28,431 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-20 01:27:28,431 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-07-20 01:27:28,435 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-20 01:27:29,431 WARN L193 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 51 [2020-07-20 01:27:29,634 WARN L193 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 48 [2020-07-20 01:27:29,983 WARN L193 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 43 [2020-07-20 01:27:30,286 WARN L193 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 56 [2020-07-20 01:27:30,454 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 62 [2020-07-20 01:27:30,723 WARN L193 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 50 [2020-07-20 01:27:30,951 WARN L193 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 34 [2020-07-20 01:27:31,224 WARN L193 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 49 [2020-07-20 01:27:31,615 WARN L193 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 36 [2020-07-20 01:27:31,796 WARN L193 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 47 [2020-07-20 01:27:32,020 WARN L193 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 49 [2020-07-20 01:27:32,198 WARN L193 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 48 [2020-07-20 01:27:32,341 WARN L193 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 34 [2020-07-20 01:27:32,794 WARN L193 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 62 [2020-07-20 01:27:32,979 WARN L193 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 49 [2020-07-20 01:27:33,148 WARN L193 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 49 [2020-07-20 01:27:33,317 WARN L193 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 56 [2020-07-20 01:27:33,447 WARN L193 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 71 [2020-07-20 01:27:33,644 WARN L193 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 43 [2020-07-20 01:27:33,858 WARN L193 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 49 [2020-07-20 01:27:33,964 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 43 [2020-07-20 01:27:34,163 WARN L193 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 49 [2020-07-20 01:27:34,266 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 40 [2020-07-20 01:27:34,477 WARN L193 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 48 [2020-07-20 01:27:34,642 WARN L193 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 50 [2020-07-20 01:27:34,808 WARN L193 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 37 [2020-07-20 01:27:34,928 WARN L193 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 40 [2020-07-20 01:27:35,071 WARN L193 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 34 [2020-07-20 01:27:35,121 INFO L264 CegarLoopResult]: At program point KeSetEventENTRY(lines 513 520) the Hoare annotation is: (or (not (= ~s~0 ~NP~0)) (not (<= 1 ~NP~0)) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (= 1 ~pended~0) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (<= ~NP~0 1)) (not (<= 1 ~compRegistered~0))) [2020-07-20 01:27:35,121 INFO L268 CegarLoopResult]: For program point KeSetEventFINAL(lines 513 520) no Hoare annotation was computed. [2020-07-20 01:27:35,121 INFO L268 CegarLoopResult]: For program point KeSetEventEXIT(lines 513 520) no Hoare annotation was computed. [2020-07-20 01:27:35,122 INFO L264 CegarLoopResult]: At program point KbFilter_CompleteENTRY(lines 563 573) the Hoare annotation is: (or (not (= ~s~0 ~NP~0)) (not (<= 1 ~NP~0)) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (= 1 ~pended~0) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (<= ~NP~0 1)) (not (<= 1 ~compRegistered~0))) [2020-07-20 01:27:35,122 INFO L264 CegarLoopResult]: At program point L569(line 569) the Hoare annotation is: (or (not (= ~s~0 ~NP~0)) (not (<= 1 ~NP~0)) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (= 1 ~pended~0) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (<= ~NP~0 1)) (not (<= 1 ~compRegistered~0))) [2020-07-20 01:27:35,122 INFO L268 CegarLoopResult]: For program point L569-1(line 569) no Hoare annotation was computed. [2020-07-20 01:27:35,123 INFO L268 CegarLoopResult]: For program point KbFilter_CompleteFINAL(lines 563 573) no Hoare annotation was computed. [2020-07-20 01:27:35,123 INFO L268 CegarLoopResult]: For program point KbFilter_CompleteEXIT(lines 563 573) no Hoare annotation was computed. [2020-07-20 01:27:35,123 INFO L268 CegarLoopResult]: For program point stub_driver_initEXIT(lines 35 48) no Hoare annotation was computed. [2020-07-20 01:27:35,124 INFO L264 CegarLoopResult]: At program point stub_driver_initENTRY(lines 35 48) the Hoare annotation is: (or (and (= ~pended~0 |old(~pended~0)|) (= |old(~compRegistered~0)| ~compRegistered~0) (= ~s~0 ~NP~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~compFptr~0 |old(~compFptr~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|)) (not (<= 1 ~NP~0)) (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (= ~NP~0 |old(~s~0)|)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (<= ~NP~0 1)) (= 1 |old(~pended~0)|) (not (= 0 |old(~compRegistered~0)|))) [2020-07-20 01:27:35,124 INFO L268 CegarLoopResult]: For program point stub_driver_initFINAL(lines 35 48) no Hoare annotation was computed. [2020-07-20 01:27:35,124 INFO L268 CegarLoopResult]: For program point _BLAST_initFINAL(lines 49 70) no Hoare annotation was computed. [2020-07-20 01:27:35,124 INFO L264 CegarLoopResult]: At program point _BLAST_initENTRY(lines 49 70) the Hoare annotation is: (or (not (= |old(~NP~0)| |old(~MPR1~0)|)) (and (= ~pended~0 |old(~pended~0)|) (= ~DC~0 |old(~DC~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compRegistered~0)| ~compRegistered~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~MPR1~0 ~s~0) (= ~compFptr~0 |old(~compFptr~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~MPR1~0 ~NP~0) (= ~MPR3~0 ~s~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~SKIP1~0 ~s~0) (= ~MPR3~0 |old(~MPR3~0)|)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (= 1 |old(~pended~0)|) (not (= 0 |old(~compRegistered~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (<= |old(~IPC~0)| |old(~s~0)|))) [2020-07-20 01:27:35,125 INFO L268 CegarLoopResult]: For program point _BLAST_initEXIT(lines 49 70) no Hoare annotation was computed. [2020-07-20 01:27:35,125 INFO L271 CegarLoopResult]: At program point errorFnENTRY(lines 575 582) the Hoare annotation is: true [2020-07-20 01:27:35,125 INFO L268 CegarLoopResult]: For program point errorFnFINAL(lines 575 582) no Hoare annotation was computed. [2020-07-20 01:27:35,125 INFO L268 CegarLoopResult]: For program point errorFnEXIT(lines 575 582) no Hoare annotation was computed. [2020-07-20 01:27:35,125 INFO L268 CegarLoopResult]: For program point errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION(line 579) no Hoare annotation was computed. [2020-07-20 01:27:35,126 INFO L264 CegarLoopResult]: At program point L382(lines 375 415) the Hoare annotation is: (or (and (not (= 1 ~pended~0)) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ ~NP~0 2) ~SKIP1~0)) (not (= |old(~NP~0)| |old(~MPR1~0)|)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (= 1 |old(~pended~0)|) (not (= 0 |old(~compRegistered~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (<= |old(~IPC~0)| |old(~s~0)|))) [2020-07-20 01:27:35,126 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 286 420) no Hoare annotation was computed. [2020-07-20 01:27:35,126 INFO L268 CegarLoopResult]: For program point L407(lines 407 409) no Hoare annotation was computed. [2020-07-20 01:27:35,126 INFO L264 CegarLoopResult]: At program point L374(lines 367 416) the Hoare annotation is: (or (and (not (= 1 ~pended~0)) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ ~NP~0 2) ~SKIP1~0)) (not (= |old(~NP~0)| |old(~MPR1~0)|)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (= 1 |old(~pended~0)|) (not (= 0 |old(~compRegistered~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (<= |old(~IPC~0)| |old(~s~0)|))) [2020-07-20 01:27:35,126 INFO L268 CegarLoopResult]: For program point L383(lines 367 416) no Hoare annotation was computed. [2020-07-20 01:27:35,126 INFO L268 CegarLoopResult]: For program point L350(lines 350 365) no Hoare annotation was computed. [2020-07-20 01:27:35,126 INFO L268 CegarLoopResult]: For program point L384(lines 384 413) no Hoare annotation was computed. [2020-07-20 01:27:35,127 INFO L264 CegarLoopResult]: At program point L351(lines 350 365) the Hoare annotation is: (or (not (= |old(~NP~0)| |old(~MPR1~0)|)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (= 1 |old(~pended~0)|) (not (= 0 |old(~compRegistered~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (and (<= 1 ~NP~0) (<= ~NP~0 1) (= ~s~0 ~NP~0) (<= 0 main_~status~1) (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (<= (+ ~NP~0 4) ~MPR1~0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= |old(~IPC~0)| |old(~s~0)|))) [2020-07-20 01:27:35,127 INFO L268 CegarLoopResult]: For program point L376(lines 376 380) no Hoare annotation was computed. [2020-07-20 01:27:35,127 INFO L268 CegarLoopResult]: For program point L368(lines 368 372) no Hoare annotation was computed. [2020-07-20 01:27:35,127 INFO L268 CegarLoopResult]: For program point L335(lines 321 366) no Hoare annotation was computed. [2020-07-20 01:27:35,127 INFO L268 CegarLoopResult]: For program point mainFINAL(lines 286 420) no Hoare annotation was computed. [2020-07-20 01:27:35,127 INFO L268 CegarLoopResult]: For program point L385(lines 385 412) no Hoare annotation was computed. [2020-07-20 01:27:35,127 INFO L264 CegarLoopResult]: At program point L319(line 319) the Hoare annotation is: (or (and (= ~MPR1~0 ~s~0) (<= 0 main_~status~1) (not (= 1 ~pended~0)) (<= ~IPC~0 ~s~0) (= ~MPR1~0 ~NP~0) (= ~MPR3~0 ~s~0) (= 0 ~compRegistered~0) (= ~SKIP1~0 ~s~0)) (not (= |old(~NP~0)| |old(~MPR1~0)|)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (= 1 |old(~pended~0)|) (not (= 0 |old(~compRegistered~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (<= |old(~IPC~0)| |old(~s~0)|))) [2020-07-20 01:27:35,127 INFO L268 CegarLoopResult]: For program point L319-1(lines 295 419) no Hoare annotation was computed. [2020-07-20 01:27:35,128 INFO L264 CegarLoopResult]: At program point mainENTRY(lines 286 420) the Hoare annotation is: (or (not (= |old(~NP~0)| |old(~MPR1~0)|)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (= 1 |old(~pended~0)|) (not (= 0 |old(~compRegistered~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (and (= ~pended~0 |old(~pended~0)|) (= ~DC~0 |old(~DC~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compRegistered~0)| ~compRegistered~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~MPR1~0 ~s~0) (= ~compFptr~0 |old(~compFptr~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~MPR1~0 ~NP~0) (= ~MPR3~0 ~s~0) (= ~myStatus~0 |old(~myStatus~0)|) (= ~KernelMode~0 |old(~KernelMode~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~SKIP1~0 ~s~0) (= |old(~Executive~0)| ~Executive~0) (= ~MPR3~0 |old(~MPR3~0)|)) (not (<= |old(~IPC~0)| |old(~s~0)|))) [2020-07-20 01:27:35,128 INFO L268 CegarLoopResult]: For program point L402(lines 402 410) no Hoare annotation was computed. [2020-07-20 01:27:35,128 INFO L264 CegarLoopResult]: At program point L394(lines 385 412) the Hoare annotation is: (or (and (not (= 1 ~pended~0)) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ ~NP~0 2) ~SKIP1~0)) (not (= |old(~NP~0)| |old(~MPR1~0)|)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (= 1 |old(~pended~0)|) (not (= 0 |old(~compRegistered~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (<= |old(~IPC~0)| |old(~s~0)|))) [2020-07-20 01:27:35,128 INFO L268 CegarLoopResult]: For program point L386(lines 386 392) no Hoare annotation was computed. [2020-07-20 01:27:35,128 INFO L264 CegarLoopResult]: At program point L353(lines 352 365) the Hoare annotation is: (or (not (= |old(~NP~0)| |old(~MPR1~0)|)) (<= 0 main_~status~1) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (= 1 |old(~pended~0)|) (not (= 0 |old(~compRegistered~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (<= |old(~IPC~0)| |old(~s~0)|))) [2020-07-20 01:27:35,129 INFO L268 CegarLoopResult]: For program point L403(lines 403 405) no Hoare annotation was computed. [2020-07-20 01:27:35,129 INFO L268 CegarLoopResult]: For program point L387(lines 387 389) no Hoare annotation was computed. [2020-07-20 01:27:35,129 INFO L264 CegarLoopResult]: At program point L321(lines 295 419) the Hoare annotation is: (or (and (not (= 1 ~pended~0)) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ ~NP~0 2) ~SKIP1~0)) (not (= |old(~NP~0)| |old(~MPR1~0)|)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (= 1 |old(~pended~0)|) (not (= 0 |old(~compRegistered~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (<= |old(~IPC~0)| |old(~s~0)|))) [2020-07-20 01:27:35,129 INFO L268 CegarLoopResult]: For program point L338-1(lines 337 347) no Hoare annotation was computed. [2020-07-20 01:27:35,129 INFO L268 CegarLoopResult]: For program point L396(lines 396 400) no Hoare annotation was computed. [2020-07-20 01:27:35,129 INFO L268 CegarLoopResult]: For program point L330(lines 330 333) no Hoare annotation was computed. [2020-07-20 01:27:35,129 INFO L264 CegarLoopResult]: At program point L330-2(lines 330 333) the Hoare annotation is: (or (not (= |old(~NP~0)| |old(~MPR1~0)|)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (= 1 |old(~pended~0)|) (not (= 0 |old(~compRegistered~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (and (<= 1 ~NP~0) (<= ~NP~0 1) (= ~s~0 ~NP~0) (<= 0 main_~status~1) (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (<= (+ ~NP~0 4) ~MPR1~0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= |old(~IPC~0)| |old(~s~0)|))) [2020-07-20 01:27:35,130 INFO L264 CegarLoopResult]: At program point L398(line 398) the Hoare annotation is: (or (not (= |old(~NP~0)| |old(~MPR1~0)|)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (= 1 |old(~pended~0)|) (not (= 0 |old(~compRegistered~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (<= |old(~IPC~0)| |old(~s~0)|))) [2020-07-20 01:27:35,130 INFO L268 CegarLoopResult]: For program point L357(line 357) no Hoare annotation was computed. [2020-07-20 01:27:35,130 INFO L268 CegarLoopResult]: For program point L477(lines 477 494) no Hoare annotation was computed. [2020-07-20 01:27:35,130 INFO L264 CegarLoopResult]: At program point L444(line 444) the Hoare annotation is: (let ((.cse0 (not (<= (+ ~NP~0 2) ~SKIP1~0))) (.cse1 (= 1 ~pended~0)) (.cse2 (not (<= (+ ~SKIP2~0 3) ~IPC~0)))) (and (or (not (= ~SKIP1~0 |old(~s~0)|)) .cse0 .cse1 (not (= 0 ~compRegistered~0)) .cse2) (or (not (<= 1 ~NP~0)) (and (= ~s~0 ~NP~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|)) .cse0 (not (<= (+ ~NP~0 4) ~MPR1~0)) .cse1 (not (= ~NP~0 |old(~s~0)|)) .cse2 (not (<= ~NP~0 1)) (not (<= 1 ~compRegistered~0))))) [2020-07-20 01:27:35,130 INFO L268 CegarLoopResult]: For program point L444-1(line 444) no Hoare annotation was computed. [2020-07-20 01:27:35,131 INFO L264 CegarLoopResult]: At program point L469(lines 442 497) the Hoare annotation is: (let ((.cse1 (not (<= (+ ~NP~0 2) ~SKIP1~0))) (.cse2 (= 1 ~pended~0)) (.cse3 (not (<= (+ ~SKIP2~0 3) ~IPC~0)))) (and (let ((.cse0 (= ~MPR1~0 ~s~0))) (or (not (<= 1 ~NP~0)) (and .cse0 (<= 259 IofCallDriver_~returnVal2~0) (= ~setEventCalled~0 1) (<= IofCallDriver_~returnVal2~0 259)) (and (<= IofCallDriver_~returnVal2~0 0) .cse0) .cse1 (not (<= (+ ~NP~0 4) ~MPR1~0)) .cse2 (not (= ~NP~0 |old(~s~0)|)) .cse3 (not (<= ~NP~0 1)) (not (<= 1 ~compRegistered~0)))) (or (not (= ~SKIP1~0 |old(~s~0)|)) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~SKIP1~0 ~s~0)) .cse1 .cse2 (not (= 0 ~compRegistered~0)) .cse3))) [2020-07-20 01:27:35,131 INFO L264 CegarLoopResult]: At program point L457(lines 456 471) the Hoare annotation is: (let ((.cse0 (not (<= (+ ~NP~0 2) ~SKIP1~0))) (.cse1 (= 1 ~pended~0)) (.cse2 (not (<= (+ ~SKIP2~0 3) ~IPC~0)))) (and (or (not (= ~SKIP1~0 |old(~s~0)|)) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~SKIP1~0 ~s~0)) .cse0 .cse1 (not (= 0 ~compRegistered~0)) .cse2) (or (not (<= 1 ~NP~0)) .cse0 (not (<= (+ ~NP~0 4) ~MPR1~0)) .cse1 (not (= ~NP~0 |old(~s~0)|)) .cse2 (not (<= ~NP~0 1)) (and (= ~MPR1~0 ~s~0) (= ~setEventCalled~0 1)) (not (<= 1 ~compRegistered~0))))) [2020-07-20 01:27:35,131 INFO L268 CegarLoopResult]: For program point L486(lines 486 493) no Hoare annotation was computed. [2020-07-20 01:27:35,131 INFO L268 CegarLoopResult]: For program point L449(lines 449 472) no Hoare annotation was computed. [2020-07-20 01:27:35,131 INFO L268 CegarLoopResult]: For program point L478(lines 478 484) no Hoare annotation was computed. [2020-07-20 01:27:35,131 INFO L264 CegarLoopResult]: At program point L445(line 445) the Hoare annotation is: (let ((.cse0 (not (<= (+ ~NP~0 2) ~SKIP1~0))) (.cse1 (= 1 ~pended~0)) (.cse2 (not (<= (+ ~SKIP2~0 3) ~IPC~0)))) (and (or (not (= ~SKIP1~0 |old(~s~0)|)) .cse0 .cse1 (not (= 0 ~compRegistered~0)) .cse2) (or (not (<= 1 ~NP~0)) .cse0 (not (<= (+ ~NP~0 4) ~MPR1~0)) .cse1 (and (= ~s~0 |old(~s~0)|) (= ~setEventCalled~0 1)) (not (= ~NP~0 |old(~s~0)|)) .cse2 (not (<= ~NP~0 1)) (not (<= 1 ~compRegistered~0))))) [2020-07-20 01:27:35,132 INFO L264 CegarLoopResult]: At program point IofCallDriverENTRY(lines 435 498) the Hoare annotation is: (let ((.cse0 (= ~setEventCalled~0 |old(~setEventCalled~0)|)) (.cse1 (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|)) (.cse2 (not (<= (+ ~NP~0 2) ~SKIP1~0))) (.cse3 (= 1 ~pended~0)) (.cse4 (not (<= (+ ~SKIP2~0 3) ~IPC~0)))) (and (or (not (= ~SKIP1~0 |old(~s~0)|)) (and .cse0 .cse1 (= ~SKIP1~0 ~s~0)) .cse2 .cse3 (not (= 0 ~compRegistered~0)) .cse4) (or (not (<= 1 ~NP~0)) (and (= ~s~0 ~NP~0) .cse0 .cse1) .cse2 (not (<= (+ ~NP~0 4) ~MPR1~0)) .cse3 (not (= ~NP~0 |old(~s~0)|)) .cse4 (not (<= ~NP~0 1)) (not (<= 1 ~compRegistered~0))))) [2020-07-20 01:27:35,132 INFO L264 CegarLoopResult]: At program point L491(line 491) the Hoare annotation is: (let ((.cse0 (not (<= (+ ~NP~0 2) ~SKIP1~0))) (.cse1 (= 1 ~pended~0)) (.cse2 (not (<= (+ ~SKIP2~0 3) ~IPC~0)))) (and (or (not (= ~SKIP1~0 |old(~s~0)|)) .cse0 .cse1 (not (= 0 ~compRegistered~0)) .cse2) (or (not (<= 1 ~NP~0)) .cse0 (not (<= (+ ~NP~0 4) ~MPR1~0)) .cse1 (not (= ~NP~0 |old(~s~0)|)) .cse2 (not (<= ~NP~0 1)) (not (<= 1 ~compRegistered~0))))) [2020-07-20 01:27:35,132 INFO L268 CegarLoopResult]: For program point L491-1(lines 473 495) no Hoare annotation was computed. [2020-07-20 01:27:35,132 INFO L268 CegarLoopResult]: For program point L454(lines 454 471) no Hoare annotation was computed. [2020-07-20 01:27:35,132 INFO L264 CegarLoopResult]: At program point L450(lines 449 472) the Hoare annotation is: (let ((.cse0 (not (<= (+ ~NP~0 2) ~SKIP1~0))) (.cse1 (= 1 ~pended~0)) (.cse2 (not (<= (+ ~SKIP2~0 3) ~IPC~0)))) (and (or (not (= ~SKIP1~0 |old(~s~0)|)) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~SKIP1~0 ~s~0)) .cse0 .cse1 (not (= 0 ~compRegistered~0)) .cse2) (or (not (<= 1 ~NP~0)) (= ~MPR1~0 ~s~0) .cse0 (not (<= (+ ~NP~0 4) ~MPR1~0)) .cse1 (not (= ~NP~0 |old(~s~0)|)) .cse2 (not (<= ~NP~0 1)) (not (<= 1 ~compRegistered~0))))) [2020-07-20 01:27:35,132 INFO L268 CegarLoopResult]: For program point IofCallDriverFINAL(lines 435 498) no Hoare annotation was computed. [2020-07-20 01:27:35,133 INFO L268 CegarLoopResult]: For program point IofCallDriverEXIT(lines 435 498) no Hoare annotation was computed. [2020-07-20 01:27:35,133 INFO L264 CegarLoopResult]: At program point L455(lines 454 471) the Hoare annotation is: (let ((.cse0 (not (<= (+ ~NP~0 2) ~SKIP1~0))) (.cse1 (= 1 ~pended~0)) (.cse2 (not (<= (+ ~SKIP2~0 3) ~IPC~0)))) (and (or (not (= ~SKIP1~0 |old(~s~0)|)) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~SKIP1~0 ~s~0)) .cse0 .cse1 (not (= 0 ~compRegistered~0)) .cse2) (or (not (<= 1 ~NP~0)) (= ~MPR1~0 ~s~0) .cse0 (not (<= (+ ~NP~0 4) ~MPR1~0)) .cse1 (not (= ~NP~0 |old(~s~0)|)) .cse2 (not (<= ~NP~0 1)) (not (<= 1 ~compRegistered~0))))) [2020-07-20 01:27:35,133 INFO L268 CegarLoopResult]: For program point L443(lines 443 446) no Hoare annotation was computed. [2020-07-20 01:27:35,133 INFO L268 CegarLoopResult]: For program point L443-1(lines 443 446) no Hoare annotation was computed. [2020-07-20 01:27:35,133 INFO L264 CegarLoopResult]: At program point L429(line 429) the Hoare annotation is: (or (not (<= 1 ~NP~0)) (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (= 1 ~pended~0) (not (= ~NP~0 |old(~s~0)|)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (<= ~NP~0 1)) (not (= ~setEventCalled~0 1)) (not (<= 1 ~compRegistered~0))) [2020-07-20 01:27:35,133 INFO L268 CegarLoopResult]: For program point L429-1(lines 421 434) no Hoare annotation was computed. [2020-07-20 01:27:35,133 INFO L264 CegarLoopResult]: At program point stubMoreProcessingRequiredENTRY(lines 421 434) the Hoare annotation is: (or (not (<= 1 ~NP~0)) (= ~s~0 ~NP~0) (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (= 1 ~pended~0) (not (= ~NP~0 |old(~s~0)|)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (<= ~NP~0 1)) (not (= ~setEventCalled~0 1)) (not (<= 1 ~compRegistered~0))) [2020-07-20 01:27:35,134 INFO L268 CegarLoopResult]: For program point stubMoreProcessingRequiredEXIT(lines 421 434) no Hoare annotation was computed. [2020-07-20 01:27:35,134 INFO L268 CegarLoopResult]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2020-07-20 01:27:35,134 INFO L264 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~pended~0 |old(~pended~0)|) (= ~SKIP2~0 |old(~SKIP2~0)|) (= ~NP~0 |old(~NP~0)|) (= ~customIrp~0 |old(~customIrp~0)|) (= ~UNLOADED~0 |old(~UNLOADED~0)|) (= ~Executive~0 |old(~Executive~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~s~0 |old(~s~0)|) (= ~DC~0 |old(~DC~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~IPC~0 |old(~IPC~0)|) (= ~compRegistered~0 |old(~compRegistered~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~compFptr~0 |old(~compFptr~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~KernelMode~0 |old(~KernelMode~0)|) (= ~SKIP1~0 |old(~SKIP1~0)|) (= ~MPR3~0 |old(~MPR3~0)|)) [2020-07-20 01:27:35,134 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-07-20 01:27:35,134 INFO L264 CegarLoopResult]: At program point L541(line 541) the Hoare annotation is: (let ((.cse0 (not (= 1 |old(~setEventCalled~0)|))) (.cse1 (not (<= 1 ~NP~0))) (.cse2 (not (<= (+ ~NP~0 2) ~SKIP1~0))) (.cse3 (not (<= (+ ~NP~0 4) ~MPR1~0))) (.cse4 (= 1 ~pended~0)) (.cse5 (not (<= (+ ~SKIP2~0 3) ~IPC~0))) (.cse6 (not (<= ~NP~0 1))) (.cse7 (not (<= 1 ~compRegistered~0)))) (and (or .cse0 (not (= ~MPR3~0 |old(~s~0)|)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (or .cse0 .cse1 .cse2 .cse3 .cse4 (not (= ~NP~0 |old(~s~0)|)) .cse5 .cse6 .cse7))) [2020-07-20 01:27:35,134 INFO L268 CegarLoopResult]: For program point L539(lines 539 543) no Hoare annotation was computed. [2020-07-20 01:27:35,134 INFO L268 CegarLoopResult]: For program point L539-1(lines 526 545) no Hoare annotation was computed. [2020-07-20 01:27:35,135 INFO L268 CegarLoopResult]: For program point KeWaitForSingleObjectEXIT(lines 521 562) no Hoare annotation was computed. [2020-07-20 01:27:35,135 INFO L268 CegarLoopResult]: For program point L527(lines 527 532) no Hoare annotation was computed. [2020-07-20 01:27:35,135 INFO L268 CegarLoopResult]: For program point L548(lines 548 560) no Hoare annotation was computed. [2020-07-20 01:27:35,135 INFO L268 CegarLoopResult]: For program point KeWaitForSingleObjectFINAL(lines 521 562) no Hoare annotation was computed. [2020-07-20 01:27:35,135 INFO L264 CegarLoopResult]: At program point L534(lines 526 545) the Hoare annotation is: (let ((.cse0 (not (= 1 |old(~setEventCalled~0)|))) (.cse1 (not (<= 1 ~NP~0))) (.cse2 (not (<= (+ ~NP~0 2) ~SKIP1~0))) (.cse3 (not (<= (+ ~NP~0 4) ~MPR1~0))) (.cse4 (= 1 ~pended~0)) (.cse5 (not (<= (+ ~SKIP2~0 3) ~IPC~0))) (.cse6 (not (<= ~NP~0 1))) (.cse7 (not (<= 1 ~compRegistered~0)))) (and (or .cse0 (not (= ~MPR3~0 |old(~s~0)|)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (or .cse0 .cse1 (and (= ~s~0 ~NP~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~customIrp~0)| ~customIrp~0)) .cse2 .cse3 .cse4 (not (= ~NP~0 |old(~s~0)|)) .cse5 .cse6 .cse7))) [2020-07-20 01:27:35,135 INFO L268 CegarLoopResult]: For program point L526(lines 526 545) no Hoare annotation was computed. [2020-07-20 01:27:35,136 INFO L264 CegarLoopResult]: At program point L551(lines 550 560) the Hoare annotation is: (let ((.cse0 (not (= 1 |old(~setEventCalled~0)|))) (.cse1 (not (<= 1 ~NP~0))) (.cse2 (not (<= (+ ~NP~0 2) ~SKIP1~0))) (.cse3 (not (<= (+ ~NP~0 4) ~MPR1~0))) (.cse4 (= 1 ~pended~0)) (.cse5 (not (<= (+ ~SKIP2~0 3) ~IPC~0))) (.cse6 (not (<= ~NP~0 1))) (.cse7 (not (<= 1 ~compRegistered~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (not (= ~NP~0 |old(~s~0)|)) (= ~s~0 |old(~s~0)|) .cse5 .cse6 .cse7) (or .cse0 (not (= ~MPR3~0 |old(~s~0)|)) .cse1 (= ~s~0 ~NP~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7))) [2020-07-20 01:27:35,136 INFO L264 CegarLoopResult]: At program point KeWaitForSingleObjectENTRY(lines 521 562) the Hoare annotation is: (let ((.cse0 (not (= 1 |old(~setEventCalled~0)|))) (.cse1 (not (<= 1 ~NP~0))) (.cse4 (= ~setEventCalled~0 1)) (.cse5 (= |old(~customIrp~0)| ~customIrp~0)) (.cse2 (not (<= (+ ~NP~0 2) ~SKIP1~0))) (.cse3 (not (<= (+ ~NP~0 4) ~MPR1~0))) (.cse6 (= 1 ~pended~0)) (.cse7 (not (<= (+ ~SKIP2~0 3) ~IPC~0))) (.cse8 (not (<= ~NP~0 1))) (.cse9 (not (<= 1 ~compRegistered~0)))) (and (or .cse0 .cse1 .cse2 .cse3 (and (= ~s~0 ~NP~0) .cse4 .cse5) .cse6 (not (= ~NP~0 |old(~s~0)|)) .cse7 .cse8 .cse9) (or .cse0 (not (= ~MPR3~0 |old(~s~0)|)) .cse1 (and (= ~MPR3~0 ~s~0) .cse4 .cse5) .cse2 .cse3 .cse6 .cse7 .cse8 .cse9))) [2020-07-20 01:27:35,136 INFO L264 CegarLoopResult]: At program point L549(lines 548 560) the Hoare annotation is: (let ((.cse0 (not (= 1 |old(~setEventCalled~0)|))) (.cse1 (not (<= 1 ~NP~0))) (.cse2 (not (<= (+ ~NP~0 2) ~SKIP1~0))) (.cse3 (not (<= (+ ~NP~0 4) ~MPR1~0))) (.cse4 (= 1 ~pended~0)) (.cse5 (not (<= (+ ~SKIP2~0 3) ~IPC~0))) (.cse6 (not (<= ~NP~0 1))) (.cse7 (not (<= 1 ~compRegistered~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (not (= ~NP~0 |old(~s~0)|)) (= ~s~0 |old(~s~0)|) .cse5 .cse6 .cse7) (or .cse0 (not (= ~MPR3~0 |old(~s~0)|)) .cse1 (= ~s~0 ~NP~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7))) [2020-07-20 01:27:35,136 INFO L264 CegarLoopResult]: At program point L507(line 507) the Hoare annotation is: (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (= 1 ~pended~0) (not (= ~NP~0 |old(~s~0)|)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (<= 1 ~compRegistered~0))) [2020-07-20 01:27:35,136 INFO L268 CegarLoopResult]: For program point L507-1(lines 499 512) no Hoare annotation was computed. [2020-07-20 01:27:35,136 INFO L264 CegarLoopResult]: At program point IofCompleteRequestENTRY(lines 499 512) the Hoare annotation is: (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (= 1 ~pended~0) (not (= ~NP~0 |old(~s~0)|)) (= ~s~0 |old(~s~0)|) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (<= 1 ~compRegistered~0))) [2020-07-20 01:27:35,137 INFO L268 CegarLoopResult]: For program point L503(lines 503 509) no Hoare annotation was computed. [2020-07-20 01:27:35,137 INFO L268 CegarLoopResult]: For program point IofCompleteRequestEXIT(lines 499 512) no Hoare annotation was computed. [2020-07-20 01:27:35,137 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-20 01:27:35,137 INFO L264 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: (and (= ~MPR1~0 ~s~0) (not (= 1 ~pended~0)) (<= ~IPC~0 ~s~0) (= ~MPR1~0 ~NP~0) (= ~MPR3~0 ~s~0) (= 0 ~compRegistered~0) (= ~SKIP1~0 ~s~0)) [2020-07-20 01:27:35,137 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-20 01:27:35,137 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-20 01:27:35,137 INFO L264 CegarLoopResult]: At program point L192(lines 192 194) the Hoare annotation is: (let ((.cse12 (<= ~NP~0 1)) (.cse9 (<= 259 KbFilter_PnP_~status~0)) (.cse3 (= 1 ~pended~0)) (.cse10 (= ~setEventCalled~0 1)) (.cse13 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse14 (= ~NP~0 |old(~s~0)|)) (.cse11 (<= 1 ~compRegistered~0)) (.cse16 (<= (+ ~NP~0 4) ~MPR1~0)) (.cse15 (<= 1 ~NP~0))) (let ((.cse0 (not .cse15)) (.cse1 (not (<= (+ ~NP~0 2) ~SKIP1~0))) (.cse2 (not .cse16)) (.cse4 (and .cse15 .cse12 .cse9 (not .cse3) (= ~s~0 |old(~s~0)|) .cse10 .cse16 .cse13 .cse14 .cse11 (<= (+ ~s~0 2) ~SKIP1~0))) (.cse5 (not .cse14)) (.cse6 (not .cse13)) (.cse8 (not .cse12)) (.cse7 (not (= 0 |old(~compRegistered~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (<= (+ |old(~myStatus~0)| 1073741637) 0)) .cse8 (<= (+ ~myStatus~0 1073741637) 0)) (or .cse0 .cse1 .cse2 (and (<= KbFilter_PnP_~__cil_tmp23~0 259) .cse9 (= ~MPR3~0 ~s~0) (<= 259 KbFilter_PnP_~__cil_tmp23~0) .cse10 .cse11) .cse3 .cse4 .cse5 .cse6 .cse8 .cse7)))) [2020-07-20 01:27:35,138 INFO L268 CegarLoopResult]: For program point L192-1(lines 192 194) no Hoare annotation was computed. [2020-07-20 01:27:35,138 INFO L268 CegarLoopResult]: For program point L151(lines 151 265) no Hoare annotation was computed. [2020-07-20 01:27:35,138 INFO L268 CegarLoopResult]: For program point L118(lines 118 276) no Hoare annotation was computed. [2020-07-20 01:27:35,138 INFO L264 CegarLoopResult]: At program point L209(line 209) the Hoare annotation is: (or (not (<= 1 ~NP~0)) (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (= 1 ~pended~0) (not (= ~NP~0 |old(~s~0)|)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (<= ~NP~0 1)) (not (= 0 |old(~compRegistered~0)|)) (and (= ~s~0 ~NP~0) (<= 1 ~compRegistered~0))) [2020-07-20 01:27:35,138 INFO L264 CegarLoopResult]: At program point L176(line 176) the Hoare annotation is: (or (not (<= 1 ~NP~0)) (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (= 1 ~pended~0) (not (= ~NP~0 |old(~s~0)|)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (<= ~NP~0 1)) (not (= 0 |old(~compRegistered~0)|))) [2020-07-20 01:27:35,138 INFO L264 CegarLoopResult]: At program point L234(line 234) the Hoare annotation is: (or (not (<= 1 ~NP~0)) (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (= 1 ~pended~0) (not (= ~NP~0 |old(~s~0)|)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (<= ~NP~0 1)) (not (= 0 |old(~compRegistered~0)|))) [2020-07-20 01:27:35,138 INFO L268 CegarLoopResult]: For program point L234-1(lines 230 236) no Hoare annotation was computed. [2020-07-20 01:27:35,139 INFO L268 CegarLoopResult]: For program point L160(lines 160 262) no Hoare annotation was computed. [2020-07-20 01:27:35,139 INFO L268 CegarLoopResult]: For program point L127(lines 127 273) no Hoare annotation was computed. [2020-07-20 01:27:35,139 INFO L264 CegarLoopResult]: At program point L218(line 218) the Hoare annotation is: (or (not (<= 1 ~NP~0)) (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (= 1 ~pended~0) (not (= ~NP~0 |old(~s~0)|)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (<= ~NP~0 1)) (not (= 0 |old(~compRegistered~0)|))) [2020-07-20 01:27:35,139 INFO L264 CegarLoopResult]: At program point L185(lines 185 186) the Hoare annotation is: (let ((.cse0 (not (<= 1 ~NP~0))) (.cse1 (not (<= (+ ~NP~0 2) ~SKIP1~0))) (.cse2 (not (<= (+ ~NP~0 4) ~MPR1~0))) (.cse3 (= 1 ~pended~0)) (.cse4 (not (= ~NP~0 |old(~s~0)|))) (.cse5 (not (<= (+ ~SKIP2~0 3) ~IPC~0))) (.cse6 (not (<= ~NP~0 1))) (.cse7 (not (= 0 |old(~compRegistered~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (<= (+ |old(~myStatus~0)| 1073741637) 0)) (<= (+ ~myStatus~0 1073741637) 0)) (or (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 |old(~s~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (<= 1 ~compRegistered~0)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7))) [2020-07-20 01:27:35,139 INFO L268 CegarLoopResult]: For program point L218-1(lines 214 220) no Hoare annotation was computed. [2020-07-20 01:27:35,139 INFO L268 CegarLoopResult]: For program point L185-1(lines 185 186) no Hoare annotation was computed. [2020-07-20 01:27:35,139 INFO L268 CegarLoopResult]: For program point L169(lines 169 181) no Hoare annotation was computed. [2020-07-20 01:27:35,140 INFO L268 CegarLoopResult]: For program point L136(lines 136 270) no Hoare annotation was computed. [2020-07-20 01:27:35,140 INFO L268 CegarLoopResult]: For program point L103(lines 103 281) no Hoare annotation was computed. [2020-07-20 01:27:35,140 INFO L271 CegarLoopResult]: At program point L260(lines 164 261) the Hoare annotation is: true [2020-07-20 01:27:35,140 INFO L268 CegarLoopResult]: For program point KbFilter_PnPEXIT(lines 73 285) no Hoare annotation was computed. [2020-07-20 01:27:35,140 INFO L268 CegarLoopResult]: For program point L145(lines 145 267) no Hoare annotation was computed. [2020-07-20 01:27:35,140 INFO L268 CegarLoopResult]: For program point L112(lines 112 278) no Hoare annotation was computed. [2020-07-20 01:27:35,140 INFO L264 CegarLoopResult]: At program point L104(lines 103 281) the Hoare annotation is: (or (not (<= 1 ~NP~0)) (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (= 1 ~pended~0) (not (= ~NP~0 |old(~s~0)|)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~s~0 ~NP~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|)) (not (<= ~NP~0 1)) (not (= 0 |old(~compRegistered~0)|))) [2020-07-20 01:27:35,141 INFO L268 CegarLoopResult]: For program point L154(lines 154 264) no Hoare annotation was computed. [2020-07-20 01:27:35,141 INFO L268 CegarLoopResult]: For program point L121(lines 121 275) no Hoare annotation was computed. [2020-07-20 01:27:35,141 INFO L264 CegarLoopResult]: At program point KbFilter_PnPENTRY(lines 73 285) the Hoare annotation is: (or (not (<= 1 ~NP~0)) (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (= 1 ~pended~0) (not (= ~NP~0 |old(~s~0)|)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~s~0 ~NP~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|)) (not (<= ~NP~0 1)) (not (= 0 |old(~compRegistered~0)|))) [2020-07-20 01:27:35,141 INFO L264 CegarLoopResult]: At program point L171(line 171) the Hoare annotation is: (or (not (<= 1 ~NP~0)) (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (= 1 ~pended~0) (not (= ~NP~0 |old(~s~0)|)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (<= ~NP~0 1)) (not (= 0 |old(~compRegistered~0)|))) [2020-07-20 01:27:35,141 INFO L268 CegarLoopResult]: For program point KbFilter_PnPFINAL(lines 73 285) no Hoare annotation was computed. [2020-07-20 01:27:35,141 INFO L264 CegarLoopResult]: At program point L163(lines 109 279) the Hoare annotation is: (or (not (<= 1 ~NP~0)) (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (= 1 ~pended~0) (not (= ~NP~0 |old(~s~0)|)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~s~0 ~NP~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|)) (not (<= ~NP~0 1)) (not (= 0 |old(~compRegistered~0)|))) [2020-07-20 01:27:35,141 INFO L268 CegarLoopResult]: For program point L130(lines 130 272) no Hoare annotation was computed. [2020-07-20 01:27:35,142 INFO L268 CegarLoopResult]: For program point L139(lines 139 269) no Hoare annotation was computed. [2020-07-20 01:27:35,142 INFO L268 CegarLoopResult]: For program point L106(lines 106 280) no Hoare annotation was computed. [2020-07-20 01:27:35,142 INFO L268 CegarLoopResult]: For program point L230(lines 230 236) no Hoare annotation was computed. [2020-07-20 01:27:35,142 INFO L264 CegarLoopResult]: At program point L255(lines 255 256) the Hoare annotation is: (or (not (<= 1 ~NP~0)) (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (= 1 ~pended~0) (not (= ~NP~0 |old(~s~0)|)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (<= ~NP~0 1)) (not (= 0 |old(~compRegistered~0)|)) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= 0 ~compRegistered~0) (= ~SKIP1~0 ~s~0))) [2020-07-20 01:27:35,142 INFO L268 CegarLoopResult]: For program point L255-1(lines 255 256) no Hoare annotation was computed. [2020-07-20 01:27:35,142 INFO L268 CegarLoopResult]: For program point L214(lines 214 220) no Hoare annotation was computed. [2020-07-20 01:27:35,142 INFO L268 CegarLoopResult]: For program point L148(lines 148 266) no Hoare annotation was computed. [2020-07-20 01:27:35,142 INFO L268 CegarLoopResult]: For program point L115(lines 115 277) no Hoare annotation was computed. [2020-07-20 01:27:35,143 INFO L264 CegarLoopResult]: At program point L107(lines 106 280) the Hoare annotation is: (or (not (<= 1 ~NP~0)) (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (= 1 ~pended~0) (not (= ~NP~0 |old(~s~0)|)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~s~0 ~NP~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|)) (not (<= ~NP~0 1)) (not (= 0 |old(~compRegistered~0)|))) [2020-07-20 01:27:35,143 INFO L268 CegarLoopResult]: For program point L198(lines 198 204) no Hoare annotation was computed. [2020-07-20 01:27:35,143 INFO L268 CegarLoopResult]: For program point L190(lines 190 196) no Hoare annotation was computed. [2020-07-20 01:27:35,143 INFO L268 CegarLoopResult]: For program point L157(lines 157 263) no Hoare annotation was computed. [2020-07-20 01:27:35,143 INFO L268 CegarLoopResult]: For program point L124(lines 124 274) no Hoare annotation was computed. [2020-07-20 01:27:35,143 INFO L268 CegarLoopResult]: For program point L190-2(lines 164 259) no Hoare annotation was computed. [2020-07-20 01:27:35,143 INFO L264 CegarLoopResult]: At program point L240(line 240) the Hoare annotation is: (or (not (<= 1 ~NP~0)) (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (= 1 ~pended~0) (not (= ~NP~0 |old(~s~0)|)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (<= ~NP~0 1)) (not (= 0 |old(~compRegistered~0)|)) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= 0 ~compRegistered~0) (= ~SKIP1~0 ~s~0))) [2020-07-20 01:27:35,144 INFO L268 CegarLoopResult]: For program point L240-1(line 240) no Hoare annotation was computed. [2020-07-20 01:27:35,144 INFO L268 CegarLoopResult]: For program point L174(lines 174 180) no Hoare annotation was computed. [2020-07-20 01:27:35,144 INFO L268 CegarLoopResult]: For program point L174-1(lines 169 181) no Hoare annotation was computed. [2020-07-20 01:27:35,144 INFO L268 CegarLoopResult]: For program point L199(lines 199 203) no Hoare annotation was computed. [2020-07-20 01:27:35,144 INFO L268 CegarLoopResult]: For program point L133(lines 133 271) no Hoare annotation was computed. [2020-07-20 01:27:35,144 INFO L268 CegarLoopResult]: For program point L100(lines 100 282) no Hoare annotation was computed. [2020-07-20 01:27:35,144 INFO L264 CegarLoopResult]: At program point L224(lines 224 225) the Hoare annotation is: (or (not (<= 1 ~NP~0)) (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (= 1 ~pended~0) (not (= ~NP~0 |old(~s~0)|)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (<= ~NP~0 1)) (not (= 0 |old(~compRegistered~0)|)) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= 0 ~compRegistered~0) (= ~SKIP1~0 ~s~0))) [2020-07-20 01:27:35,144 INFO L268 CegarLoopResult]: For program point L224-1(lines 224 225) no Hoare annotation was computed. [2020-07-20 01:27:35,145 INFO L264 CegarLoopResult]: At program point L249(line 249) the Hoare annotation is: (or (not (<= 1 ~NP~0)) (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (= 1 ~pended~0) (not (= ~NP~0 |old(~s~0)|)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (<= ~NP~0 1)) (not (= 0 |old(~compRegistered~0)|))) [2020-07-20 01:27:35,145 INFO L268 CegarLoopResult]: For program point L249-1(lines 245 251) no Hoare annotation was computed. [2020-07-20 01:27:35,145 INFO L268 CegarLoopResult]: For program point L142(lines 142 268) no Hoare annotation was computed. [2020-07-20 01:27:35,145 INFO L268 CegarLoopResult]: For program point L109(lines 109 279) no Hoare annotation was computed. [2020-07-20 01:27:35,145 INFO L264 CegarLoopResult]: At program point L101(lines 100 282) the Hoare annotation is: (or (not (<= 1 ~NP~0)) (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (= 1 ~pended~0) (not (= ~NP~0 |old(~s~0)|)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~s~0 ~NP~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|)) (not (<= ~NP~0 1)) (not (= 0 |old(~compRegistered~0)|))) [2020-07-20 01:27:35,215 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.07 01:27:35 BoogieIcfgContainer [2020-07-20 01:27:35,216 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-20 01:27:35,217 INFO L168 Benchmark]: Toolchain (without parser) took 22641.04 ms. Allocated memory was 135.8 MB in the beginning and 497.0 MB in the end (delta: 361.2 MB). Free memory was 100.2 MB in the beginning and 406.1 MB in the end (delta: -305.9 MB). Peak memory consumption was 382.5 MB. Max. memory is 7.1 GB. [2020-07-20 01:27:35,218 INFO L168 Benchmark]: CDTParser took 0.31 ms. Allocated memory is still 135.8 MB. Free memory was 118.9 MB in the beginning and 118.7 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2020-07-20 01:27:35,218 INFO L168 Benchmark]: CACSL2BoogieTranslator took 541.33 ms. Allocated memory was 135.8 MB in the beginning and 199.2 MB in the end (delta: 63.4 MB). Free memory was 99.8 MB in the beginning and 174.9 MB in the end (delta: -75.1 MB). Peak memory consumption was 25.9 MB. Max. memory is 7.1 GB. [2020-07-20 01:27:35,219 INFO L168 Benchmark]: Boogie Preprocessor took 50.90 ms. Allocated memory is still 199.2 MB. Free memory was 174.9 MB in the beginning and 172.0 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2020-07-20 01:27:35,219 INFO L168 Benchmark]: RCFGBuilder took 743.09 ms. Allocated memory is still 199.2 MB. Free memory was 172.0 MB in the beginning and 127.0 MB in the end (delta: 45.0 MB). Peak memory consumption was 45.0 MB. Max. memory is 7.1 GB. [2020-07-20 01:27:35,220 INFO L168 Benchmark]: TraceAbstraction took 21298.68 ms. Allocated memory was 199.2 MB in the beginning and 497.0 MB in the end (delta: 297.8 MB). Free memory was 126.3 MB in the beginning and 406.1 MB in the end (delta: -279.8 MB). Peak memory consumption was 345.1 MB. Max. memory is 7.1 GB. [2020-07-20 01:27:35,228 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.31 ms. Allocated memory is still 135.8 MB. Free memory was 118.9 MB in the beginning and 118.7 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 541.33 ms. Allocated memory was 135.8 MB in the beginning and 199.2 MB in the end (delta: 63.4 MB). Free memory was 99.8 MB in the beginning and 174.9 MB in the end (delta: -75.1 MB). Peak memory consumption was 25.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 50.90 ms. Allocated memory is still 199.2 MB. Free memory was 174.9 MB in the beginning and 172.0 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 743.09 ms. Allocated memory is still 199.2 MB. Free memory was 172.0 MB in the beginning and 127.0 MB in the end (delta: 45.0 MB). Peak memory consumption was 45.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 21298.68 ms. Allocated memory was 199.2 MB in the beginning and 497.0 MB in the end (delta: 297.8 MB). Free memory was 126.3 MB in the beginning and 406.1 MB in the end (delta: -279.8 MB). Peak memory consumption was 345.1 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: ((((((((!(1 == pended) && SKIP2 + 3 <= IPC) && NP + 2 <= SKIP1) || !(\old(NP) == \old(MPR1))) || !(\old(SKIP1) == \old(s))) || 1 == \old(pended)) || !(0 == \old(compRegistered))) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(MPR3))) || !(\old(IPC) <= \old(s)) - InvariantResult [Line: 295]: Loop Invariant Derived loop invariant: ((((((((!(1 == pended) && SKIP2 + 3 <= IPC) && NP + 2 <= SKIP1) || !(\old(NP) == \old(MPR1))) || !(\old(SKIP1) == \old(s))) || 1 == \old(pended)) || !(0 == \old(compRegistered))) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(MPR3))) || !(\old(IPC) <= \old(s)) - InvariantResult [Line: 352]: Loop Invariant Derived loop invariant: ((((((!(\old(NP) == \old(MPR1)) || 0 <= status) || !(\old(SKIP1) == \old(s))) || 1 == \old(pended)) || !(0 == \old(compRegistered))) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(MPR3))) || !(\old(IPC) <= \old(s)) - InvariantResult [Line: 106]: Loop Invariant Derived loop invariant: (((((((!(1 <= NP) || !(NP + 2 <= SKIP1)) || !(NP + 4 <= MPR1)) || 1 == pended) || !(NP == \old(s))) || !(SKIP2 + 3 <= IPC)) || (((((\old(compRegistered) == compRegistered && s == NP) && setEventCalled == \old(setEventCalled)) && myStatus == \old(myStatus)) && \old(customIrp) == customIrp) && lowerDriverReturn == \old(lowerDriverReturn))) || !(NP <= 1)) || !(0 == \old(compRegistered)) - InvariantResult [Line: 109]: Loop Invariant Derived loop invariant: (((((((!(1 <= NP) || !(NP + 2 <= SKIP1)) || !(NP + 4 <= MPR1)) || 1 == pended) || !(NP == \old(s))) || !(SKIP2 + 3 <= IPC)) || (((((\old(compRegistered) == compRegistered && s == NP) && setEventCalled == \old(setEventCalled)) && myStatus == \old(myStatus)) && \old(customIrp) == customIrp) && lowerDriverReturn == \old(lowerDriverReturn))) || !(NP <= 1)) || !(0 == \old(compRegistered)) - InvariantResult [Line: 449]: Loop Invariant Derived loop invariant: (((((!(SKIP1 == \old(s)) || ((setEventCalled == \old(setEventCalled) && lowerDriverReturn == \old(lowerDriverReturn)) && SKIP1 == s)) || !(NP + 2 <= SKIP1)) || 1 == pended) || !(0 == compRegistered)) || !(SKIP2 + 3 <= IPC)) && ((((((((!(1 <= NP) || MPR1 == s) || !(NP + 2 <= SKIP1)) || !(NP + 4 <= MPR1)) || 1 == pended) || !(NP == \old(s))) || !(SKIP2 + 3 <= IPC)) || !(NP <= 1)) || !(1 <= compRegistered)) - InvariantResult [Line: 526]: Loop Invariant Derived loop invariant: ((((((((!(1 == \old(setEventCalled)) || !(MPR3 == \old(s))) || !(1 <= NP)) || !(NP + 2 <= SKIP1)) || !(NP + 4 <= MPR1)) || 1 == pended) || !(SKIP2 + 3 <= IPC)) || !(NP <= 1)) || !(1 <= compRegistered)) && (((((((((!(1 == \old(setEventCalled)) || !(1 <= NP)) || ((s == NP && setEventCalled == \old(setEventCalled)) && \old(customIrp) == customIrp)) || !(NP + 2 <= SKIP1)) || !(NP + 4 <= MPR1)) || 1 == pended) || !(NP == \old(s))) || !(SKIP2 + 3 <= IPC)) || !(NP <= 1)) || !(1 <= compRegistered)) - InvariantResult [Line: 164]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 100]: Loop Invariant Derived loop invariant: (((((((!(1 <= NP) || !(NP + 2 <= SKIP1)) || !(NP + 4 <= MPR1)) || 1 == pended) || !(NP == \old(s))) || !(SKIP2 + 3 <= IPC)) || (((((\old(compRegistered) == compRegistered && s == NP) && setEventCalled == \old(setEventCalled)) && myStatus == \old(myStatus)) && \old(customIrp) == customIrp) && lowerDriverReturn == \old(lowerDriverReturn))) || !(NP <= 1)) || !(0 == \old(compRegistered)) - InvariantResult [Line: 456]: Loop Invariant Derived loop invariant: (((((!(SKIP1 == \old(s)) || ((setEventCalled == \old(setEventCalled) && lowerDriverReturn == \old(lowerDriverReturn)) && SKIP1 == s)) || !(NP + 2 <= SKIP1)) || 1 == pended) || !(0 == compRegistered)) || !(SKIP2 + 3 <= IPC)) && ((((((((!(1 <= NP) || !(NP + 2 <= SKIP1)) || !(NP + 4 <= MPR1)) || 1 == pended) || !(NP == \old(s))) || !(SKIP2 + 3 <= IPC)) || !(NP <= 1)) || (MPR1 == s && setEventCalled == 1)) || !(1 <= compRegistered)) - InvariantResult [Line: 548]: Loop Invariant Derived loop invariant: (((((((((!(1 == \old(setEventCalled)) || !(1 <= NP)) || !(NP + 2 <= SKIP1)) || !(NP + 4 <= MPR1)) || 1 == pended) || !(NP == \old(s))) || s == \old(s)) || !(SKIP2 + 3 <= IPC)) || !(NP <= 1)) || !(1 <= compRegistered)) && (((((((((!(1 == \old(setEventCalled)) || !(MPR3 == \old(s))) || !(1 <= NP)) || s == NP) || !(NP + 2 <= SKIP1)) || !(NP + 4 <= MPR1)) || 1 == pended) || !(SKIP2 + 3 <= IPC)) || !(NP <= 1)) || !(1 <= compRegistered)) - InvariantResult [Line: 442]: Loop Invariant Derived loop invariant: (((((((((!(1 <= NP) || (((MPR1 == s && 259 <= returnVal2) && setEventCalled == 1) && returnVal2 <= 259)) || (returnVal2 <= 0 && MPR1 == s)) || !(NP + 2 <= SKIP1)) || !(NP + 4 <= MPR1)) || 1 == pended) || !(NP == \old(s))) || !(SKIP2 + 3 <= IPC)) || !(NP <= 1)) || !(1 <= compRegistered)) && (((((!(SKIP1 == \old(s)) || ((setEventCalled == \old(setEventCalled) && lowerDriverReturn == \old(lowerDriverReturn)) && SKIP1 == s)) || !(NP + 2 <= SKIP1)) || 1 == pended) || !(0 == compRegistered)) || !(SKIP2 + 3 <= IPC)) - InvariantResult [Line: 550]: Loop Invariant Derived loop invariant: (((((((((!(1 == \old(setEventCalled)) || !(1 <= NP)) || !(NP + 2 <= SKIP1)) || !(NP + 4 <= MPR1)) || 1 == pended) || !(NP == \old(s))) || s == \old(s)) || !(SKIP2 + 3 <= IPC)) || !(NP <= 1)) || !(1 <= compRegistered)) && (((((((((!(1 == \old(setEventCalled)) || !(MPR3 == \old(s))) || !(1 <= NP)) || s == NP) || !(NP + 2 <= SKIP1)) || !(NP + 4 <= MPR1)) || 1 == pended) || !(SKIP2 + 3 <= IPC)) || !(NP <= 1)) || !(1 <= compRegistered)) - InvariantResult [Line: 375]: Loop Invariant Derived loop invariant: ((((((((!(1 == pended) && SKIP2 + 3 <= IPC) && NP + 2 <= SKIP1) || !(\old(NP) == \old(MPR1))) || !(\old(SKIP1) == \old(s))) || 1 == \old(pended)) || !(0 == \old(compRegistered))) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(MPR3))) || !(\old(IPC) <= \old(s)) - InvariantResult [Line: 103]: Loop Invariant Derived loop invariant: (((((((!(1 <= NP) || !(NP + 2 <= SKIP1)) || !(NP + 4 <= MPR1)) || 1 == pended) || !(NP == \old(s))) || !(SKIP2 + 3 <= IPC)) || (((((\old(compRegistered) == compRegistered && s == NP) && setEventCalled == \old(setEventCalled)) && myStatus == \old(myStatus)) && \old(customIrp) == customIrp) && lowerDriverReturn == \old(lowerDriverReturn))) || !(NP <= 1)) || !(0 == \old(compRegistered)) - InvariantResult [Line: 454]: Loop Invariant Derived loop invariant: (((((!(SKIP1 == \old(s)) || ((setEventCalled == \old(setEventCalled) && lowerDriverReturn == \old(lowerDriverReturn)) && SKIP1 == s)) || !(NP + 2 <= SKIP1)) || 1 == pended) || !(0 == compRegistered)) || !(SKIP2 + 3 <= IPC)) && ((((((((!(1 <= NP) || MPR1 == s) || !(NP + 2 <= SKIP1)) || !(NP + 4 <= MPR1)) || 1 == pended) || !(NP == \old(s))) || !(SKIP2 + 3 <= IPC)) || !(NP <= 1)) || !(1 <= compRegistered)) - InvariantResult [Line: 350]: Loop Invariant Derived loop invariant: ((((((!(\old(NP) == \old(MPR1)) || !(\old(SKIP1) == \old(s))) || 1 == \old(pended)) || !(0 == \old(compRegistered))) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(MPR3))) || ((((((((1 <= NP && NP <= 1) && s == NP) && 0 <= status) && !(1 == pended)) && 0 == compRegistered) && NP + 4 <= MPR1) && SKIP2 + 3 <= IPC) && NP + 2 <= SKIP1)) || !(\old(IPC) <= \old(s)) - InvariantResult [Line: 385]: Loop Invariant Derived loop invariant: ((((((((!(1 == pended) && SKIP2 + 3 <= IPC) && NP + 2 <= SKIP1) || !(\old(NP) == \old(MPR1))) || !(\old(SKIP1) == \old(s))) || 1 == \old(pended)) || !(0 == \old(compRegistered))) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(MPR3))) || !(\old(IPC) <= \old(s)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 13 procedures, 151 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 14.4s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 9.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 6.6s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2162 SDtfs, 3393 SDslu, 2853 SDs, 0 SdLazy, 5247 SolverSat, 912 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 353 GetRequests, 168 SyntacticMatches, 3 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 4.0s 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.3s AutomataMinimizationTime, 18 MinimizatonAttempts, 189 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 53 LocationsWithAnnotation, 283 PreInvPairs, 349 NumberOfFragments, 3008 HoareAnnotationTreeSize, 283 FomulaSimplifications, 2295 FormulaSimplificationTreeSizeReduction, 0.6s HoareSimplificationTime, 53 FomulaSimplificationsInter, 6878 FormulaSimplificationTreeSizeReductionInter, 5.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 927 NumberOfCodeBlocks, 927 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 909 ConstructedInterpolants, 0 QuantifiedInterpolants, 205310 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...