./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ntdrivers-simplified/kbfiltr_simpl2.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c3fed411 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ntdrivers-simplified/kbfiltr_simpl2.cil-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bf75d7f1708750397c6bdac14ac08b964b10a95dcecc15b57a02c9969977c6ec --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-17 02:49:54,241 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-17 02:49:54,274 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-17 02:49:54,297 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-17 02:49:54,297 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-17 02:49:54,298 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-17 02:49:54,299 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-17 02:49:54,300 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-17 02:49:54,301 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-17 02:49:54,302 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-17 02:49:54,302 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-17 02:49:54,303 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-17 02:49:54,304 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-17 02:49:54,304 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-17 02:49:54,305 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-17 02:49:54,306 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-17 02:49:54,307 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-17 02:49:54,307 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-17 02:49:54,309 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-17 02:49:54,310 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-17 02:49:54,311 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-17 02:49:54,312 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-17 02:49:54,313 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-17 02:49:54,313 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-17 02:49:54,315 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-17 02:49:54,315 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-17 02:49:54,316 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-17 02:49:54,316 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-17 02:49:54,316 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-17 02:49:54,317 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-17 02:49:54,317 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-17 02:49:54,318 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-17 02:49:54,318 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-17 02:49:54,319 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-17 02:49:54,319 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-17 02:49:54,320 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-17 02:49:54,320 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-17 02:49:54,320 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-17 02:49:54,320 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-17 02:49:54,321 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-17 02:49:54,321 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-17 02:49:54,322 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-17 02:49:54,336 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-17 02:49:54,336 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-17 02:49:54,336 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-17 02:49:54,336 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-17 02:49:54,337 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-17 02:49:54,337 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-17 02:49:54,337 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-17 02:49:54,338 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-17 02:49:54,338 INFO L138 SettingsManager]: * Use SBE=true [2021-12-17 02:49:54,338 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-17 02:49:54,338 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-17 02:49:54,338 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-17 02:49:54,339 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-17 02:49:54,339 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-17 02:49:54,339 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-17 02:49:54,339 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-17 02:49:54,339 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-17 02:49:54,339 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-17 02:49:54,340 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-17 02:49:54,340 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-17 02:49:54,340 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-17 02:49:54,340 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-17 02:49:54,340 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-17 02:49:54,340 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-17 02:49:54,341 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 02:49:54,341 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-17 02:49:54,341 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-17 02:49:54,341 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-17 02:49:54,341 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-17 02:49:54,341 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-17 02:49:54,342 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-17 02:49:54,342 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-17 02:49:54,342 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-17 02:49:54,342 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-17 02:49:54,342 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> bf75d7f1708750397c6bdac14ac08b964b10a95dcecc15b57a02c9969977c6ec [2021-12-17 02:49:54,511 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-17 02:49:54,537 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-17 02:49:54,539 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-17 02:49:54,539 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-17 02:49:54,540 INFO L275 PluginConnector]: CDTParser initialized [2021-12-17 02:49:54,541 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ntdrivers-simplified/kbfiltr_simpl2.cil-1.c [2021-12-17 02:49:54,585 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96fafc6b0/0d5fef27adac4c4994b231348d6aa37b/FLAG9ec90e810 [2021-12-17 02:49:55,052 INFO L306 CDTParser]: Found 1 translation units. [2021-12-17 02:49:55,054 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ntdrivers-simplified/kbfiltr_simpl2.cil-1.c [2021-12-17 02:49:55,069 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96fafc6b0/0d5fef27adac4c4994b231348d6aa37b/FLAG9ec90e810 [2021-12-17 02:49:55,082 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96fafc6b0/0d5fef27adac4c4994b231348d6aa37b [2021-12-17 02:49:55,084 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-17 02:49:55,085 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-17 02:49:55,086 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-17 02:49:55,086 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-17 02:49:55,089 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-17 02:49:55,090 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 02:49:55" (1/1) ... [2021-12-17 02:49:55,091 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@568ef94e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 02:49:55, skipping insertion in model container [2021-12-17 02:49:55,091 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 02:49:55" (1/1) ... [2021-12-17 02:49:55,095 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-17 02:49:55,130 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-17 02:49:55,317 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ntdrivers-simplified/kbfiltr_simpl2.cil-1.c[29620,29633] [2021-12-17 02:49:55,319 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 02:49:55,324 INFO L203 MainTranslator]: Completed pre-run [2021-12-17 02:49:55,375 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ntdrivers-simplified/kbfiltr_simpl2.cil-1.c[29620,29633] [2021-12-17 02:49:55,376 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 02:49:55,386 INFO L208 MainTranslator]: Completed translation [2021-12-17 02:49:55,387 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 02:49:55 WrapperNode [2021-12-17 02:49:55,387 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-17 02:49:55,387 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-17 02:49:55,387 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-17 02:49:55,387 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-17 02:49:55,394 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 02:49:55" (1/1) ... [2021-12-17 02:49:55,407 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 02:49:55" (1/1) ... [2021-12-17 02:49:55,443 INFO L137 Inliner]: procedures = 29, calls = 43, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 662 [2021-12-17 02:49:55,443 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-17 02:49:55,444 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-17 02:49:55,444 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-17 02:49:55,444 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-17 02:49:55,450 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 02:49:55" (1/1) ... [2021-12-17 02:49:55,450 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 02:49:55" (1/1) ... [2021-12-17 02:49:55,452 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 02:49:55" (1/1) ... [2021-12-17 02:49:55,452 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 02:49:55" (1/1) ... [2021-12-17 02:49:55,471 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 02:49:55" (1/1) ... [2021-12-17 02:49:55,474 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 02:49:55" (1/1) ... [2021-12-17 02:49:55,475 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 02:49:55" (1/1) ... [2021-12-17 02:49:55,478 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-17 02:49:55,479 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-17 02:49:55,479 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-17 02:49:55,479 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-17 02:49:55,480 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 02:49:55" (1/1) ... [2021-12-17 02:49:55,493 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 02:49:55,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 02:49:55,516 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-17 02:49:55,521 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-17 02:49:55,540 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-17 02:49:55,540 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_Complete [2021-12-17 02:49:55,540 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_Complete [2021-12-17 02:49:55,541 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2021-12-17 02:49:55,541 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2021-12-17 02:49:55,541 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_CreateClose [2021-12-17 02:49:55,541 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_CreateClose [2021-12-17 02:49:55,541 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2021-12-17 02:49:55,541 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2021-12-17 02:49:55,541 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2021-12-17 02:49:55,542 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2021-12-17 02:49:55,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-17 02:49:55,542 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2021-12-17 02:49:55,542 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2021-12-17 02:49:55,542 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-17 02:49:55,542 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-17 02:49:55,542 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_DispatchPassThrough [2021-12-17 02:49:55,543 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_DispatchPassThrough [2021-12-17 02:49:55,678 INFO L236 CfgBuilder]: Building ICFG [2021-12-17 02:49:55,679 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-17 02:49:55,749 WARN L815 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-12-17 02:49:55,752 WARN L815 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-12-17 02:49:55,754 WARN L815 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-12-17 02:49:55,758 WARN L815 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-12-17 02:49:55,760 WARN L815 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-12-17 02:49:55,982 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume !false; [2021-12-17 02:49:55,982 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##86: assume false; [2021-12-17 02:49:55,982 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##63: assume !false; [2021-12-17 02:49:55,982 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##62: assume false; [2021-12-17 02:49:55,983 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##129: assume false; [2021-12-17 02:49:55,983 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##130: assume !false; [2021-12-17 02:49:55,983 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume false; [2021-12-17 02:49:55,983 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##19: assume !false; [2021-12-17 02:49:55,983 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##113: assume !false; [2021-12-17 02:49:55,983 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##112: assume false; [2021-12-17 02:49:55,998 WARN L815 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-12-17 02:49:56,024 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##12: assume !false; [2021-12-17 02:49:56,025 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume false; [2021-12-17 02:49:56,029 INFO L277 CfgBuilder]: Performing block encoding [2021-12-17 02:49:56,035 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-17 02:49:56,035 INFO L301 CfgBuilder]: Removed 0 assume(true) statements. [2021-12-17 02:49:56,037 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 02:49:56 BoogieIcfgContainer [2021-12-17 02:49:56,037 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-17 02:49:56,038 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-17 02:49:56,038 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-17 02:49:56,041 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-17 02:49:56,041 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.12 02:49:55" (1/3) ... [2021-12-17 02:49:56,041 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@258283f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 02:49:56, skipping insertion in model container [2021-12-17 02:49:56,042 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 02:49:55" (2/3) ... [2021-12-17 02:49:56,042 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@258283f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 02:49:56, skipping insertion in model container [2021-12-17 02:49:56,043 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 02:49:56" (3/3) ... [2021-12-17 02:49:56,043 INFO L111 eAbstractionObserver]: Analyzing ICFG kbfiltr_simpl2.cil-1.c [2021-12-17 02:49:56,048 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-17 02:49:56,052 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-17 02:49:56,081 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-17 02:49:56,085 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-17 02:49:56,085 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-17 02:49:56,100 INFO L276 IsEmpty]: Start isEmpty. Operand has 208 states, 171 states have (on average 1.5964912280701755) internal successors, (273), 188 states have internal predecessors, (273), 28 states have call successors, (28), 7 states have call predecessors, (28), 7 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2021-12-17 02:49:56,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-12-17 02:49:56,104 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 02:49:56,104 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 02:49:56,104 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 02:49:56,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 02:49:56,108 INFO L85 PathProgramCache]: Analyzing trace with hash -809123790, now seen corresponding path program 1 times [2021-12-17 02:49:56,113 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 02:49:56,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476606305] [2021-12-17 02:49:56,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 02:49:56,114 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 02:49:56,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:49:56,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 02:49:56,218 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 02:49:56,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476606305] [2021-12-17 02:49:56,219 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476606305] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 02:49:56,219 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 02:49:56,219 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-17 02:49:56,220 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218650029] [2021-12-17 02:49:56,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 02:49:56,223 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-17 02:49:56,224 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 02:49:56,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-17 02:49:56,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-17 02:49:56,241 INFO L87 Difference]: Start difference. First operand has 208 states, 171 states have (on average 1.5964912280701755) internal successors, (273), 188 states have internal predecessors, (273), 28 states have call successors, (28), 7 states have call predecessors, (28), 7 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 02:49:56,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 02:49:56,310 INFO L93 Difference]: Finished difference Result 338 states and 529 transitions. [2021-12-17 02:49:56,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-17 02:49:56,311 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-12-17 02:49:56,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 02:49:56,318 INFO L225 Difference]: With dead ends: 338 [2021-12-17 02:49:56,318 INFO L226 Difference]: Without dead ends: 198 [2021-12-17 02:49:56,321 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-17 02:49:56,323 INFO L933 BasicCegarLoop]: 308 mSDtfsCounter, 178 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 02:49:56,324 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [189 Valid, 415 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 02:49:56,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2021-12-17 02:49:56,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2021-12-17 02:49:56,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 163 states have (on average 1.5276073619631902) internal successors, (249), 178 states have internal predecessors, (249), 28 states have call successors, (28), 7 states have call predecessors, (28), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2021-12-17 02:49:56,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 292 transitions. [2021-12-17 02:49:56,358 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 292 transitions. Word has length 13 [2021-12-17 02:49:56,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 02:49:56,358 INFO L470 AbstractCegarLoop]: Abstraction has 198 states and 292 transitions. [2021-12-17 02:49:56,358 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 02:49:56,359 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 292 transitions. [2021-12-17 02:49:56,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-12-17 02:49:56,359 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 02:49:56,359 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 02:49:56,360 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-17 02:49:56,360 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 02:49:56,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 02:49:56,360 INFO L85 PathProgramCache]: Analyzing trace with hash 900719787, now seen corresponding path program 1 times [2021-12-17 02:49:56,361 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 02:49:56,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460572391] [2021-12-17 02:49:56,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 02:49:56,361 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 02:49:56,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:49:56,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 02:49:56,469 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 02:49:56,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460572391] [2021-12-17 02:49:56,470 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460572391] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 02:49:56,471 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 02:49:56,471 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-17 02:49:56,471 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355821546] [2021-12-17 02:49:56,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 02:49:56,472 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-17 02:49:56,473 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 02:49:56,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-17 02:49:56,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-17 02:49:56,474 INFO L87 Difference]: Start difference. First operand 198 states and 292 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 02:49:56,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 02:49:56,586 INFO L93 Difference]: Finished difference Result 314 states and 449 transitions. [2021-12-17 02:49:56,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-17 02:49:56,586 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-12-17 02:49:56,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 02:49:56,588 INFO L225 Difference]: With dead ends: 314 [2021-12-17 02:49:56,589 INFO L226 Difference]: Without dead ends: 262 [2021-12-17 02:49:56,589 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-17 02:49:56,590 INFO L933 BasicCegarLoop]: 322 mSDtfsCounter, 201 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 02:49:56,590 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [201 Valid, 428 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-17 02:49:56,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2021-12-17 02:49:56,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 249. [2021-12-17 02:49:56,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 213 states have (on average 1.431924882629108) internal successors, (305), 215 states have internal predecessors, (305), 25 states have call successors, (25), 11 states have call predecessors, (25), 10 states have return successors, (27), 25 states have call predecessors, (27), 18 states have call successors, (27) [2021-12-17 02:49:56,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 357 transitions. [2021-12-17 02:49:56,621 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 357 transitions. Word has length 19 [2021-12-17 02:49:56,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 02:49:56,622 INFO L470 AbstractCegarLoop]: Abstraction has 249 states and 357 transitions. [2021-12-17 02:49:56,622 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 02:49:56,622 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 357 transitions. [2021-12-17 02:49:56,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-12-17 02:49:56,624 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 02:49:56,624 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 02:49:56,624 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-17 02:49:56,624 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 02:49:56,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 02:49:56,625 INFO L85 PathProgramCache]: Analyzing trace with hash -2016043530, now seen corresponding path program 1 times [2021-12-17 02:49:56,625 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 02:49:56,626 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485964559] [2021-12-17 02:49:56,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 02:49:56,626 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 02:49:56,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:49:56,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 02:49:56,683 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 02:49:56,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485964559] [2021-12-17 02:49:56,684 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485964559] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 02:49:56,684 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 02:49:56,684 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-17 02:49:56,684 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948564917] [2021-12-17 02:49:56,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 02:49:56,685 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-17 02:49:56,685 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 02:49:56,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-17 02:49:56,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-17 02:49:56,686 INFO L87 Difference]: Start difference. First operand 249 states and 357 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 02:49:56,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 02:49:56,711 INFO L93 Difference]: Finished difference Result 402 states and 557 transitions. [2021-12-17 02:49:56,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-17 02:49:56,712 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-12-17 02:49:56,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 02:49:56,715 INFO L225 Difference]: With dead ends: 402 [2021-12-17 02:49:56,715 INFO L226 Difference]: Without dead ends: 306 [2021-12-17 02:49:56,718 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-17 02:49:56,719 INFO L933 BasicCegarLoop]: 268 mSDtfsCounter, 238 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 02:49:56,719 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [238 Valid, 352 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 02:49:56,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2021-12-17 02:49:56,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 287. [2021-12-17 02:49:56,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 253 states have (on average 1.4189723320158103) internal successors, (359), 253 states have internal predecessors, (359), 21 states have call successors, (21), 11 states have call predecessors, (21), 12 states have return successors, (26), 23 states have call predecessors, (26), 16 states have call successors, (26) [2021-12-17 02:49:56,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 406 transitions. [2021-12-17 02:49:56,743 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 406 transitions. Word has length 18 [2021-12-17 02:49:56,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 02:49:56,743 INFO L470 AbstractCegarLoop]: Abstraction has 287 states and 406 transitions. [2021-12-17 02:49:56,744 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 02:49:56,744 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 406 transitions. [2021-12-17 02:49:56,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-17 02:49:56,747 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 02:49:56,747 INFO L514 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] [2021-12-17 02:49:56,747 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-17 02:49:56,747 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 02:49:56,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 02:49:56,748 INFO L85 PathProgramCache]: Analyzing trace with hash 2086831099, now seen corresponding path program 1 times [2021-12-17 02:49:56,748 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 02:49:56,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045082291] [2021-12-17 02:49:56,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 02:49:56,748 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 02:49:56,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:49:56,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 02:49:56,813 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 02:49:56,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045082291] [2021-12-17 02:49:56,814 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045082291] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 02:49:56,814 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 02:49:56,814 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-17 02:49:56,814 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088219910] [2021-12-17 02:49:56,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 02:49:56,815 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-17 02:49:56,815 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 02:49:56,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-17 02:49:56,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-17 02:49:56,817 INFO L87 Difference]: Start difference. First operand 287 states and 406 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 3 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 02:49:56,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 02:49:56,881 INFO L93 Difference]: Finished difference Result 290 states and 408 transitions. [2021-12-17 02:49:56,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-17 02:49:56,882 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 3 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-12-17 02:49:56,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 02:49:56,884 INFO L225 Difference]: With dead ends: 290 [2021-12-17 02:49:56,885 INFO L226 Difference]: Without dead ends: 286 [2021-12-17 02:49:56,885 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-17 02:49:56,886 INFO L933 BasicCegarLoop]: 267 mSDtfsCounter, 25 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 02:49:56,897 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 469 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-17 02:49:56,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2021-12-17 02:49:56,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 286. [2021-12-17 02:49:56,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 253 states have (on average 1.4110671936758894) internal successors, (357), 252 states have internal predecessors, (357), 20 states have call successors, (20), 11 states have call predecessors, (20), 12 states have return successors, (26), 23 states have call predecessors, (26), 16 states have call successors, (26) [2021-12-17 02:49:56,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 403 transitions. [2021-12-17 02:49:56,916 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 403 transitions. Word has length 29 [2021-12-17 02:49:56,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 02:49:56,917 INFO L470 AbstractCegarLoop]: Abstraction has 286 states and 403 transitions. [2021-12-17 02:49:56,917 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 3 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 02:49:56,917 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 403 transitions. [2021-12-17 02:49:56,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-12-17 02:49:56,923 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 02:49:56,923 INFO L514 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] [2021-12-17 02:49:56,923 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-17 02:49:56,923 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 02:49:56,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 02:49:56,925 INFO L85 PathProgramCache]: Analyzing trace with hash -507734156, now seen corresponding path program 1 times [2021-12-17 02:49:56,925 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 02:49:56,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011301832] [2021-12-17 02:49:56,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 02:49:56,926 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 02:49:56,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:49:57,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-17 02:49:57,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:49:57,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 02:49:57,056 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 02:49:57,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011301832] [2021-12-17 02:49:57,056 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011301832] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 02:49:57,056 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 02:49:57,056 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-17 02:49:57,056 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542529318] [2021-12-17 02:49:57,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 02:49:57,057 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-17 02:49:57,057 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 02:49:57,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-17 02:49:57,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-17 02:49:57,058 INFO L87 Difference]: Start difference. First operand 286 states and 403 transitions. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 5 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-17 02:49:57,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 02:49:57,206 INFO L93 Difference]: Finished difference Result 308 states and 427 transitions. [2021-12-17 02:49:57,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-17 02:49:57,206 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 5 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2021-12-17 02:49:57,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 02:49:57,209 INFO L225 Difference]: With dead ends: 308 [2021-12-17 02:49:57,209 INFO L226 Difference]: Without dead ends: 303 [2021-12-17 02:49:57,210 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-12-17 02:49:57,212 INFO L933 BasicCegarLoop]: 251 mSDtfsCounter, 331 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 624 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 02:49:57,214 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [333 Valid, 624 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-17 02:49:57,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2021-12-17 02:49:57,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 296. [2021-12-17 02:49:57,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 263 states have (on average 1.403041825095057) internal successors, (369), 261 states have internal predecessors, (369), 20 states have call successors, (20), 11 states have call predecessors, (20), 12 states have return successors, (26), 23 states have call predecessors, (26), 16 states have call successors, (26) [2021-12-17 02:49:57,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 415 transitions. [2021-12-17 02:49:57,240 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 415 transitions. Word has length 33 [2021-12-17 02:49:57,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 02:49:57,240 INFO L470 AbstractCegarLoop]: Abstraction has 296 states and 415 transitions. [2021-12-17 02:49:57,240 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 5 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-17 02:49:57,241 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 415 transitions. [2021-12-17 02:49:57,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-12-17 02:49:57,242 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 02:49:57,242 INFO L514 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] [2021-12-17 02:49:57,242 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-17 02:49:57,242 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 02:49:57,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 02:49:57,243 INFO L85 PathProgramCache]: Analyzing trace with hash 1061247362, now seen corresponding path program 1 times [2021-12-17 02:49:57,243 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 02:49:57,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422803709] [2021-12-17 02:49:57,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 02:49:57,243 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 02:49:57,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:49:57,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-17 02:49:57,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:49:57,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 02:49:57,344 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 02:49:57,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422803709] [2021-12-17 02:49:57,345 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422803709] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 02:49:57,345 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 02:49:57,345 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-17 02:49:57,345 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074363700] [2021-12-17 02:49:57,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 02:49:57,346 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-17 02:49:57,346 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 02:49:57,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-17 02:49:57,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-17 02:49:57,347 INFO L87 Difference]: Start difference. First operand 296 states and 415 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-17 02:49:57,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 02:49:57,477 INFO L93 Difference]: Finished difference Result 308 states and 426 transitions. [2021-12-17 02:49:57,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-17 02:49:57,477 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2021-12-17 02:49:57,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 02:49:57,479 INFO L225 Difference]: With dead ends: 308 [2021-12-17 02:49:57,479 INFO L226 Difference]: Without dead ends: 303 [2021-12-17 02:49:57,480 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-12-17 02:49:57,482 INFO L933 BasicCegarLoop]: 252 mSDtfsCounter, 327 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 625 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 02:49:57,485 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [329 Valid, 625 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-17 02:49:57,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2021-12-17 02:49:57,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 297. [2021-12-17 02:49:57,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 264 states have (on average 1.4015151515151516) internal successors, (370), 262 states have internal predecessors, (370), 20 states have call successors, (20), 11 states have call predecessors, (20), 12 states have return successors, (26), 23 states have call predecessors, (26), 16 states have call successors, (26) [2021-12-17 02:49:57,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 416 transitions. [2021-12-17 02:49:57,498 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 416 transitions. Word has length 34 [2021-12-17 02:49:57,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 02:49:57,499 INFO L470 AbstractCegarLoop]: Abstraction has 297 states and 416 transitions. [2021-12-17 02:49:57,499 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-17 02:49:57,499 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 416 transitions. [2021-12-17 02:49:57,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-12-17 02:49:57,500 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 02:49:57,500 INFO L514 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] [2021-12-17 02:49:57,500 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-17 02:49:57,500 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 02:49:57,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 02:49:57,501 INFO L85 PathProgramCache]: Analyzing trace with hash -1403318816, now seen corresponding path program 1 times [2021-12-17 02:49:57,501 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 02:49:57,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197548758] [2021-12-17 02:49:57,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 02:49:57,501 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 02:49:57,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:49:57,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-17 02:49:57,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:49:57,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 02:49:57,537 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 02:49:57,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197548758] [2021-12-17 02:49:57,537 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197548758] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 02:49:57,537 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 02:49:57,537 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-17 02:49:57,537 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220299416] [2021-12-17 02:49:57,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 02:49:57,538 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-17 02:49:57,538 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 02:49:57,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-17 02:49:57,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-17 02:49:57,539 INFO L87 Difference]: Start difference. First operand 297 states and 416 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-17 02:49:57,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 02:49:57,649 INFO L93 Difference]: Finished difference Result 336 states and 455 transitions. [2021-12-17 02:49:57,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-17 02:49:57,649 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2021-12-17 02:49:57,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 02:49:57,651 INFO L225 Difference]: With dead ends: 336 [2021-12-17 02:49:57,651 INFO L226 Difference]: Without dead ends: 278 [2021-12-17 02:49:57,651 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-17 02:49:57,652 INFO L933 BasicCegarLoop]: 288 mSDtfsCounter, 313 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 731 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 02:49:57,652 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [313 Valid, 731 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-17 02:49:57,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2021-12-17 02:49:57,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 264. [2021-12-17 02:49:57,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 233 states have (on average 1.390557939914163) internal successors, (324), 231 states have internal predecessors, (324), 18 states have call successors, (18), 10 states have call predecessors, (18), 12 states have return successors, (23), 22 states have call predecessors, (23), 14 states have call successors, (23) [2021-12-17 02:49:57,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 365 transitions. [2021-12-17 02:49:57,661 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 365 transitions. Word has length 34 [2021-12-17 02:49:57,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 02:49:57,661 INFO L470 AbstractCegarLoop]: Abstraction has 264 states and 365 transitions. [2021-12-17 02:49:57,661 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-17 02:49:57,661 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 365 transitions. [2021-12-17 02:49:57,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-12-17 02:49:57,662 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 02:49:57,662 INFO L514 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] [2021-12-17 02:49:57,662 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-17 02:49:57,663 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 02:49:57,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 02:49:57,663 INFO L85 PathProgramCache]: Analyzing trace with hash -2069817110, now seen corresponding path program 1 times [2021-12-17 02:49:57,663 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 02:49:57,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133476560] [2021-12-17 02:49:57,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 02:49:57,664 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 02:49:57,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:49:57,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 02:49:57,685 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 02:49:57,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133476560] [2021-12-17 02:49:57,685 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133476560] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 02:49:57,685 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 02:49:57,685 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-17 02:49:57,685 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621860450] [2021-12-17 02:49:57,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 02:49:57,686 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-17 02:49:57,686 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 02:49:57,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-17 02:49:57,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-17 02:49:57,687 INFO L87 Difference]: Start difference. First operand 264 states and 365 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 02:49:57,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 02:49:57,758 INFO L93 Difference]: Finished difference Result 317 states and 429 transitions. [2021-12-17 02:49:57,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-17 02:49:57,758 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2021-12-17 02:49:57,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 02:49:57,759 INFO L225 Difference]: With dead ends: 317 [2021-12-17 02:49:57,759 INFO L226 Difference]: Without dead ends: 282 [2021-12-17 02:49:57,760 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-17 02:49:57,760 INFO L933 BasicCegarLoop]: 243 mSDtfsCounter, 289 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 02:49:57,760 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [289 Valid, 421 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-17 02:49:57,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2021-12-17 02:49:57,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 264. [2021-12-17 02:49:57,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 233 states have (on average 1.3819742489270386) internal successors, (322), 231 states have internal predecessors, (322), 18 states have call successors, (18), 10 states have call predecessors, (18), 12 states have return successors, (23), 22 states have call predecessors, (23), 14 states have call successors, (23) [2021-12-17 02:49:57,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 363 transitions. [2021-12-17 02:49:57,782 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 363 transitions. Word has length 34 [2021-12-17 02:49:57,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 02:49:57,782 INFO L470 AbstractCegarLoop]: Abstraction has 264 states and 363 transitions. [2021-12-17 02:49:57,782 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 02:49:57,783 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 363 transitions. [2021-12-17 02:49:57,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-12-17 02:49:57,783 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 02:49:57,783 INFO L514 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] [2021-12-17 02:49:57,784 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-17 02:49:57,784 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 02:49:57,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 02:49:57,784 INFO L85 PathProgramCache]: Analyzing trace with hash -1671852310, now seen corresponding path program 1 times [2021-12-17 02:49:57,784 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 02:49:57,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531486823] [2021-12-17 02:49:57,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 02:49:57,785 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 02:49:57,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:49:57,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-17 02:49:57,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:49:57,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 02:49:57,806 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 02:49:57,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531486823] [2021-12-17 02:49:57,806 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531486823] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 02:49:57,806 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 02:49:57,806 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-17 02:49:57,807 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660599297] [2021-12-17 02:49:57,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 02:49:57,807 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-17 02:49:57,807 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 02:49:57,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-17 02:49:57,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-17 02:49:57,808 INFO L87 Difference]: Start difference. First operand 264 states and 363 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-17 02:49:57,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 02:49:57,862 INFO L93 Difference]: Finished difference Result 278 states and 380 transitions. [2021-12-17 02:49:57,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-17 02:49:57,862 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2021-12-17 02:49:57,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 02:49:57,863 INFO L225 Difference]: With dead ends: 278 [2021-12-17 02:49:57,863 INFO L226 Difference]: Without dead ends: 82 [2021-12-17 02:49:57,864 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-17 02:49:57,864 INFO L933 BasicCegarLoop]: 244 mSDtfsCounter, 285 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 02:49:57,864 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [285 Valid, 421 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 02:49:57,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2021-12-17 02:49:57,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2021-12-17 02:49:57,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 70 states have (on average 1.2428571428571429) internal successors, (87), 72 states have internal predecessors, (87), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2021-12-17 02:49:57,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 98 transitions. [2021-12-17 02:49:57,868 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 98 transitions. Word has length 35 [2021-12-17 02:49:57,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 02:49:57,868 INFO L470 AbstractCegarLoop]: Abstraction has 82 states and 98 transitions. [2021-12-17 02:49:57,868 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-17 02:49:57,868 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 98 transitions. [2021-12-17 02:49:57,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-12-17 02:49:57,869 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 02:49:57,869 INFO L514 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] [2021-12-17 02:49:57,869 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-17 02:49:57,869 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 02:49:57,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 02:49:57,870 INFO L85 PathProgramCache]: Analyzing trace with hash 965976384, now seen corresponding path program 1 times [2021-12-17 02:49:57,870 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 02:49:57,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544653349] [2021-12-17 02:49:57,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 02:49:57,870 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 02:49:57,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:49:57,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-17 02:49:57,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:49:57,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-12-17 02:49:57,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:49:57,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 02:49:57,897 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 02:49:57,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544653349] [2021-12-17 02:49:57,897 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544653349] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 02:49:57,897 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 02:49:57,897 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-17 02:49:57,897 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548617620] [2021-12-17 02:49:57,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 02:49:57,898 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-17 02:49:57,898 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 02:49:57,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-17 02:49:57,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-17 02:49:57,899 INFO L87 Difference]: Start difference. First operand 82 states and 98 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-17 02:49:57,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 02:49:57,937 INFO L93 Difference]: Finished difference Result 106 states and 127 transitions. [2021-12-17 02:49:57,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-17 02:49:57,937 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 39 [2021-12-17 02:49:57,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 02:49:57,938 INFO L225 Difference]: With dead ends: 106 [2021-12-17 02:49:57,938 INFO L226 Difference]: Without dead ends: 80 [2021-12-17 02:49:57,938 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-17 02:49:57,939 INFO L933 BasicCegarLoop]: 77 mSDtfsCounter, 31 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 02:49:57,939 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 222 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 02:49:57,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2021-12-17 02:49:57,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2021-12-17 02:49:57,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 69 states have (on average 1.2173913043478262) internal successors, (84), 70 states have internal predecessors, (84), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2021-12-17 02:49:57,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 94 transitions. [2021-12-17 02:49:57,942 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 94 transitions. Word has length 39 [2021-12-17 02:49:57,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 02:49:57,942 INFO L470 AbstractCegarLoop]: Abstraction has 80 states and 94 transitions. [2021-12-17 02:49:57,943 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-17 02:49:57,943 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 94 transitions. [2021-12-17 02:49:57,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-12-17 02:49:57,943 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 02:49:57,943 INFO L514 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] [2021-12-17 02:49:57,943 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-17 02:49:57,944 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 02:49:57,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 02:49:57,944 INFO L85 PathProgramCache]: Analyzing trace with hash -1309646071, now seen corresponding path program 1 times [2021-12-17 02:49:57,944 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 02:49:57,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422008373] [2021-12-17 02:49:57,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 02:49:57,945 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 02:49:57,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:49:57,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-17 02:49:57,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:49:57,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 02:49:57,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:49:57,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 02:49:57,991 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 02:49:57,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422008373] [2021-12-17 02:49:57,991 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422008373] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 02:49:57,991 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 02:49:57,991 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-17 02:49:57,991 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494180019] [2021-12-17 02:49:57,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 02:49:57,992 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-17 02:49:57,992 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 02:49:57,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-17 02:49:57,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-12-17 02:49:57,993 INFO L87 Difference]: Start difference. First operand 80 states and 94 transitions. Second operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 5 states have internal predecessors, (36), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-17 02:49:58,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 02:49:58,045 INFO L93 Difference]: Finished difference Result 126 states and 151 transitions. [2021-12-17 02:49:58,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-17 02:49:58,046 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 5 states have internal predecessors, (36), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 41 [2021-12-17 02:49:58,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 02:49:58,046 INFO L225 Difference]: With dead ends: 126 [2021-12-17 02:49:58,047 INFO L226 Difference]: Without dead ends: 91 [2021-12-17 02:49:58,047 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-12-17 02:49:58,047 INFO L933 BasicCegarLoop]: 68 mSDtfsCounter, 17 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 02:49:58,048 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 404 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 02:49:58,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2021-12-17 02:49:58,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 85. [2021-12-17 02:49:58,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 73 states have (on average 1.2054794520547945) internal successors, (88), 74 states have internal predecessors, (88), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2021-12-17 02:49:58,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 99 transitions. [2021-12-17 02:49:58,051 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 99 transitions. Word has length 41 [2021-12-17 02:49:58,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 02:49:58,051 INFO L470 AbstractCegarLoop]: Abstraction has 85 states and 99 transitions. [2021-12-17 02:49:58,051 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 5 states have internal predecessors, (36), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-17 02:49:58,052 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 99 transitions. [2021-12-17 02:49:58,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-12-17 02:49:58,052 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 02:49:58,052 INFO L514 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] [2021-12-17 02:49:58,052 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-17 02:49:58,052 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 02:49:58,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 02:49:58,053 INFO L85 PathProgramCache]: Analyzing trace with hash -1579777203, now seen corresponding path program 1 times [2021-12-17 02:49:58,053 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 02:49:58,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838291192] [2021-12-17 02:49:58,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 02:49:58,053 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 02:49:58,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:49:58,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-17 02:49:58,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:49:58,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 02:49:58,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:49:58,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 02:49:58,102 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 02:49:58,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838291192] [2021-12-17 02:49:58,102 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838291192] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 02:49:58,102 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 02:49:58,102 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-17 02:49:58,102 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000740452] [2021-12-17 02:49:58,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 02:49:58,103 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-17 02:49:58,103 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 02:49:58,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-17 02:49:58,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-12-17 02:49:58,103 INFO L87 Difference]: Start difference. First operand 85 states and 99 transitions. Second operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 5 states have internal predecessors, (37), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-17 02:49:58,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 02:49:58,160 INFO L93 Difference]: Finished difference Result 96 states and 111 transitions. [2021-12-17 02:49:58,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-17 02:49:58,161 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 5 states have internal predecessors, (37), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 43 [2021-12-17 02:49:58,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 02:49:58,162 INFO L225 Difference]: With dead ends: 96 [2021-12-17 02:49:58,162 INFO L226 Difference]: Without dead ends: 89 [2021-12-17 02:49:58,162 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2021-12-17 02:49:58,163 INFO L933 BasicCegarLoop]: 68 mSDtfsCounter, 17 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 02:49:58,163 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 396 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 02:49:58,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2021-12-17 02:49:58,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 86. [2021-12-17 02:49:58,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 74 states have (on average 1.2027027027027026) internal successors, (89), 75 states have internal predecessors, (89), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2021-12-17 02:49:58,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 100 transitions. [2021-12-17 02:49:58,177 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 100 transitions. Word has length 43 [2021-12-17 02:49:58,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 02:49:58,177 INFO L470 AbstractCegarLoop]: Abstraction has 86 states and 100 transitions. [2021-12-17 02:49:58,177 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 5 states have internal predecessors, (37), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-17 02:49:58,177 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 100 transitions. [2021-12-17 02:49:58,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-12-17 02:49:58,178 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 02:49:58,178 INFO L514 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] [2021-12-17 02:49:58,178 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-17 02:49:58,178 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 02:49:58,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 02:49:58,179 INFO L85 PathProgramCache]: Analyzing trace with hash 1941659704, now seen corresponding path program 1 times [2021-12-17 02:49:58,179 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 02:49:58,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564584968] [2021-12-17 02:49:58,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 02:49:58,179 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 02:49:58,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:49:58,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-17 02:49:58,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:49:58,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 02:49:58,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:49:58,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 02:49:58,208 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 02:49:58,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564584968] [2021-12-17 02:49:58,208 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564584968] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 02:49:58,208 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 02:49:58,208 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-17 02:49:58,208 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361507910] [2021-12-17 02:49:58,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 02:49:58,209 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-17 02:49:58,209 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 02:49:58,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-17 02:49:58,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-12-17 02:49:58,209 INFO L87 Difference]: Start difference. First operand 86 states and 100 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-17 02:49:58,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 02:49:58,240 INFO L93 Difference]: Finished difference Result 102 states and 117 transitions. [2021-12-17 02:49:58,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-17 02:49:58,240 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 42 [2021-12-17 02:49:58,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 02:49:58,241 INFO L225 Difference]: With dead ends: 102 [2021-12-17 02:49:58,241 INFO L226 Difference]: Without dead ends: 97 [2021-12-17 02:49:58,241 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-12-17 02:49:58,242 INFO L933 BasicCegarLoop]: 81 mSDtfsCounter, 28 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 02:49:58,242 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 184 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 02:49:58,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2021-12-17 02:49:58,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 88. [2021-12-17 02:49:58,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 76 states have (on average 1.1842105263157894) internal successors, (90), 77 states have internal predecessors, (90), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2021-12-17 02:49:58,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 101 transitions. [2021-12-17 02:49:58,246 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 101 transitions. Word has length 42 [2021-12-17 02:49:58,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 02:49:58,246 INFO L470 AbstractCegarLoop]: Abstraction has 88 states and 101 transitions. [2021-12-17 02:49:58,246 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-17 02:49:58,246 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 101 transitions. [2021-12-17 02:49:58,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-12-17 02:49:58,247 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 02:49:58,247 INFO L514 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] [2021-12-17 02:49:58,247 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-17 02:49:58,247 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 02:49:58,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 02:49:58,247 INFO L85 PathProgramCache]: Analyzing trace with hash 598103956, now seen corresponding path program 1 times [2021-12-17 02:49:58,248 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 02:49:58,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908246327] [2021-12-17 02:49:58,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 02:49:58,248 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 02:49:58,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:49:58,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-17 02:49:58,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:49:58,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 02:49:58,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:49:58,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 02:49:58,277 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 02:49:58,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908246327] [2021-12-17 02:49:58,277 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908246327] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 02:49:58,277 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 02:49:58,278 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-17 02:49:58,278 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045270905] [2021-12-17 02:49:58,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 02:49:58,278 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-17 02:49:58,278 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 02:49:58,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-17 02:49:58,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-12-17 02:49:58,279 INFO L87 Difference]: Start difference. First operand 88 states and 101 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 3 states have internal predecessors, (38), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-17 02:49:58,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 02:49:58,325 INFO L93 Difference]: Finished difference Result 174 states and 198 transitions. [2021-12-17 02:49:58,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-17 02:49:58,325 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 3 states have internal predecessors, (38), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 44 [2021-12-17 02:49:58,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 02:49:58,326 INFO L225 Difference]: With dead ends: 174 [2021-12-17 02:49:58,326 INFO L226 Difference]: Without dead ends: 167 [2021-12-17 02:49:58,326 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-12-17 02:49:58,327 INFO L933 BasicCegarLoop]: 74 mSDtfsCounter, 54 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 02:49:58,327 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [55 Valid, 232 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 02:49:58,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2021-12-17 02:49:58,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 157. [2021-12-17 02:49:58,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 137 states have (on average 1.1897810218978102) internal successors, (163), 139 states have internal predecessors, (163), 9 states have call successors, (9), 8 states have call predecessors, (9), 10 states have return successors, (10), 9 states have call predecessors, (10), 6 states have call successors, (10) [2021-12-17 02:49:58,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 182 transitions. [2021-12-17 02:49:58,332 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 182 transitions. Word has length 44 [2021-12-17 02:49:58,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 02:49:58,333 INFO L470 AbstractCegarLoop]: Abstraction has 157 states and 182 transitions. [2021-12-17 02:49:58,333 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 3 states have internal predecessors, (38), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-17 02:49:58,333 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 182 transitions. [2021-12-17 02:49:58,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-12-17 02:49:58,333 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 02:49:58,333 INFO L514 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] [2021-12-17 02:49:58,334 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-17 02:49:58,334 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 02:49:58,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 02:49:58,334 INFO L85 PathProgramCache]: Analyzing trace with hash -1921855978, now seen corresponding path program 1 times [2021-12-17 02:49:58,334 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 02:49:58,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872792083] [2021-12-17 02:49:58,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 02:49:58,335 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 02:49:58,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:49:58,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-17 02:49:58,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:49:58,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 02:49:58,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:49:58,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 02:49:58,384 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 02:49:58,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872792083] [2021-12-17 02:49:58,384 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872792083] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 02:49:58,384 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 02:49:58,384 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-17 02:49:58,384 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864651376] [2021-12-17 02:49:58,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 02:49:58,385 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-17 02:49:58,385 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 02:49:58,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-17 02:49:58,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-17 02:49:58,385 INFO L87 Difference]: Start difference. First operand 157 states and 182 transitions. Second operand has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-17 02:49:58,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 02:49:58,421 INFO L93 Difference]: Finished difference Result 217 states and 252 transitions. [2021-12-17 02:49:58,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-17 02:49:58,421 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 44 [2021-12-17 02:49:58,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 02:49:58,422 INFO L225 Difference]: With dead ends: 217 [2021-12-17 02:49:58,422 INFO L226 Difference]: Without dead ends: 145 [2021-12-17 02:49:58,422 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-17 02:49:58,422 INFO L933 BasicCegarLoop]: 70 mSDtfsCounter, 22 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 02:49:58,423 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 338 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 02:49:58,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2021-12-17 02:49:58,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2021-12-17 02:49:58,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 125 states have (on average 1.16) internal successors, (145), 127 states have internal predecessors, (145), 9 states have call successors, (9), 8 states have call predecessors, (9), 10 states have return successors, (10), 9 states have call predecessors, (10), 6 states have call successors, (10) [2021-12-17 02:49:58,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 164 transitions. [2021-12-17 02:49:58,428 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 164 transitions. Word has length 44 [2021-12-17 02:49:58,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 02:49:58,428 INFO L470 AbstractCegarLoop]: Abstraction has 145 states and 164 transitions. [2021-12-17 02:49:58,428 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-17 02:49:58,428 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 164 transitions. [2021-12-17 02:49:58,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-12-17 02:49:58,429 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 02:49:58,429 INFO L514 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] [2021-12-17 02:49:58,429 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-17 02:49:58,429 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 02:49:58,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 02:49:58,430 INFO L85 PathProgramCache]: Analyzing trace with hash -944983075, now seen corresponding path program 1 times [2021-12-17 02:49:58,430 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 02:49:58,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666087439] [2021-12-17 02:49:58,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 02:49:58,430 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 02:49:58,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:49:58,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-17 02:49:58,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:49:58,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 02:49:58,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:49:58,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-17 02:49:58,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:49:58,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 02:49:58,488 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 02:49:58,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666087439] [2021-12-17 02:49:58,489 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666087439] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 02:49:58,489 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 02:49:58,489 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-17 02:49:58,489 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797665567] [2021-12-17 02:49:58,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 02:49:58,489 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-17 02:49:58,489 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 02:49:58,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-17 02:49:58,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-12-17 02:49:58,490 INFO L87 Difference]: Start difference. First operand 145 states and 164 transitions. Second operand has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 6 states have internal predecessors, (40), 3 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-17 02:49:58,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 02:49:58,588 INFO L93 Difference]: Finished difference Result 189 states and 218 transitions. [2021-12-17 02:49:58,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-17 02:49:58,589 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 6 states have internal predecessors, (40), 3 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 48 [2021-12-17 02:49:58,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 02:49:58,590 INFO L225 Difference]: With dead ends: 189 [2021-12-17 02:49:58,590 INFO L226 Difference]: Without dead ends: 129 [2021-12-17 02:49:58,590 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2021-12-17 02:49:58,591 INFO L933 BasicCegarLoop]: 63 mSDtfsCounter, 81 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 02:49:58,591 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [81 Valid, 267 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-17 02:49:58,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2021-12-17 02:49:58,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2021-12-17 02:49:58,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 111 states have (on average 1.1441441441441442) internal successors, (127), 113 states have internal predecessors, (127), 9 states have call successors, (9), 8 states have call predecessors, (9), 8 states have return successors, (8), 7 states have call predecessors, (8), 6 states have call successors, (8) [2021-12-17 02:49:58,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 144 transitions. [2021-12-17 02:49:58,597 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 144 transitions. Word has length 48 [2021-12-17 02:49:58,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 02:49:58,597 INFO L470 AbstractCegarLoop]: Abstraction has 129 states and 144 transitions. [2021-12-17 02:49:58,597 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 6 states have internal predecessors, (40), 3 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-17 02:49:58,597 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 144 transitions. [2021-12-17 02:49:58,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-12-17 02:49:58,598 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 02:49:58,598 INFO L514 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] [2021-12-17 02:49:58,598 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-17 02:49:58,598 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 02:49:58,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 02:49:58,599 INFO L85 PathProgramCache]: Analyzing trace with hash 1127576207, now seen corresponding path program 1 times [2021-12-17 02:49:58,599 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 02:49:58,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488269595] [2021-12-17 02:49:58,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 02:49:58,599 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 02:49:58,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:49:58,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-17 02:49:58,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:49:58,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 02:49:58,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:49:58,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-17 02:49:58,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:49:58,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 02:49:58,636 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 02:49:58,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488269595] [2021-12-17 02:49:58,636 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488269595] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 02:49:58,636 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 02:49:58,636 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-17 02:49:58,636 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252007980] [2021-12-17 02:49:58,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 02:49:58,637 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-17 02:49:58,637 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 02:49:58,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-17 02:49:58,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-17 02:49:58,637 INFO L87 Difference]: Start difference. First operand 129 states and 144 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2021-12-17 02:49:58,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 02:49:58,677 INFO L93 Difference]: Finished difference Result 185 states and 212 transitions. [2021-12-17 02:49:58,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-17 02:49:58,677 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 49 [2021-12-17 02:49:58,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 02:49:58,678 INFO L225 Difference]: With dead ends: 185 [2021-12-17 02:49:58,678 INFO L226 Difference]: Without dead ends: 141 [2021-12-17 02:49:58,678 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-17 02:49:58,679 INFO L933 BasicCegarLoop]: 66 mSDtfsCounter, 14 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 02:49:58,679 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 243 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 02:49:58,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2021-12-17 02:49:58,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 135. [2021-12-17 02:49:58,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 117 states have (on average 1.1367521367521367) internal successors, (133), 119 states have internal predecessors, (133), 9 states have call successors, (9), 8 states have call predecessors, (9), 8 states have return successors, (8), 7 states have call predecessors, (8), 6 states have call successors, (8) [2021-12-17 02:49:58,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 150 transitions. [2021-12-17 02:49:58,684 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 150 transitions. Word has length 49 [2021-12-17 02:49:58,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 02:49:58,685 INFO L470 AbstractCegarLoop]: Abstraction has 135 states and 150 transitions. [2021-12-17 02:49:58,685 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2021-12-17 02:49:58,685 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 150 transitions. [2021-12-17 02:49:58,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-12-17 02:49:58,685 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 02:49:58,685 INFO L514 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] [2021-12-17 02:49:58,686 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-12-17 02:49:58,686 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 02:49:58,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 02:49:58,686 INFO L85 PathProgramCache]: Analyzing trace with hash 1385741645, now seen corresponding path program 1 times [2021-12-17 02:49:58,686 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 02:49:58,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191539402] [2021-12-17 02:49:58,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 02:49:58,687 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 02:49:58,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:49:58,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-17 02:49:58,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:49:58,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 02:49:58,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:49:58,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-17 02:49:58,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:49:58,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 02:49:58,741 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 02:49:58,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191539402] [2021-12-17 02:49:58,741 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191539402] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 02:49:58,742 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 02:49:58,742 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-17 02:49:58,742 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142048120] [2021-12-17 02:49:58,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 02:49:58,742 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-17 02:49:58,742 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 02:49:58,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-17 02:49:58,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-17 02:49:58,743 INFO L87 Difference]: Start difference. First operand 135 states and 150 transitions. Second operand has 8 states, 8 states have (on average 5.25) internal successors, (42), 5 states have internal predecessors, (42), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-17 02:49:58,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 02:49:58,820 INFO L93 Difference]: Finished difference Result 138 states and 152 transitions. [2021-12-17 02:49:58,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-17 02:49:58,820 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 5 states have internal predecessors, (42), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 49 [2021-12-17 02:49:58,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 02:49:58,821 INFO L225 Difference]: With dead ends: 138 [2021-12-17 02:49:58,821 INFO L226 Difference]: Without dead ends: 115 [2021-12-17 02:49:58,821 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2021-12-17 02:49:58,822 INFO L933 BasicCegarLoop]: 57 mSDtfsCounter, 116 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 02:49:58,822 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [116 Valid, 159 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 02:49:58,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2021-12-17 02:49:58,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2021-12-17 02:49:58,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 99 states have (on average 1.121212121212121) internal successors, (111), 100 states have internal predecessors, (111), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-17 02:49:58,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 126 transitions. [2021-12-17 02:49:58,826 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 126 transitions. Word has length 49 [2021-12-17 02:49:58,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 02:49:58,826 INFO L470 AbstractCegarLoop]: Abstraction has 115 states and 126 transitions. [2021-12-17 02:49:58,827 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 5 states have internal predecessors, (42), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-17 02:49:58,827 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 126 transitions. [2021-12-17 02:49:58,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-12-17 02:49:58,827 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 02:49:58,827 INFO L514 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] [2021-12-17 02:49:58,827 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-12-17 02:49:58,828 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 02:49:58,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 02:49:58,828 INFO L85 PathProgramCache]: Analyzing trace with hash -1173355825, now seen corresponding path program 1 times [2021-12-17 02:49:58,828 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 02:49:58,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477793822] [2021-12-17 02:49:58,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 02:49:58,828 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 02:49:58,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:49:58,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-17 02:49:58,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:49:58,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 02:49:58,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:49:58,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-17 02:49:58,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:49:58,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 02:49:58,862 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 02:49:58,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477793822] [2021-12-17 02:49:58,862 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477793822] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 02:49:58,862 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 02:49:58,863 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-17 02:49:58,863 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590045100] [2021-12-17 02:49:58,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 02:49:58,863 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-17 02:49:58,863 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 02:49:58,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-17 02:49:58,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-17 02:49:58,864 INFO L87 Difference]: Start difference. First operand 115 states and 126 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 3 states have internal predecessors, (42), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-17 02:49:58,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 02:49:58,900 INFO L93 Difference]: Finished difference Result 136 states and 151 transitions. [2021-12-17 02:49:58,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-17 02:49:58,901 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 3 states have internal predecessors, (42), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 49 [2021-12-17 02:49:58,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 02:49:58,901 INFO L225 Difference]: With dead ends: 136 [2021-12-17 02:49:58,901 INFO L226 Difference]: Without dead ends: 108 [2021-12-17 02:49:58,902 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-12-17 02:49:58,902 INFO L933 BasicCegarLoop]: 61 mSDtfsCounter, 36 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 02:49:58,902 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 156 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 02:49:58,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2021-12-17 02:49:58,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2021-12-17 02:49:58,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 93 states have (on average 1.086021505376344) internal successors, (101), 93 states have internal predecessors, (101), 8 states have call successors, (8), 8 states have call predecessors, (8), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-17 02:49:58,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 115 transitions. [2021-12-17 02:49:58,906 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 115 transitions. Word has length 49 [2021-12-17 02:49:58,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 02:49:58,907 INFO L470 AbstractCegarLoop]: Abstraction has 108 states and 115 transitions. [2021-12-17 02:49:58,907 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 3 states have internal predecessors, (42), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-17 02:49:58,907 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 115 transitions. [2021-12-17 02:49:58,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-12-17 02:49:58,907 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 02:49:58,908 INFO L514 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] [2021-12-17 02:49:58,908 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-12-17 02:49:58,908 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 02:49:58,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 02:49:58,908 INFO L85 PathProgramCache]: Analyzing trace with hash -370766040, now seen corresponding path program 1 times [2021-12-17 02:49:58,908 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 02:49:58,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065317001] [2021-12-17 02:49:58,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 02:49:58,909 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 02:49:58,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:49:58,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-17 02:49:58,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:49:58,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 02:49:58,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:49:58,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-17 02:49:58,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:49:58,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 02:49:58,956 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 02:49:58,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065317001] [2021-12-17 02:49:58,956 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065317001] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 02:49:58,956 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 02:49:58,957 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-17 02:49:58,957 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99780839] [2021-12-17 02:49:58,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 02:49:58,957 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-17 02:49:58,957 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 02:49:58,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-17 02:49:58,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-12-17 02:49:58,958 INFO L87 Difference]: Start difference. First operand 108 states and 115 transitions. Second operand has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 5 states have internal predecessors, (42), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2021-12-17 02:49:59,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 02:49:59,005 INFO L93 Difference]: Finished difference Result 115 states and 121 transitions. [2021-12-17 02:49:59,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-17 02:49:59,005 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 5 states have internal predecessors, (42), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 50 [2021-12-17 02:49:59,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 02:49:59,006 INFO L225 Difference]: With dead ends: 115 [2021-12-17 02:49:59,006 INFO L226 Difference]: Without dead ends: 108 [2021-12-17 02:49:59,006 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-12-17 02:49:59,006 INFO L933 BasicCegarLoop]: 55 mSDtfsCounter, 37 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 02:49:59,007 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 296 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 02:49:59,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2021-12-17 02:49:59,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2021-12-17 02:49:59,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 93 states have (on average 1.064516129032258) internal successors, (99), 93 states have internal predecessors, (99), 8 states have call successors, (8), 8 states have call predecessors, (8), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-17 02:49:59,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 113 transitions. [2021-12-17 02:49:59,020 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 113 transitions. Word has length 50 [2021-12-17 02:49:59,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 02:49:59,020 INFO L470 AbstractCegarLoop]: Abstraction has 108 states and 113 transitions. [2021-12-17 02:49:59,020 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 5 states have internal predecessors, (42), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2021-12-17 02:49:59,021 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 113 transitions. [2021-12-17 02:49:59,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-12-17 02:49:59,021 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 02:49:59,021 INFO L514 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] [2021-12-17 02:49:59,021 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-12-17 02:49:59,021 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 02:49:59,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 02:49:59,022 INFO L85 PathProgramCache]: Analyzing trace with hash 1197751707, now seen corresponding path program 1 times [2021-12-17 02:49:59,022 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 02:49:59,022 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326094327] [2021-12-17 02:49:59,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 02:49:59,022 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 02:49:59,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:49:59,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-17 02:49:59,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:49:59,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 02:49:59,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:49:59,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-17 02:49:59,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:49:59,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 02:49:59,081 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 02:49:59,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326094327] [2021-12-17 02:49:59,081 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326094327] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 02:49:59,081 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 02:49:59,081 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-17 02:49:59,081 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401401273] [2021-12-17 02:49:59,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 02:49:59,082 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-17 02:49:59,082 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 02:49:59,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-17 02:49:59,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-12-17 02:49:59,082 INFO L87 Difference]: Start difference. First operand 108 states and 113 transitions. Second operand has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2021-12-17 02:49:59,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 02:49:59,132 INFO L93 Difference]: Finished difference Result 119 states and 124 transitions. [2021-12-17 02:49:59,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-17 02:49:59,132 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 51 [2021-12-17 02:49:59,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 02:49:59,133 INFO L225 Difference]: With dead ends: 119 [2021-12-17 02:49:59,133 INFO L226 Difference]: Without dead ends: 108 [2021-12-17 02:49:59,133 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-12-17 02:49:59,134 INFO L933 BasicCegarLoop]: 55 mSDtfsCounter, 37 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 02:49:59,134 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 296 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 02:49:59,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2021-12-17 02:49:59,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2021-12-17 02:49:59,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 93 states have (on average 1.043010752688172) internal successors, (97), 93 states have internal predecessors, (97), 8 states have call successors, (8), 8 states have call predecessors, (8), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-17 02:49:59,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 111 transitions. [2021-12-17 02:49:59,138 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 111 transitions. Word has length 51 [2021-12-17 02:49:59,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 02:49:59,138 INFO L470 AbstractCegarLoop]: Abstraction has 108 states and 111 transitions. [2021-12-17 02:49:59,139 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2021-12-17 02:49:59,139 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 111 transitions. [2021-12-17 02:49:59,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-12-17 02:49:59,139 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 02:49:59,139 INFO L514 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] [2021-12-17 02:49:59,140 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-12-17 02:49:59,140 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 02:49:59,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 02:49:59,140 INFO L85 PathProgramCache]: Analyzing trace with hash 1206267035, now seen corresponding path program 1 times [2021-12-17 02:49:59,140 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 02:49:59,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710828215] [2021-12-17 02:49:59,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 02:49:59,141 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 02:49:59,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:49:59,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-17 02:49:59,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:49:59,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 02:49:59,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:49:59,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-17 02:49:59,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:49:59,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 02:49:59,174 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 02:49:59,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710828215] [2021-12-17 02:49:59,174 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710828215] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 02:49:59,174 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 02:49:59,174 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-17 02:49:59,174 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160245564] [2021-12-17 02:49:59,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 02:49:59,175 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-17 02:49:59,175 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 02:49:59,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-17 02:49:59,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-17 02:49:59,176 INFO L87 Difference]: Start difference. First operand 108 states and 111 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 3 states have internal predecessors, (50), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2021-12-17 02:49:59,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 02:49:59,198 INFO L93 Difference]: Finished difference Result 108 states and 111 transitions. [2021-12-17 02:49:59,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-17 02:49:59,199 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 3 states have internal predecessors, (50), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 58 [2021-12-17 02:49:59,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 02:49:59,199 INFO L225 Difference]: With dead ends: 108 [2021-12-17 02:49:59,199 INFO L226 Difference]: Without dead ends: 0 [2021-12-17 02:49:59,199 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-17 02:49:59,200 INFO L933 BasicCegarLoop]: 42 mSDtfsCounter, 10 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 02:49:59,200 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 116 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 02:49:59,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-12-17 02:49:59,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-12-17 02:49:59,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 02:49:59,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-12-17 02:49:59,201 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 58 [2021-12-17 02:49:59,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 02:49:59,201 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-12-17 02:49:59,201 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 3 states have internal predecessors, (50), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2021-12-17 02:49:59,201 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-12-17 02:49:59,201 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-12-17 02:49:59,203 INFO L764 garLoopResultBuilder]: Registering result SAFE for location errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-17 02:49:59,204 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-12-17 02:49:59,205 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-12-17 02:50:01,115 INFO L854 garLoopResultBuilder]: At program point KbFilter_CompleteENTRY(lines 618 628) the Hoare annotation is: (or (= ~SKIP2~0 2) (not (<= 5 ~MPR1~0)) (not (= ~s~0 ~NP~0)) (not (= ~DC~0 2)) (= 1 ~pended~0) (= ~IPC~0 2) (not (= ~NP~0 1)) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~MPR3~0 1) (not (= 1 ~compRegistered~0)) (= ~SKIP1~0 ~NP~0)) [2021-12-17 02:50:01,115 INFO L854 garLoopResultBuilder]: At program point L573(lines 568 575) the Hoare annotation is: (or (= ~SKIP2~0 2) (not (<= 5 ~MPR1~0)) (not (= ~s~0 ~NP~0)) (not (= ~DC~0 2)) (= 1 ~pended~0) (= ~IPC~0 2) (not (= ~NP~0 1)) (= ~MPR3~0 1) (= ~setEventCalled~0 1) (not (= 1 ~compRegistered~0)) (= ~SKIP1~0 ~NP~0)) [2021-12-17 02:50:01,115 INFO L858 garLoopResultBuilder]: For program point KbFilter_CompleteFINAL(lines 618 628) no Hoare annotation was computed. [2021-12-17 02:50:01,115 INFO L858 garLoopResultBuilder]: For program point KbFilter_CompleteEXIT(lines 618 628) no Hoare annotation was computed. [2021-12-17 02:50:01,115 INFO L858 garLoopResultBuilder]: For program point L638(lines 638 656) no Hoare annotation was computed. [2021-12-17 02:50:01,116 INFO L858 garLoopResultBuilder]: For program point KbFilter_CreateCloseEXIT(lines 629 664) no Hoare annotation was computed. [2021-12-17 02:50:01,116 INFO L854 garLoopResultBuilder]: At program point L653(lines 641 655) the Hoare annotation is: (or (= ~SKIP2~0 2) (not (= ~DC~0 2)) (= 1 ~pended~0) (= ~IPC~0 2) (not (= |old(~s~0)| ~NP~0)) (and (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 ~NP~0)) (not (= ~compRegistered~0 0)) (= ~SKIP1~0 ~NP~0)) [2021-12-17 02:50:01,116 INFO L854 garLoopResultBuilder]: At program point L645(lines 638 656) the Hoare annotation is: (or (= ~SKIP2~0 2) (not (= ~DC~0 2)) (= 1 ~pended~0) (= ~IPC~0 2) (not (= |old(~s~0)| ~NP~0)) (and (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 ~NP~0)) (not (= ~compRegistered~0 0)) (= ~SKIP1~0 ~NP~0)) [2021-12-17 02:50:01,116 INFO L858 garLoopResultBuilder]: For program point L641(lines 641 655) no Hoare annotation was computed. [2021-12-17 02:50:01,116 INFO L854 garLoopResultBuilder]: At program point KbFilter_CreateCloseENTRY(lines 629 664) the Hoare annotation is: (or (= ~SKIP2~0 2) (not (= ~DC~0 2)) (= 1 ~pended~0) (= ~IPC~0 2) (not (= |old(~s~0)| ~NP~0)) (and (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 ~NP~0)) (not (= ~compRegistered~0 0)) (= ~SKIP1~0 ~NP~0)) [2021-12-17 02:50:01,116 INFO L854 garLoopResultBuilder]: At program point L660(line 660) the Hoare annotation is: (or (= ~SKIP2~0 2) (not (= ~DC~0 2)) (= 1 ~pended~0) (= ~IPC~0 2) (not (= |old(~s~0)| ~NP~0)) (and (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 ~NP~0)) (not (= ~compRegistered~0 0)) (= ~SKIP1~0 ~NP~0)) [2021-12-17 02:50:01,116 INFO L858 garLoopResultBuilder]: For program point L660-1(line 660) no Hoare annotation was computed. [2021-12-17 02:50:01,117 INFO L858 garLoopResultBuilder]: For program point KbFilter_CreateCloseFINAL(lines 629 664) no Hoare annotation was computed. [2021-12-17 02:50:01,117 INFO L858 garLoopResultBuilder]: For program point L644(lines 644 654) no Hoare annotation was computed. [2021-12-17 02:50:01,117 INFO L858 garLoopResultBuilder]: For program point L562-1(lines 554 567) no Hoare annotation was computed. [2021-12-17 02:50:01,117 INFO L858 garLoopResultBuilder]: For program point L558(lines 558 564) no Hoare annotation was computed. [2021-12-17 02:50:01,117 INFO L854 garLoopResultBuilder]: At program point IofCompleteRequestENTRY(lines 554 567) the Hoare annotation is: (let ((.cse0 (= ~SKIP2~0 2)) (.cse1 (not (= ~DC~0 2))) (.cse2 (= 1 ~pended~0)) (.cse3 (= ~IPC~0 2)) (.cse4 (not (= |old(~s~0)| ~NP~0))) (.cse5 (= ~s~0 ~NP~0)) (.cse6 (= ~SKIP1~0 ~NP~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (not (= ~compRegistered~0 0)) .cse5 .cse6) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= 1 ~compRegistered~0)) .cse6))) [2021-12-17 02:50:01,117 INFO L858 garLoopResultBuilder]: For program point IofCompleteRequestEXIT(lines 554 567) no Hoare annotation was computed. [2021-12-17 02:50:01,117 INFO L854 garLoopResultBuilder]: At program point L562(line 562) the Hoare annotation is: (let ((.cse0 (= ~SKIP2~0 2)) (.cse1 (not (= ~DC~0 2))) (.cse2 (= 1 ~pended~0)) (.cse3 (= ~IPC~0 2)) (.cse4 (not (= |old(~s~0)| ~NP~0))) (.cse5 (= ~SKIP1~0 ~NP~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (not (= 1 ~compRegistered~0)) .cse5) (or .cse0 .cse1 .cse2 .cse3 .cse4 (not (= ~compRegistered~0 0)) .cse5))) [2021-12-17 02:50:01,117 INFO L861 garLoopResultBuilder]: At program point errorFnENTRY(lines 1009 1016) the Hoare annotation is: true [2021-12-17 02:50:01,118 INFO L858 garLoopResultBuilder]: For program point errorFnFINAL(lines 1009 1016) no Hoare annotation was computed. [2021-12-17 02:50:01,118 INFO L858 garLoopResultBuilder]: For program point errorFnEXIT(lines 1009 1016) no Hoare annotation was computed. [2021-12-17 02:50:01,118 INFO L858 garLoopResultBuilder]: For program point errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION(line 1013) no Hoare annotation was computed. [2021-12-17 02:50:01,118 INFO L854 garLoopResultBuilder]: At program point L762(line 762) the Hoare annotation is: false [2021-12-17 02:50:01,118 INFO L858 garLoopResultBuilder]: For program point L432(lines 432 459) no Hoare annotation was computed. [2021-12-17 02:50:01,118 INFO L858 garLoopResultBuilder]: For program point L168(lines 168 271) no Hoare annotation was computed. [2021-12-17 02:50:01,118 INFO L858 garLoopResultBuilder]: For program point L135(lines 135 282) no Hoare annotation was computed. [2021-12-17 02:50:01,118 INFO L858 garLoopResultBuilder]: For program point L433(lines 433 439) no Hoare annotation was computed. [2021-12-17 02:50:01,118 INFO L858 garLoopResultBuilder]: For program point L896(lines 896 984) no Hoare annotation was computed. [2021-12-17 02:50:01,119 INFO L858 garLoopResultBuilder]: For program point L797(lines 797 817) no Hoare annotation was computed. [2021-12-17 02:50:01,119 INFO L858 garLoopResultBuilder]: For program point L434(lines 434 436) no Hoare annotation was computed. [2021-12-17 02:50:01,119 INFO L858 garLoopResultBuilder]: For program point L368(lines 368 409) no Hoare annotation was computed. [2021-12-17 02:50:01,119 INFO L854 garLoopResultBuilder]: At program point L269(lines 172 270) the Hoare annotation is: (let ((.cse0 (not (= ~IPC~0 2))) (.cse1 (not (= ~SKIP2~0 2))) (.cse2 (not (= 1 ~pended~0))) (.cse3 (= |ULTIMATE.start_main_~status~1#1| 0)) (.cse4 (not (= ~SKIP1~0 ~NP~0))) (.cse5 (= ~DC~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 (<= ~compRegistered~0 0) .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse3 (= 1 ~compRegistered~0) .cse4 .cse5 (= ~s~0 2)))) [2021-12-17 02:50:01,119 INFO L854 garLoopResultBuilder]: At program point L369(lines 368 409) the Hoare annotation is: (and (not (= ~IPC~0 2)) (not (= ~SKIP2~0 2)) (not (= 1 ~pended~0)) (= ~compRegistered~0 0) (= |ULTIMATE.start_main_~status~1#1| 0) (not (= ~SKIP1~0 ~NP~0)) (= ~s~0 ~NP~0) (= ~DC~0 2)) [2021-12-17 02:50:01,119 INFO L854 garLoopResultBuilder]: At program point L171(lines 117 288) the Hoare annotation is: (and (not (= ~IPC~0 2)) (not (= ~SKIP2~0 2)) (not (= 1 ~pended~0)) (= ~compRegistered~0 0) (= |ULTIMATE.start_main_~status~1#1| 0) (not (= ~SKIP1~0 ~NP~0)) (= ~s~0 ~NP~0) (= ~DC~0 2)) [2021-12-17 02:50:01,119 INFO L858 garLoopResultBuilder]: For program point L138(lines 138 281) no Hoare annotation was computed. [2021-12-17 02:50:01,119 INFO L854 garLoopResultBuilder]: At program point L997(line 997) the Hoare annotation is: (and (not (= ~IPC~0 2)) (not (= ~SKIP2~0 2)) (not (= 1 ~pended~0)) (= ~compRegistered~0 0) (= |ULTIMATE.start_main_~status~1#1| 0) (not (= ~SKIP1~0 ~NP~0)) (= ~s~0 ~NP~0) (= ~DC~0 2)) [2021-12-17 02:50:01,119 INFO L858 garLoopResultBuilder]: For program point L997-1(line 997) no Hoare annotation was computed. [2021-12-17 02:50:01,120 INFO L858 garLoopResultBuilder]: For program point L931(lines 931 974) no Hoare annotation was computed. [2021-12-17 02:50:01,120 INFO L858 garLoopResultBuilder]: For program point L700(lines 700 729) no Hoare annotation was computed. [2021-12-17 02:50:01,120 INFO L858 garLoopResultBuilder]: For program point L800(lines 800 806) no Hoare annotation was computed. [2021-12-17 02:50:01,120 INFO L854 garLoopResultBuilder]: At program point L734(line 734) the Hoare annotation is: false [2021-12-17 02:50:01,120 INFO L854 garLoopResultBuilder]: At program point L701(lines 700 729) the Hoare annotation is: (and (not (= ~IPC~0 2)) (not (= ~SKIP2~0 2)) (not (= 1 ~pended~0)) (= ~compRegistered~0 0) (= |ULTIMATE.start_main_~status~1#1| 0) (not (= ~SKIP1~0 ~NP~0)) (= ~s~0 ~NP~0) (= ~DC~0 2)) [2021-12-17 02:50:01,120 INFO L858 garLoopResultBuilder]: For program point L734-1(lines 730 736) no Hoare annotation was computed. [2021-12-17 02:50:01,120 INFO L858 garLoopResultBuilder]: For program point L239(lines 239 245) no Hoare annotation was computed. [2021-12-17 02:50:01,120 INFO L858 garLoopResultBuilder]: For program point L603(lines 603 615) no Hoare annotation was computed. [2021-12-17 02:50:01,120 INFO L858 garLoopResultBuilder]: For program point L339(lines 339 342) no Hoare annotation was computed. [2021-12-17 02:50:01,121 INFO L858 garLoopResultBuilder]: For program point L339-2(lines 339 342) no Hoare annotation was computed. [2021-12-17 02:50:01,121 INFO L858 garLoopResultBuilder]: For program point L207(lines 207 213) no Hoare annotation was computed. [2021-12-17 02:50:01,121 INFO L858 garLoopResultBuilder]: For program point L141(lines 141 280) no Hoare annotation was computed. [2021-12-17 02:50:01,121 INFO L858 garLoopResultBuilder]: For program point L108(lines 108 291) no Hoare annotation was computed. [2021-12-17 02:50:01,121 INFO L858 garLoopResultBuilder]: For program point L934(lines 934 973) no Hoare annotation was computed. [2021-12-17 02:50:01,121 INFO L858 garLoopResultBuilder]: For program point L769(lines 769 792) no Hoare annotation was computed. [2021-12-17 02:50:01,121 INFO L858 garLoopResultBuilder]: For program point L703(lines 703 728) no Hoare annotation was computed. [2021-12-17 02:50:01,121 INFO L854 garLoopResultBuilder]: At program point L604(lines 603 615) the Hoare annotation is: (and (not (= ~IPC~0 2)) (not (= ~SKIP2~0 2)) (not (= 1 ~pended~0)) (= |ULTIMATE.start_main_~status~1#1| 0) (= 1 ~compRegistered~0) (not (= ~SKIP1~0 ~NP~0)) (= ~s~0 ~NP~0) (= ~DC~0 2)) [2021-12-17 02:50:01,121 INFO L858 garLoopResultBuilder]: For program point L373(lines 373 408) no Hoare annotation was computed. [2021-12-17 02:50:01,122 INFO L858 garLoopResultBuilder]: For program point L208(lines 208 212) no Hoare annotation was computed. [2021-12-17 02:50:01,122 INFO L854 garLoopResultBuilder]: At program point L109(lines 108 291) the Hoare annotation is: (and (not (= ~IPC~0 2)) (not (= ~SKIP2~0 2)) (not (= 1 ~pended~0)) (not (= ~MPR3~0 1)) (= ~compRegistered~0 0) (<= 5 ~MPR1~0) (= |ULTIMATE.start_main_~status~1#1| 0) (= |ULTIMATE.start_KbFilter_PnP_~status~0#1| 0) (not (= ~SKIP1~0 ~NP~0)) (= ~s~0 1) (= ~NP~0 1) (= ~DC~0 2)) [2021-12-17 02:50:01,122 INFO L854 garLoopResultBuilder]: At program point L76(lines 57 78) the Hoare annotation is: (and (not (= ~IPC~0 2)) (not (= ~SKIP2~0 2)) (not (= 1 ~pended~0)) (not (= ~s~0 ~NP~0)) (not (= ~MPR3~0 1)) (not (= ~MPR3~0 ~s~0)) (= ~compRegistered~0 0) (<= 5 ~MPR1~0) (= |ULTIMATE.start_main_~status~1#1| 0) (not (= ~SKIP1~0 ~NP~0)) (= ~NP~0 1) (= ~DC~0 2)) [2021-12-17 02:50:01,122 INFO L854 garLoopResultBuilder]: At program point L935(lines 875 990) the Hoare annotation is: (and (not (= ~IPC~0 2)) (not (= ~SKIP2~0 2)) (not (= 1 ~pended~0)) (= ~compRegistered~0 0) (= |ULTIMATE.start_main_~status~1#1| 0) (not (= ~SKIP1~0 ~NP~0)) (= ~s~0 ~NP~0) (= ~DC~0 2)) [2021-12-17 02:50:01,122 INFO L854 garLoopResultBuilder]: At program point L770(lines 769 792) the Hoare annotation is: (and (not (= ~IPC~0 2)) (not (= ~SKIP2~0 2)) (not (= 1 ~pended~0)) (= ~compRegistered~0 0) (= |ULTIMATE.start_main_~status~1#1| 0) (= ~s~0 ~SKIP1~0) (not (= ~SKIP1~0 ~NP~0)) (= ~DC~0 2)) [2021-12-17 02:50:01,122 INFO L854 garLoopResultBuilder]: At program point L374(lines 373 408) the Hoare annotation is: (and (not (= ~IPC~0 2)) (not (= ~SKIP2~0 2)) (not (= 1 ~pended~0)) (= ~compRegistered~0 0) (= |ULTIMATE.start_main_~status~1#1| 0) (not (= ~SKIP1~0 ~NP~0)) (= ~s~0 ~NP~0) (= ~DC~0 2)) [2021-12-17 02:50:01,122 INFO L858 garLoopResultBuilder]: For program point L903(lines 903 982) no Hoare annotation was computed. [2021-12-17 02:50:01,122 INFO L854 garLoopResultBuilder]: At program point L606(lines 605 615) the Hoare annotation is: (and (not (= ~IPC~0 2)) (not (= ~SKIP2~0 2)) (not (= 1 ~pended~0)) (= |ULTIMATE.start_main_~status~1#1| 0) (= 1 ~compRegistered~0) (not (= ~SKIP1~0 ~NP~0)) (= ~s~0 ~NP~0) (= ~DC~0 2)) [2021-12-17 02:50:01,123 INFO L854 garLoopResultBuilder]: At program point L441(lines 432 459) the Hoare annotation is: (and (not (= 1 ~pended~0)) (let ((.cse0 (not (= ~IPC~0 2))) (.cse1 (not (= ~SKIP2~0 2))) (.cse2 (= ~DC~0 2))) (or (and .cse0 .cse1 (<= ~compRegistered~0 0) .cse2) (and .cse0 .cse1 (= 1 ~compRegistered~0) .cse2))) (not (= ~SKIP1~0 ~NP~0))) [2021-12-17 02:50:01,123 INFO L854 garLoopResultBuilder]: At program point L243(line 243) the Hoare annotation is: false [2021-12-17 02:50:01,123 INFO L858 garLoopResultBuilder]: For program point L243-1(lines 239 245) no Hoare annotation was computed. [2021-12-17 02:50:01,123 INFO L858 garLoopResultBuilder]: For program point L177(lines 177 189) no Hoare annotation was computed. [2021-12-17 02:50:01,123 INFO L858 garLoopResultBuilder]: For program point L144(lines 144 279) no Hoare annotation was computed. [2021-12-17 02:50:01,123 INFO L858 garLoopResultBuilder]: For program point L111(lines 111 290) no Hoare annotation was computed. [2021-12-17 02:50:01,123 INFO L854 garLoopResultBuilder]: At program point L1003(line 1003) the Hoare annotation is: (and (not (= ~IPC~0 2)) (not (= ~SKIP2~0 2)) (not (= 1 ~pended~0)) (= ~compRegistered~0 0) (= |ULTIMATE.start_main_~status~1#1| 0) (not (= ~SKIP1~0 ~NP~0)) (= ~s~0 ~NP~0) (= ~DC~0 2)) [2021-12-17 02:50:01,123 INFO L858 garLoopResultBuilder]: For program point L1003-1(line 1003) no Hoare annotation was computed. [2021-12-17 02:50:01,123 INFO L858 garLoopResultBuilder]: For program point L706(lines 706 727) no Hoare annotation was computed. [2021-12-17 02:50:01,124 INFO L854 garLoopResultBuilder]: At program point L376(lines 375 408) the Hoare annotation is: (= |ULTIMATE.start_main_~status~1#1| 0) [2021-12-17 02:50:01,124 INFO L854 garLoopResultBuilder]: At program point L112(lines 111 290) the Hoare annotation is: (and (not (= ~IPC~0 2)) (not (= ~SKIP2~0 2)) (not (= 1 ~pended~0)) (= ~compRegistered~0 0) (= |ULTIMATE.start_main_~status~1#1| 0) (not (= ~SKIP1~0 ~NP~0)) (= ~s~0 ~NP~0) (= ~DC~0 2)) [2021-12-17 02:50:01,124 INFO L858 garLoopResultBuilder]: For program point L443(lines 443 447) no Hoare annotation was computed. [2021-12-17 02:50:01,124 INFO L854 garLoopResultBuilder]: At program point L179(line 179) the Hoare annotation is: false [2021-12-17 02:50:01,124 INFO L854 garLoopResultBuilder]: At program point L1005(lines 822 1007) the Hoare annotation is: (and (not (= ~IPC~0 2)) (not (= ~SKIP2~0 2)) (not (= 1 ~pended~0)) (= ~compRegistered~0 0) (= |ULTIMATE.start_main_~status~1#1| 0) (not (= ~SKIP1~0 ~NP~0)) (= ~DC~0 2)) [2021-12-17 02:50:01,124 INFO L854 garLoopResultBuilder]: At program point L972(lines 867 1006) the Hoare annotation is: (and (not (= ~IPC~0 2)) (not (= ~SKIP2~0 2)) (not (= 1 ~pended~0)) (= ~compRegistered~0 0) (= |ULTIMATE.start_main_~status~1#1| 0) (not (= ~SKIP1~0 ~NP~0)) (= ~s~0 ~NP~0) (= ~DC~0 2)) [2021-12-17 02:50:01,124 INFO L858 garLoopResultBuilder]: For program point L774(lines 774 791) no Hoare annotation was computed. [2021-12-17 02:50:01,124 INFO L854 garLoopResultBuilder]: At program point L576(lines 576 617) the Hoare annotation is: (and (not (= ~IPC~0 2)) (not (= ~SKIP2~0 2)) (not (= 1 ~pended~0)) (= |ULTIMATE.start_main_~status~1#1| 0) (= 1 ~compRegistered~0) (not (= ~SKIP1~0 ~NP~0)) (= ~s~0 ~NP~0) (= ~DC~0 2)) [2021-12-17 02:50:01,124 INFO L858 garLoopResultBuilder]: For program point L147(lines 147 278) no Hoare annotation was computed. [2021-12-17 02:50:01,125 INFO L858 garLoopResultBuilder]: For program point L114(lines 114 289) no Hoare annotation was computed. [2021-12-17 02:50:01,125 INFO L858 garLoopResultBuilder]: For program point L940(lines 940 943) no Hoare annotation was computed. [2021-12-17 02:50:01,125 INFO L854 garLoopResultBuilder]: At program point L775(lines 774 791) the Hoare annotation is: (and (not (= ~IPC~0 2)) (not (= ~SKIP2~0 2)) (not (= 1 ~pended~0)) (= ~compRegistered~0 0) (= |ULTIMATE.start_main_~status~1#1| 0) (= ~s~0 ~SKIP1~0) (not (= ~SKIP1~0 ~NP~0)) (= ~DC~0 2)) [2021-12-17 02:50:01,125 INFO L854 garLoopResultBuilder]: At program point L742(lines 689 744) the Hoare annotation is: (and (not (= ~IPC~0 2)) (not (= ~SKIP2~0 2)) (not (= 1 ~pended~0)) (= ~compRegistered~0 0) (= |ULTIMATE.start_main_~status~1#1| 0) (not (= ~SKIP1~0 ~NP~0)) (= ~DC~0 2)) [2021-12-17 02:50:01,125 INFO L858 garLoopResultBuilder]: For program point L709(lines 709 726) no Hoare annotation was computed. [2021-12-17 02:50:01,125 INFO L854 garLoopResultBuilder]: At program point L445(line 445) the Hoare annotation is: false [2021-12-17 02:50:01,125 INFO L854 garLoopResultBuilder]: At program point L115(lines 114 289) the Hoare annotation is: (and (not (= ~IPC~0 2)) (not (= ~SKIP2~0 2)) (not (= 1 ~pended~0)) (= ~compRegistered~0 0) (= |ULTIMATE.start_main_~status~1#1| 0) (not (= ~SKIP1~0 ~NP~0)) (= ~s~0 ~NP~0) (= ~DC~0 2)) [2021-12-17 02:50:01,125 INFO L858 garLoopResultBuilder]: For program point L875(lines 875 990) no Hoare annotation was computed. [2021-12-17 02:50:01,125 INFO L858 garLoopResultBuilder]: For program point L809(lines 809 816) no Hoare annotation was computed. [2021-12-17 02:50:01,126 INFO L858 garLoopResultBuilder]: For program point L380(line 380) no Hoare annotation was computed. [2021-12-17 02:50:01,126 INFO L858 garLoopResultBuilder]: For program point L347(lines 347 349) no Hoare annotation was computed. [2021-12-17 02:50:01,126 INFO L858 garLoopResultBuilder]: For program point L182(lines 182 188) no Hoare annotation was computed. [2021-12-17 02:50:01,126 INFO L858 garLoopResultBuilder]: For program point L182-1(lines 177 189) no Hoare annotation was computed. [2021-12-17 02:50:01,126 INFO L854 garLoopResultBuilder]: At program point L777(lines 776 791) the Hoare annotation is: (and (not (= ~IPC~0 2)) (not (= ~SKIP2~0 2)) (not (= 1 ~pended~0)) (= ~compRegistered~0 0) (= |ULTIMATE.start_main_~status~1#1| 0) (= ~s~0 ~SKIP1~0) (not (= ~SKIP1~0 ~NP~0)) (= ~DC~0 2)) [2021-12-17 02:50:01,126 INFO L854 garLoopResultBuilder]: At program point L249(line 249) the Hoare annotation is: (and (not (= ~IPC~0 2)) (not (= ~SKIP2~0 2)) (not (= 1 ~pended~0)) (= ~compRegistered~0 0) (= |ULTIMATE.start_main_~status~1#1| 0) (= ~s~0 ~SKIP1~0) (not (= ~SKIP1~0 ~NP~0)) (= ~DC~0 2)) [2021-12-17 02:50:01,126 INFO L858 garLoopResultBuilder]: For program point L249-1(line 249) no Hoare annotation was computed. [2021-12-17 02:50:01,126 INFO L858 garLoopResultBuilder]: For program point L150(lines 150 277) no Hoare annotation was computed. [2021-12-17 02:50:01,126 INFO L858 garLoopResultBuilder]: For program point L117(lines 117 288) no Hoare annotation was computed. [2021-12-17 02:50:01,127 INFO L858 garLoopResultBuilder]: For program point L910(lines 910 980) no Hoare annotation was computed. [2021-12-17 02:50:01,127 INFO L858 garLoopResultBuilder]: For program point L415(lines 415 419) no Hoare annotation was computed. [2021-12-17 02:50:01,127 INFO L854 garLoopResultBuilder]: At program point L184(line 184) the Hoare annotation is: false [2021-12-17 02:50:01,127 INFO L858 garLoopResultBuilder]: For program point L581(lines 581 600) no Hoare annotation was computed. [2021-12-17 02:50:01,127 INFO L858 garLoopResultBuilder]: For program point L449(lines 449 457) no Hoare annotation was computed. [2021-12-17 02:50:01,127 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-12-17 02:50:01,127 INFO L854 garLoopResultBuilder]: At program point L218(line 218) the Hoare annotation is: (and (not (= ~IPC~0 2)) (not (= ~SKIP2~0 2)) (not (= 1 ~pended~0)) (= |ULTIMATE.start_main_~status~1#1| 0) (= 1 ~compRegistered~0) (not (= ~SKIP1~0 ~NP~0)) (= ~s~0 ~NP~0) (= ~DC~0 2)) [2021-12-17 02:50:01,127 INFO L858 garLoopResultBuilder]: For program point L582(lines 582 587) no Hoare annotation was computed. [2021-12-17 02:50:01,127 INFO L858 garLoopResultBuilder]: For program point L450(lines 450 452) no Hoare annotation was computed. [2021-12-17 02:50:01,128 INFO L858 garLoopResultBuilder]: For program point L153(lines 153 276) no Hoare annotation was computed. [2021-12-17 02:50:01,128 INFO L858 garLoopResultBuilder]: For program point L120(lines 120 287) no Hoare annotation was computed. [2021-12-17 02:50:01,128 INFO L854 garLoopResultBuilder]: At program point L54(lines 43 56) the Hoare annotation is: (and (not (= ~IPC~0 2)) (not (= ~SKIP2~0 2)) (not (= 1 ~pended~0)) (not (= ~MPR3~0 1)) (= ~compRegistered~0 0) (<= 5 ~MPR1~0) (= |ULTIMATE.start_main_~status~1#1| 0) (not (= ~SKIP1~0 ~NP~0)) (= ~s~0 ~NP~0) (= ~NP~0 1) (= ~DC~0 2)) [2021-12-17 02:50:01,128 INFO L854 garLoopResultBuilder]: At program point L814(line 814) the Hoare annotation is: false [2021-12-17 02:50:01,128 INFO L858 garLoopResultBuilder]: For program point L814-1(lines 793 818) no Hoare annotation was computed. [2021-12-17 02:50:01,128 INFO L858 garLoopResultBuilder]: For program point L385(line 385) no Hoare annotation was computed. [2021-12-17 02:50:01,128 INFO L858 garLoopResultBuilder]: For program point L353(lines 353 412) no Hoare annotation was computed. [2021-12-17 02:50:01,128 INFO L854 garLoopResultBuilder]: At program point L354(lines 353 412) the Hoare annotation is: (and (not (= ~IPC~0 2)) (not (= ~SKIP2~0 2)) (not (= 1 ~pended~0)) (= ~compRegistered~0 0) (= |ULTIMATE.start_main_~status~1#1| 0) (not (= ~SKIP1~0 ~NP~0)) (= ~s~0 ~NP~0) (= ~DC~0 2)) [2021-12-17 02:50:01,128 INFO L858 garLoopResultBuilder]: For program point L156(lines 156 275) no Hoare annotation was computed. [2021-12-17 02:50:01,129 INFO L858 garLoopResultBuilder]: For program point L123(lines 123 286) no Hoare annotation was computed. [2021-12-17 02:50:01,129 INFO L858 garLoopResultBuilder]: For program point L883(lines 883 988) no Hoare annotation was computed. [2021-12-17 02:50:01,129 INFO L858 garLoopResultBuilder]: For program point L454(lines 454 456) no Hoare annotation was computed. [2021-12-17 02:50:01,129 INFO L854 garLoopResultBuilder]: At program point L421(lines 414 463) the Hoare annotation is: (let ((.cse0 (not (= ~IPC~0 2))) (.cse1 (not (= 1 ~pended~0))) (.cse2 (not (= ~SKIP2~0 2))) (.cse3 (not (= ~SKIP1~0 ~NP~0))) (.cse4 (= ~DC~0 2))) (or (and .cse0 .cse1 .cse2 (<= ~compRegistered~0 0) .cse3 .cse4) (and .cse0 .cse1 .cse2 (= 1 ~compRegistered~0) .cse3 .cse4 (= ~s~0 2)))) [2021-12-17 02:50:01,129 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-12-17 02:50:01,129 INFO L858 garLoopResultBuilder]: For program point L223(lines 223 229) no Hoare annotation was computed. [2021-12-17 02:50:01,129 INFO L858 garLoopResultBuilder]: For program point L917(lines 917 978) no Hoare annotation was computed. [2021-12-17 02:50:01,129 INFO L854 garLoopResultBuilder]: At program point L884(lines 883 988) the Hoare annotation is: (and (not (= ~IPC~0 2)) (not (= ~SKIP2~0 2)) (not (= 1 ~pended~0)) (= ~compRegistered~0 0) (= |ULTIMATE.start_main_~status~1#1| 0) (not (= ~SKIP1~0 ~NP~0)) (= ~s~0 ~NP~0) (= ~DC~0 2)) [2021-12-17 02:50:01,129 INFO L854 garLoopResultBuilder]: At program point L819(lines 745 821) the Hoare annotation is: (and (not (= ~IPC~0 2)) (not (= ~SKIP2~0 2)) (not (= 1 ~pended~0)) (= ~compRegistered~0 0) (= |ULTIMATE.start_main_~status~1#1| 0) (not (= ~SKIP1~0 ~NP~0)) (= ~DC~0 2)) [2021-12-17 02:50:01,130 INFO L858 garLoopResultBuilder]: For program point L423(lines 423 427) no Hoare annotation was computed. [2021-12-17 02:50:01,130 INFO L854 garLoopResultBuilder]: At program point L258(line 258) the Hoare annotation is: false [2021-12-17 02:50:01,130 INFO L858 garLoopResultBuilder]: For program point L258-1(lines 254 260) no Hoare annotation was computed. [2021-12-17 02:50:01,130 INFO L858 garLoopResultBuilder]: For program point L159(lines 159 274) no Hoare annotation was computed. [2021-12-17 02:50:01,130 INFO L858 garLoopResultBuilder]: For program point L126(lines 126 285) no Hoare annotation was computed. [2021-12-17 02:50:01,130 INFO L858 garLoopResultBuilder]: For program point L754(lines 754 766) no Hoare annotation was computed. [2021-12-17 02:50:01,130 INFO L858 garLoopResultBuilder]: For program point L754-1(lines 754 766) no Hoare annotation was computed. [2021-12-17 02:50:01,130 INFO L854 garLoopResultBuilder]: At program point L589(lines 581 600) the Hoare annotation is: (and (not (= ~IPC~0 2)) (not (= ~SKIP2~0 2)) (not (= 1 ~pended~0)) (not (= ~MPR3~0 ~s~0)) (= |ULTIMATE.start_main_~status~1#1| 0) (= 1 ~compRegistered~0) (not (= ~SKIP1~0 ~NP~0)) (= ~s~0 ~NP~0) (= ~DC~0 2)) [2021-12-17 02:50:01,130 INFO L858 garLoopResultBuilder]: For program point L358(lines 358 411) no Hoare annotation was computed. [2021-12-17 02:50:01,131 INFO L854 garLoopResultBuilder]: At program point L292(lines 81 294) the Hoare annotation is: (let ((.cse0 (not (= ~IPC~0 2))) (.cse1 (not (= ~SKIP2~0 2))) (.cse2 (not (= 1 ~pended~0))) (.cse3 (= |ULTIMATE.start_main_~status~1#1| 0)) (.cse4 (not (= ~SKIP1~0 ~NP~0))) (.cse5 (= ~DC~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 (<= ~compRegistered~0 0) .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse3 (= 1 ~compRegistered~0) .cse4 .cse5 (= ~s~0 2)))) [2021-12-17 02:50:01,131 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-12-17 02:50:01,131 INFO L854 garLoopResultBuilder]: At program point L359(lines 358 411) the Hoare annotation is: (and (not (= ~IPC~0 2)) (not (= ~SKIP2~0 2)) (not (= 1 ~pended~0)) (= ~compRegistered~0 0) (= |ULTIMATE.start_main_~status~1#1| 0) (not (= ~SKIP1~0 ~NP~0)) (= ~s~0 ~NP~0) (= ~DC~0 2)) [2021-12-17 02:50:01,131 INFO L854 garLoopResultBuilder]: At program point L227(line 227) the Hoare annotation is: false [2021-12-17 02:50:01,131 INFO L854 garLoopResultBuilder]: At program point L194(lines 194 195) the Hoare annotation is: (and (not (= ~IPC~0 2)) (not (= ~SKIP2~0 2)) (not (= 1 ~pended~0)) (not (= ~MPR3~0 1)) (<= 5 ~MPR1~0) (= |ULTIMATE.start_main_~status~1#1| 0) (= |ULTIMATE.start_KbFilter_PnP_~status~0#1| 0) (= 1 ~compRegistered~0) (not (= ~SKIP1~0 ~NP~0)) (= ~s~0 1) (= ~DC~0 2) (= ~NP~0 1)) [2021-12-17 02:50:01,131 INFO L858 garLoopResultBuilder]: For program point L227-1(lines 223 229) no Hoare annotation was computed. [2021-12-17 02:50:01,131 INFO L858 garLoopResultBuilder]: For program point L194-1(lines 194 195) no Hoare annotation was computed. [2021-12-17 02:50:01,132 INFO L854 garLoopResultBuilder]: At program point L789(lines 753 820) the Hoare annotation is: (and (not (= ~IPC~0 2)) (not (= ~SKIP2~0 2)) (not (= 1 ~pended~0)) (= ~compRegistered~0 0) (= |ULTIMATE.start_main_~status~1#1| 0) (= ~s~0 ~SKIP1~0) (not (= ~SKIP1~0 ~NP~0)) (= ~DC~0 2)) [2021-12-17 02:50:01,132 INFO L854 garLoopResultBuilder]: At program point L756(line 756) the Hoare annotation is: false [2021-12-17 02:50:01,132 INFO L858 garLoopResultBuilder]: For program point L756-1(line 756) no Hoare annotation was computed. [2021-12-17 02:50:01,132 INFO L858 garLoopResultBuilder]: For program point L162(lines 162 273) no Hoare annotation was computed. [2021-12-17 02:50:01,132 INFO L858 garLoopResultBuilder]: For program point L129(lines 129 284) no Hoare annotation was computed. [2021-12-17 02:50:01,132 INFO L854 garLoopResultBuilder]: At program point L724(lines 699 743) the Hoare annotation is: (and (not (= ~IPC~0 2)) (not (= ~SKIP2~0 2)) (not (= 1 ~pended~0)) (= ~compRegistered~0 0) (= |ULTIMATE.start_main_~status~1#1| 0) (not (= ~SKIP1~0 ~NP~0)) (= ~s~0 ~NP~0) (= ~DC~0 2)) [2021-12-17 02:50:01,132 INFO L858 garLoopResultBuilder]: For program point L956(lines 956 958) no Hoare annotation was computed. [2021-12-17 02:50:01,132 INFO L858 garLoopResultBuilder]: For program point L956-2(lines 934 971) no Hoare annotation was computed. [2021-12-17 02:50:01,133 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-12-17 02:50:01,133 INFO L858 garLoopResultBuilder]: For program point L924(lines 924 976) no Hoare annotation was computed. [2021-12-17 02:50:01,133 INFO L858 garLoopResultBuilder]: For program point L891(lines 891 986) no Hoare annotation was computed. [2021-12-17 02:50:01,133 INFO L858 garLoopResultBuilder]: For program point L594(lines 594 598) no Hoare annotation was computed. [2021-12-17 02:50:01,133 INFO L858 garLoopResultBuilder]: For program point L594-1(lines 581 600) no Hoare annotation was computed. [2021-12-17 02:50:01,133 INFO L854 garLoopResultBuilder]: At program point L429(lines 422 462) the Hoare annotation is: (let ((.cse0 (not (= ~IPC~0 2))) (.cse1 (not (= 1 ~pended~0))) (.cse2 (not (= ~SKIP2~0 2))) (.cse3 (not (= ~SKIP1~0 ~NP~0))) (.cse4 (= ~DC~0 2))) (or (and .cse0 .cse1 .cse2 (<= ~compRegistered~0 0) .cse3 .cse4) (and .cse0 .cse1 .cse2 (= 1 ~compRegistered~0) .cse3 .cse4 (= ~s~0 2)))) [2021-12-17 02:50:01,133 INFO L858 garLoopResultBuilder]: For program point L363(lines 363 410) no Hoare annotation was computed. [2021-12-17 02:50:01,133 INFO L858 garLoopResultBuilder]: For program point L330(lines 330 413) no Hoare annotation was computed. [2021-12-17 02:50:01,133 INFO L854 garLoopResultBuilder]: At program point L330-1(lines 324 465) the Hoare annotation is: (let ((.cse0 (not (= ~IPC~0 2))) (.cse2 (not (= ~SKIP2~0 2))) (.cse1 (not (= 1 ~pended~0))) (.cse3 (not (= ~SKIP1~0 ~NP~0))) (.cse4 (= ~DC~0 2))) (or (and .cse0 .cse1 .cse2 (= 1 ~compRegistered~0) .cse3 .cse4 (= ~s~0 2)) (and .cse0 .cse2 .cse1 (<= ~compRegistered~0 0) .cse3 .cse4))) [2021-12-17 02:50:01,134 INFO L854 garLoopResultBuilder]: At program point L264(lines 264 265) the Hoare annotation is: (and (not (= ~IPC~0 2)) (not (= ~SKIP2~0 2)) (not (= 1 ~pended~0)) (= ~compRegistered~0 0) (= |ULTIMATE.start_main_~status~1#1| 0) (= ~s~0 ~SKIP1~0) (not (= ~SKIP1~0 ~NP~0)) (= ~DC~0 2)) [2021-12-17 02:50:01,134 INFO L858 garLoopResultBuilder]: For program point L264-1(lines 264 265) no Hoare annotation was computed. [2021-12-17 02:50:01,134 INFO L858 garLoopResultBuilder]: For program point L165(lines 165 272) no Hoare annotation was computed. [2021-12-17 02:50:01,134 INFO L858 garLoopResultBuilder]: For program point L132(lines 132 283) no Hoare annotation was computed. [2021-12-17 02:50:01,134 INFO L854 garLoopResultBuilder]: At program point L892(lines 891 986) the Hoare annotation is: (and (not (= ~IPC~0 2)) (not (= ~SKIP2~0 2)) (not (= 1 ~pended~0)) (= ~compRegistered~0 0) (= |ULTIMATE.start_main_~status~1#1| 0) (not (= ~SKIP1~0 ~NP~0)) (= ~s~0 ~NP~0) (= ~DC~0 2)) [2021-12-17 02:50:01,134 INFO L858 garLoopResultBuilder]: For program point L760(lines 760 764) no Hoare annotation was computed. [2021-12-17 02:50:01,134 INFO L858 garLoopResultBuilder]: For program point L430(lines 414 463) no Hoare annotation was computed. [2021-12-17 02:50:01,134 INFO L854 garLoopResultBuilder]: At program point L364(lines 363 410) the Hoare annotation is: (and (not (= ~IPC~0 2)) (not (= ~SKIP2~0 2)) (not (= 1 ~pended~0)) (not (= ~MPR3~0 1)) (= ~compRegistered~0 0) (<= 5 ~MPR1~0) (= |ULTIMATE.start_main_~status~1#1| 0) (not (= ~SKIP1~0 ~NP~0)) (= ~s~0 ~NP~0) (= ~NP~0 1) (= ~DC~0 2)) [2021-12-17 02:50:01,134 INFO L858 garLoopResultBuilder]: For program point L199(lines 199 205) no Hoare annotation was computed. [2021-12-17 02:50:01,135 INFO L858 garLoopResultBuilder]: For program point L199-2(lines 172 268) no Hoare annotation was computed. [2021-12-17 02:50:01,135 INFO L858 garLoopResultBuilder]: For program point L959-1(lines 959 961) no Hoare annotation was computed. [2021-12-17 02:50:01,135 INFO L854 garLoopResultBuilder]: At program point L596(line 596) the Hoare annotation is: false [2021-12-17 02:50:01,135 INFO L861 garLoopResultBuilder]: At program point L464(lines 295 466) the Hoare annotation is: true [2021-12-17 02:50:01,135 INFO L858 garLoopResultBuilder]: For program point L431(lines 431 460) no Hoare annotation was computed. [2021-12-17 02:50:01,135 INFO L854 garLoopResultBuilder]: At program point L233(lines 233 234) the Hoare annotation is: (and (not (= ~IPC~0 2)) (not (= ~SKIP2~0 2)) (not (= 1 ~pended~0)) (= ~compRegistered~0 0) (= |ULTIMATE.start_main_~status~1#1| 0) (= ~s~0 ~SKIP1~0) (not (= ~SKIP1~0 ~NP~0)) (= ~DC~0 2)) [2021-12-17 02:50:01,135 INFO L858 garLoopResultBuilder]: For program point L233-1(lines 233 234) no Hoare annotation was computed. [2021-12-17 02:50:01,135 INFO L854 garLoopResultBuilder]: At program point KbFilter_DispatchPassThroughENTRY(lines 665 688) the Hoare annotation is: (or (= ~SKIP2~0 2) (not (= ~DC~0 2)) (= 1 ~pended~0) (= ~IPC~0 2) (not (= |old(~s~0)| ~NP~0)) (and (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 ~NP~0)) (not (= ~compRegistered~0 0)) (= ~SKIP1~0 ~NP~0)) [2021-12-17 02:50:01,135 INFO L854 garLoopResultBuilder]: At program point L684(line 684) the Hoare annotation is: (or (= ~SKIP2~0 2) (not (= ~DC~0 2)) (= 1 ~pended~0) (= ~IPC~0 2) (not (= |old(~s~0)| ~NP~0)) (= ~s~0 ~SKIP1~0) (not (= ~compRegistered~0 0)) (= ~SKIP1~0 ~NP~0)) [2021-12-17 02:50:01,136 INFO L858 garLoopResultBuilder]: For program point L684-1(line 684) no Hoare annotation was computed. [2021-12-17 02:50:01,136 INFO L858 garLoopResultBuilder]: For program point KbFilter_DispatchPassThroughFINAL(lines 665 688) no Hoare annotation was computed. [2021-12-17 02:50:01,136 INFO L854 garLoopResultBuilder]: At program point L678(line 678) the Hoare annotation is: (or (= ~SKIP2~0 2) (not (= ~DC~0 2)) (= 1 ~pended~0) (= ~IPC~0 2) (not (= |old(~s~0)| ~NP~0)) (not (= ~compRegistered~0 0)) (= ~SKIP1~0 ~NP~0)) [2021-12-17 02:50:01,136 INFO L858 garLoopResultBuilder]: For program point L678-1(lines 674 680) no Hoare annotation was computed. [2021-12-17 02:50:01,136 INFO L858 garLoopResultBuilder]: For program point KbFilter_DispatchPassThroughEXIT(lines 665 688) no Hoare annotation was computed. [2021-12-17 02:50:01,136 INFO L858 garLoopResultBuilder]: For program point L674(lines 674 680) no Hoare annotation was computed. [2021-12-17 02:50:01,136 INFO L854 garLoopResultBuilder]: At program point L510(lines 509 526) the Hoare annotation is: (let ((.cse0 (= ~SKIP2~0 2)) (.cse1 (not (= ~DC~0 2))) (.cse2 (= 1 ~pended~0)) (.cse3 (= ~IPC~0 2)) (.cse4 (= ~SKIP1~0 ~NP~0))) (and (or .cse0 (not (= |old(~s~0)| ~SKIP1~0)) .cse1 .cse2 .cse3 (not (= ~compRegistered~0 0)) (and (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 ~SKIP1~0)) .cse4) (or .cse0 (not (<= 5 ~MPR1~0)) .cse1 .cse2 .cse3 (not (= |old(~s~0)| ~NP~0)) (not (= ~NP~0 1)) (and (= (+ IofCallDriver_~__cil_tmp7~0 1073741802) 0) (= ~MPR1~0 ~s~0)) (= ~MPR3~0 1) (not (= 1 ~compRegistered~0)) .cse4))) [2021-12-17 02:50:01,136 INFO L858 garLoopResultBuilder]: For program point L532(lines 532 549) no Hoare annotation was computed. [2021-12-17 02:50:01,136 INFO L854 garLoopResultBuilder]: At program point IofCallDriverENTRY(lines 481 553) the Hoare annotation is: (let ((.cse0 (= ~SKIP2~0 2)) (.cse1 (not (= ~DC~0 2))) (.cse2 (= 1 ~pended~0)) (.cse3 (= ~IPC~0 2)) (.cse4 (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|)) (.cse5 (= ~setEventCalled~0 |old(~setEventCalled~0)|)) (.cse6 (= ~SKIP1~0 ~NP~0))) (and (or .cse0 (not (= |old(~s~0)| ~SKIP1~0)) .cse1 .cse2 .cse3 (not (= ~compRegistered~0 0)) (and .cse4 .cse5 (= ~s~0 ~SKIP1~0)) .cse6) (or .cse0 (not (<= 5 ~MPR1~0)) .cse1 .cse2 .cse3 (not (= |old(~s~0)| ~NP~0)) (not (= ~NP~0 1)) (and .cse4 .cse5 (= ~s~0 1)) (= ~MPR3~0 1) (not (= 1 ~compRegistered~0)) .cse6))) [2021-12-17 02:50:01,137 INFO L858 garLoopResultBuilder]: For program point L495(lines 495 499) no Hoare annotation was computed. [2021-12-17 02:50:01,137 INFO L854 garLoopResultBuilder]: At program point L524(lines 488 552) the Hoare annotation is: (let ((.cse0 (= ~SKIP2~0 2)) (.cse1 (not (= ~DC~0 2))) (.cse2 (= 1 ~pended~0)) (.cse5 (= ~IPC~0 2)) (.cse6 (= ~SKIP1~0 ~NP~0))) (and (let ((.cse3 (= (+ IofCallDriver_~__cil_tmp7~0 1073741802) 0)) (.cse4 (= ~MPR1~0 ~s~0))) (or .cse0 .cse1 .cse2 (and .cse3 .cse4 (= IofCallDriver_~returnVal2~0 0)) (not (= |old(~s~0)| ~NP~0)) (not (= ~NP~0 1)) (not (= 1 ~compRegistered~0)) (not (<= 5 ~MPR1~0)) (and (<= (+ IofCallDriver_~returnVal2~0 1073741823) 0) .cse3 .cse4) .cse5 (= ~MPR3~0 1) .cse6 (and .cse3 (<= 259 IofCallDriver_~returnVal2~0) .cse4 (= ~setEventCalled~0 1) (<= IofCallDriver_~returnVal2~0 259)))) (or .cse0 (not (= |old(~s~0)| ~SKIP1~0)) .cse1 .cse2 .cse5 (not (= ~compRegistered~0 0)) (and (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 ~SKIP1~0)) .cse6))) [2021-12-17 02:50:01,137 INFO L854 garLoopResultBuilder]: At program point L491(line 491) the Hoare annotation is: (let ((.cse0 (= ~SKIP2~0 2)) (.cse1 (not (= ~DC~0 2))) (.cse2 (= 1 ~pended~0)) (.cse3 (= ~IPC~0 2)) (.cse4 (= ~SKIP1~0 ~NP~0))) (and (or .cse0 (not (= |old(~s~0)| ~SKIP1~0)) .cse1 .cse2 .cse3 (not (= ~compRegistered~0 0)) .cse4) (or .cse0 (not (<= 5 ~MPR1~0)) .cse1 .cse2 .cse3 (not (= |old(~s~0)| ~NP~0)) (not (= ~NP~0 1)) (and (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 1)) (= ~MPR3~0 1) (not (= 1 ~compRegistered~0)) .cse4))) [2021-12-17 02:50:01,137 INFO L858 garLoopResultBuilder]: For program point L491-1(line 491) no Hoare annotation was computed. [2021-12-17 02:50:01,137 INFO L858 garLoopResultBuilder]: For program point IofCallDriverFINAL(lines 481 553) no Hoare annotation was computed. [2021-12-17 02:50:01,137 INFO L854 garLoopResultBuilder]: At program point L512(lines 511 526) the Hoare annotation is: (let ((.cse0 (= ~SKIP2~0 2)) (.cse1 (not (= ~DC~0 2))) (.cse2 (= 1 ~pended~0)) (.cse3 (= ~IPC~0 2)) (.cse4 (= ~SKIP1~0 ~NP~0))) (and (or .cse0 (not (<= 5 ~MPR1~0)) .cse1 .cse2 .cse3 (and (= (+ IofCallDriver_~__cil_tmp7~0 1073741802) 0) (= ~MPR1~0 ~s~0) (= ~setEventCalled~0 1)) (not (= |old(~s~0)| ~NP~0)) (not (= ~NP~0 1)) (= ~MPR3~0 1) (not (= 1 ~compRegistered~0)) .cse4) (or .cse0 (not (= |old(~s~0)| ~SKIP1~0)) .cse1 .cse2 .cse3 (not (= ~compRegistered~0 0)) (and (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 ~SKIP1~0)) .cse4))) [2021-12-17 02:50:01,137 INFO L858 garLoopResultBuilder]: For program point L541(lines 541 548) no Hoare annotation was computed. [2021-12-17 02:50:01,138 INFO L858 garLoopResultBuilder]: For program point L504(lines 504 527) no Hoare annotation was computed. [2021-12-17 02:50:01,138 INFO L858 garLoopResultBuilder]: For program point IofCallDriverEXIT(lines 481 553) no Hoare annotation was computed. [2021-12-17 02:50:01,138 INFO L858 garLoopResultBuilder]: For program point L533(lines 533 539) no Hoare annotation was computed. [2021-12-17 02:50:01,138 INFO L854 garLoopResultBuilder]: At program point L546(line 546) the Hoare annotation is: (let ((.cse0 (= ~SKIP2~0 2)) (.cse1 (not (= ~DC~0 2))) (.cse2 (= 1 ~pended~0)) (.cse3 (= ~IPC~0 2)) (.cse4 (= ~SKIP1~0 ~NP~0))) (and (or .cse0 (not (<= 5 ~MPR1~0)) .cse1 .cse2 .cse3 (not (= |old(~s~0)| ~NP~0)) (not (= ~NP~0 1)) (= ~MPR3~0 1) (not (= 1 ~compRegistered~0)) .cse4) (or .cse0 (not (= |old(~s~0)| ~SKIP1~0)) .cse1 .cse2 .cse3 (not (= ~compRegistered~0 0)) .cse4))) [2021-12-17 02:50:01,138 INFO L858 garLoopResultBuilder]: For program point L546-1(lines 528 550) no Hoare annotation was computed. [2021-12-17 02:50:01,138 INFO L858 garLoopResultBuilder]: For program point L509(lines 509 526) no Hoare annotation was computed. [2021-12-17 02:50:01,138 INFO L854 garLoopResultBuilder]: At program point L505(lines 504 527) the Hoare annotation is: (let ((.cse0 (= ~SKIP2~0 2)) (.cse1 (not (= ~DC~0 2))) (.cse2 (= 1 ~pended~0)) (.cse3 (= ~IPC~0 2)) (.cse4 (= ~SKIP1~0 ~NP~0))) (and (or .cse0 (not (= |old(~s~0)| ~SKIP1~0)) .cse1 .cse2 .cse3 (not (= ~compRegistered~0 0)) (and (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 ~SKIP1~0)) .cse4) (or .cse0 (not (<= 5 ~MPR1~0)) .cse1 .cse2 .cse3 (not (= |old(~s~0)| ~NP~0)) (not (= ~NP~0 1)) (and (= (+ IofCallDriver_~__cil_tmp7~0 1073741802) 0) (= ~MPR1~0 ~s~0)) (= ~MPR3~0 1) (not (= 1 ~compRegistered~0)) .cse4))) [2021-12-17 02:50:01,138 INFO L854 garLoopResultBuilder]: At program point L497(line 497) the Hoare annotation is: (let ((.cse0 (= ~SKIP2~0 2)) (.cse1 (not (= ~DC~0 2))) (.cse2 (= 1 ~pended~0)) (.cse3 (= ~IPC~0 2)) (.cse4 (= ~SKIP1~0 ~NP~0))) (and (or .cse0 (and (= (+ IofCallDriver_~__cil_tmp7~0 1073741802) 0) (= ~s~0 1) (= ~setEventCalled~0 1)) (not (<= 5 ~MPR1~0)) .cse1 .cse2 .cse3 (not (= |old(~s~0)| ~NP~0)) (not (= ~NP~0 1)) (= ~MPR3~0 1) (not (= 1 ~compRegistered~0)) .cse4) (or .cse0 (not (= |old(~s~0)| ~SKIP1~0)) .cse1 .cse2 .cse3 (not (= ~compRegistered~0 0)) .cse4))) [2021-12-17 02:50:01,139 INFO L858 garLoopResultBuilder]: For program point L489(lines 489 501) no Hoare annotation was computed. [2021-12-17 02:50:01,139 INFO L858 garLoopResultBuilder]: For program point L489-1(lines 489 501) no Hoare annotation was computed. [2021-12-17 02:50:01,139 INFO L854 garLoopResultBuilder]: At program point L475(line 475) the Hoare annotation is: (or (= ~SKIP2~0 2) (not (<= 5 ~MPR1~0)) (not (= ~DC~0 2)) (= 1 ~pended~0) (= ~IPC~0 2) (not (= |old(~s~0)| ~NP~0)) (not (= ~NP~0 1)) (= ~MPR3~0 1) (not (= ~setEventCalled~0 1)) (not (= 1 ~compRegistered~0)) (= ~SKIP1~0 ~NP~0)) [2021-12-17 02:50:01,139 INFO L858 garLoopResultBuilder]: For program point L475-1(lines 467 480) no Hoare annotation was computed. [2021-12-17 02:50:01,139 INFO L854 garLoopResultBuilder]: At program point stubMoreProcessingRequiredENTRY(lines 467 480) the Hoare annotation is: (or (= ~SKIP2~0 2) (not (<= 5 ~MPR1~0)) (not (= ~DC~0 2)) (= 1 ~pended~0) (= ~IPC~0 2) (not (= |old(~s~0)| ~NP~0)) (not (= ~NP~0 1)) (= ~MPR3~0 1) (= ~s~0 1) (not (= ~setEventCalled~0 1)) (not (= 1 ~compRegistered~0)) (= ~SKIP1~0 ~NP~0)) [2021-12-17 02:50:01,139 INFO L858 garLoopResultBuilder]: For program point stubMoreProcessingRequiredEXIT(lines 467 480) no Hoare annotation was computed. [2021-12-17 02:50:01,141 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 02:50:01,142 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-17 02:50:01,163 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.12 02:50:01 BoogieIcfgContainer [2021-12-17 02:50:01,163 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-17 02:50:01,164 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-17 02:50:01,164 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-17 02:50:01,164 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-17 02:50:01,164 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 02:49:56" (3/4) ... [2021-12-17 02:50:01,166 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-12-17 02:50:01,170 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure KbFilter_Complete [2021-12-17 02:50:01,170 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure KbFilter_CreateClose [2021-12-17 02:50:01,170 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IofCompleteRequest [2021-12-17 02:50:01,170 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure errorFn [2021-12-17 02:50:01,170 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure KbFilter_DispatchPassThrough [2021-12-17 02:50:01,170 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IofCallDriver [2021-12-17 02:50:01,170 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure stubMoreProcessingRequired [2021-12-17 02:50:01,179 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 33 nodes and edges [2021-12-17 02:50:01,184 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2021-12-17 02:50:01,185 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2021-12-17 02:50:01,185 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-12-17 02:50:01,203 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((SKIP2 == 2 || !(\old(s) == SKIP1)) || !(DC == 2)) || 1 == pended) || IPC == 2) || !(compRegistered == 0)) || ((lowerDriverReturn == \old(lowerDriverReturn) && setEventCalled == \old(setEventCalled)) && s == SKIP1)) || SKIP1 == NP) && ((((((((((SKIP2 == 2 || !(5 <= MPR1)) || !(DC == 2)) || 1 == pended) || IPC == 2) || !(\old(s) == NP)) || !(NP == 1)) || (__cil_tmp7 + 1073741802 == 0 && MPR1 == s)) || MPR3 == 1) || !(1 == compRegistered)) || SKIP1 == NP) [2021-12-17 02:50:01,205 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((SKIP2 == 2 || !(DC == 2)) || 1 == pended) || ((__cil_tmp7 + 1073741802 == 0 && MPR1 == s) && returnVal2 == 0)) || !(\old(s) == NP)) || !(NP == 1)) || !(1 == compRegistered)) || !(5 <= MPR1)) || ((returnVal2 + 1073741823 <= 0 && __cil_tmp7 + 1073741802 == 0) && MPR1 == s)) || IPC == 2) || MPR3 == 1) || SKIP1 == NP) || ((((__cil_tmp7 + 1073741802 == 0 && 259 <= returnVal2) && MPR1 == s) && setEventCalled == 1) && returnVal2 <= 259)) && (((((((SKIP2 == 2 || !(\old(s) == SKIP1)) || !(DC == 2)) || 1 == pended) || IPC == 2) || !(compRegistered == 0)) || ((lowerDriverReturn == \old(lowerDriverReturn) && setEventCalled == \old(setEventCalled)) && s == SKIP1)) || SKIP1 == NP) [2021-12-17 02:50:01,207 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((SKIP2 == 2 || !(\old(s) == SKIP1)) || !(DC == 2)) || 1 == pended) || IPC == 2) || !(compRegistered == 0)) || ((lowerDriverReturn == \old(lowerDriverReturn) && setEventCalled == \old(setEventCalled)) && s == SKIP1)) || SKIP1 == NP) && ((((((((((SKIP2 == 2 || !(5 <= MPR1)) || !(DC == 2)) || 1 == pended) || IPC == 2) || !(\old(s) == NP)) || !(NP == 1)) || (__cil_tmp7 + 1073741802 == 0 && MPR1 == s)) || MPR3 == 1) || !(1 == compRegistered)) || SKIP1 == NP) [2021-12-17 02:50:01,207 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((SKIP2 == 2 || !(5 <= MPR1)) || !(DC == 2)) || 1 == pended) || IPC == 2) || ((__cil_tmp7 + 1073741802 == 0 && MPR1 == s) && setEventCalled == 1)) || !(\old(s) == NP)) || !(NP == 1)) || MPR3 == 1) || !(1 == compRegistered)) || SKIP1 == NP) && (((((((SKIP2 == 2 || !(\old(s) == SKIP1)) || !(DC == 2)) || 1 == pended) || IPC == 2) || !(compRegistered == 0)) || ((lowerDriverReturn == \old(lowerDriverReturn) && setEventCalled == \old(setEventCalled)) && s == SKIP1)) || SKIP1 == NP) [2021-12-17 02:50:01,209 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((SKIP2 == 2 || !(DC == 2)) || 1 == pended) || IPC == 2) || !(\old(s) == NP)) || ((lowerDriverReturn == \old(lowerDriverReturn) && setEventCalled == \old(setEventCalled)) && s == NP)) || !(compRegistered == 0)) || SKIP1 == NP [2021-12-17 02:50:01,209 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((SKIP2 == 2 || !(DC == 2)) || 1 == pended) || IPC == 2) || !(\old(s) == NP)) || ((lowerDriverReturn == \old(lowerDriverReturn) && setEventCalled == \old(setEventCalled)) && s == NP)) || !(compRegistered == 0)) || SKIP1 == NP [2021-12-17 02:50:01,265 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-17 02:50:01,265 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-17 02:50:01,265 INFO L158 Benchmark]: Toolchain (without parser) took 6180.20ms. Allocated memory was 117.4MB in the beginning and 176.2MB in the end (delta: 58.7MB). Free memory was 89.5MB in the beginning and 92.1MB in the end (delta: -2.6MB). Peak memory consumption was 55.3MB. Max. memory is 16.1GB. [2021-12-17 02:50:01,268 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 83.9MB. Free memory is still 41.9MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-17 02:50:01,268 INFO L158 Benchmark]: CACSL2BoogieTranslator took 300.58ms. Allocated memory is still 117.4MB. Free memory was 89.5MB in the beginning and 87.1MB in the end (delta: 2.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-17 02:50:01,268 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.21ms. Allocated memory is still 117.4MB. Free memory was 86.7MB in the beginning and 83.2MB in the end (delta: 3.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-17 02:50:01,271 INFO L158 Benchmark]: Boogie Preprocessor took 34.56ms. Allocated memory is still 117.4MB. Free memory was 83.2MB in the beginning and 80.8MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-17 02:50:01,272 INFO L158 Benchmark]: RCFGBuilder took 557.73ms. Allocated memory is still 117.4MB. Free memory was 80.8MB in the beginning and 80.1MB in the end (delta: 763.3kB). Peak memory consumption was 29.6MB. Max. memory is 16.1GB. [2021-12-17 02:50:01,272 INFO L158 Benchmark]: TraceAbstraction took 5125.78ms. Allocated memory was 117.4MB in the beginning and 176.2MB in the end (delta: 58.7MB). Free memory was 79.5MB in the beginning and 109.0MB in the end (delta: -29.5MB). Peak memory consumption was 90.6MB. Max. memory is 16.1GB. [2021-12-17 02:50:01,272 INFO L158 Benchmark]: Witness Printer took 100.98ms. Allocated memory is still 176.2MB. Free memory was 109.0MB in the beginning and 92.1MB in the end (delta: 16.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2021-12-17 02:50:01,274 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 83.9MB. Free memory is still 41.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 300.58ms. Allocated memory is still 117.4MB. Free memory was 89.5MB in the beginning and 87.1MB in the end (delta: 2.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.21ms. Allocated memory is still 117.4MB. Free memory was 86.7MB in the beginning and 83.2MB in the end (delta: 3.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 34.56ms. Allocated memory is still 117.4MB. Free memory was 83.2MB in the beginning and 80.8MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 557.73ms. Allocated memory is still 117.4MB. Free memory was 80.8MB in the beginning and 80.1MB in the end (delta: 763.3kB). Peak memory consumption was 29.6MB. Max. memory is 16.1GB. * TraceAbstraction took 5125.78ms. Allocated memory was 117.4MB in the beginning and 176.2MB in the end (delta: 58.7MB). Free memory was 79.5MB in the beginning and 109.0MB in the end (delta: -29.5MB). Peak memory consumption was 90.6MB. Max. memory is 16.1GB. * Witness Printer took 100.98ms. Allocated memory is still 176.2MB. Free memory was 109.0MB in the beginning and 92.1MB in the end (delta: 16.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 1013]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 208 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.1s, OverallIterations: 22, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.9s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2706 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2687 mSDsluCounter, 7795 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4515 mSDsCounter, 382 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1599 IncrementalHoareTripleChecker+Invalid, 1981 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 382 mSolverCounterUnsat, 3280 mSDtfsCounter, 1599 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 216 GetRequests, 97 SyntacticMatches, 2 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=297occurred in iteration=6, InterpolantAutomatonStates: 136, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 22 MinimizatonAttempts, 111 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 76 LocationsWithAnnotation, 274 PreInvPairs, 354 NumberOfFragments, 2538 HoareAnnotationTreeSize, 274 FomulaSimplifications, 248 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 76 FomulaSimplificationsInter, 3139 FormulaSimplificationTreeSizeReductionInter, 1.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 856 NumberOfCodeBlocks, 856 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 834 ConstructedInterpolants, 0 QuantifiedInterpolants, 2114 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 43]: Loop Invariant Derived loop invariant: (((((((((!(IPC == 2) && !(SKIP2 == 2)) && !(1 == pended)) && !(MPR3 == 1)) && compRegistered == 0) && 5 <= MPR1) && status == 0) && !(SKIP1 == NP)) && s == NP) && NP == 1) && DC == 2 - InvariantResult [Line: 753]: Loop Invariant Derived loop invariant: ((((((!(IPC == 2) && !(SKIP2 == 2)) && !(1 == pended)) && compRegistered == 0) && status == 0) && s == SKIP1) && !(SKIP1 == NP)) && DC == 2 - InvariantResult [Line: 368]: Loop Invariant Derived loop invariant: ((((((!(IPC == 2) && !(SKIP2 == 2)) && !(1 == pended)) && compRegistered == 0) && status == 0) && !(SKIP1 == NP)) && s == NP) && DC == 2 - InvariantResult [Line: 875]: Loop Invariant Derived loop invariant: ((((((!(IPC == 2) && !(SKIP2 == 2)) && !(1 == pended)) && compRegistered == 0) && status == 0) && !(SKIP1 == NP)) && s == NP) && DC == 2 - InvariantResult [Line: 689]: Loop Invariant Derived loop invariant: (((((!(IPC == 2) && !(SKIP2 == 2)) && !(1 == pended)) && compRegistered == 0) && status == 0) && !(SKIP1 == NP)) && DC == 2 - InvariantResult [Line: 641]: Loop Invariant Derived loop invariant: ((((((SKIP2 == 2 || !(DC == 2)) || 1 == pended) || IPC == 2) || !(\old(s) == NP)) || ((lowerDriverReturn == \old(lowerDriverReturn) && setEventCalled == \old(setEventCalled)) && s == NP)) || !(compRegistered == 0)) || SKIP1 == NP - InvariantResult [Line: 295]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 117]: Loop Invariant Derived loop invariant: ((((((!(IPC == 2) && !(SKIP2 == 2)) && !(1 == pended)) && compRegistered == 0) && status == 0) && !(SKIP1 == NP)) && s == NP) && DC == 2 - InvariantResult [Line: 509]: Loop Invariant Derived loop invariant: (((((((SKIP2 == 2 || !(\old(s) == SKIP1)) || !(DC == 2)) || 1 == pended) || IPC == 2) || !(compRegistered == 0)) || ((lowerDriverReturn == \old(lowerDriverReturn) && setEventCalled == \old(setEventCalled)) && s == SKIP1)) || SKIP1 == NP) && ((((((((((SKIP2 == 2 || !(5 <= MPR1)) || !(DC == 2)) || 1 == pended) || IPC == 2) || !(\old(s) == NP)) || !(NP == 1)) || (__cil_tmp7 + 1073741802 == 0 && MPR1 == s)) || MPR3 == 1) || !(1 == compRegistered)) || SKIP1 == NP) - InvariantResult [Line: 375]: Loop Invariant Derived loop invariant: status == 0 - InvariantResult [Line: 324]: Loop Invariant Derived loop invariant: ((((((!(IPC == 2) && !(1 == pended)) && !(SKIP2 == 2)) && 1 == compRegistered) && !(SKIP1 == NP)) && DC == 2) && s == 2) || (((((!(IPC == 2) && !(SKIP2 == 2)) && !(1 == pended)) && compRegistered <= 0) && !(SKIP1 == NP)) && DC == 2) - InvariantResult [Line: 108]: Loop Invariant Derived loop invariant: ((((((((((!(IPC == 2) && !(SKIP2 == 2)) && !(1 == pended)) && !(MPR3 == 1)) && compRegistered == 0) && 5 <= MPR1) && status == 0) && status == 0) && !(SKIP1 == NP)) && s == 1) && NP == 1) && DC == 2 - InvariantResult [Line: 581]: Loop Invariant Derived loop invariant: (((((((!(IPC == 2) && !(SKIP2 == 2)) && !(1 == pended)) && !(MPR3 == s)) && status == 0) && 1 == compRegistered) && !(SKIP1 == NP)) && s == NP) && DC == 2 - InvariantResult [Line: 603]: Loop Invariant Derived loop invariant: ((((((!(IPC == 2) && !(SKIP2 == 2)) && !(1 == pended)) && status == 0) && 1 == compRegistered) && !(SKIP1 == NP)) && s == NP) && DC == 2 - InvariantResult [Line: 422]: Loop Invariant Derived loop invariant: (((((!(IPC == 2) && !(1 == pended)) && !(SKIP2 == 2)) && compRegistered <= 0) && !(SKIP1 == NP)) && DC == 2) || ((((((!(IPC == 2) && !(1 == pended)) && !(SKIP2 == 2)) && 1 == compRegistered) && !(SKIP1 == NP)) && DC == 2) && s == 2) - InvariantResult [Line: 488]: Loop Invariant Derived loop invariant: ((((((((((((SKIP2 == 2 || !(DC == 2)) || 1 == pended) || ((__cil_tmp7 + 1073741802 == 0 && MPR1 == s) && returnVal2 == 0)) || !(\old(s) == NP)) || !(NP == 1)) || !(1 == compRegistered)) || !(5 <= MPR1)) || ((returnVal2 + 1073741823 <= 0 && __cil_tmp7 + 1073741802 == 0) && MPR1 == s)) || IPC == 2) || MPR3 == 1) || SKIP1 == NP) || ((((__cil_tmp7 + 1073741802 == 0 && 259 <= returnVal2) && MPR1 == s) && setEventCalled == 1) && returnVal2 <= 259)) && (((((((SKIP2 == 2 || !(\old(s) == SKIP1)) || !(DC == 2)) || 1 == pended) || IPC == 2) || !(compRegistered == 0)) || ((lowerDriverReturn == \old(lowerDriverReturn) && setEventCalled == \old(setEventCalled)) && s == SKIP1)) || SKIP1 == NP) - InvariantResult [Line: 745]: Loop Invariant Derived loop invariant: (((((!(IPC == 2) && !(SKIP2 == 2)) && !(1 == pended)) && compRegistered == 0) && status == 0) && !(SKIP1 == NP)) && DC == 2 - InvariantResult [Line: 867]: Loop Invariant Derived loop invariant: ((((((!(IPC == 2) && !(SKIP2 == 2)) && !(1 == pended)) && compRegistered == 0) && status == 0) && !(SKIP1 == NP)) && s == NP) && DC == 2 - InvariantResult [Line: 891]: Loop Invariant Derived loop invariant: ((((((!(IPC == 2) && !(SKIP2 == 2)) && !(1 == pended)) && compRegistered == 0) && status == 0) && !(SKIP1 == NP)) && s == NP) && DC == 2 - InvariantResult [Line: 605]: Loop Invariant Derived loop invariant: ((((((!(IPC == 2) && !(SKIP2 == 2)) && !(1 == pended)) && status == 0) && 1 == compRegistered) && !(SKIP1 == NP)) && s == NP) && DC == 2 - InvariantResult [Line: 769]: Loop Invariant Derived loop invariant: ((((((!(IPC == 2) && !(SKIP2 == 2)) && !(1 == pended)) && compRegistered == 0) && status == 0) && s == SKIP1) && !(SKIP1 == NP)) && DC == 2 - InvariantResult [Line: 822]: Loop Invariant Derived loop invariant: (((((!(IPC == 2) && !(SKIP2 == 2)) && !(1 == pended)) && compRegistered == 0) && status == 0) && !(SKIP1 == NP)) && DC == 2 - InvariantResult [Line: 111]: Loop Invariant Derived loop invariant: ((((((!(IPC == 2) && !(SKIP2 == 2)) && !(1 == pended)) && compRegistered == 0) && status == 0) && !(SKIP1 == NP)) && s == NP) && DC == 2 - InvariantResult [Line: 774]: Loop Invariant Derived loop invariant: ((((((!(IPC == 2) && !(SKIP2 == 2)) && !(1 == pended)) && compRegistered == 0) && status == 0) && s == SKIP1) && !(SKIP1 == NP)) && DC == 2 - InvariantResult [Line: 576]: Loop Invariant Derived loop invariant: ((((((!(IPC == 2) && !(SKIP2 == 2)) && !(1 == pended)) && status == 0) && 1 == compRegistered) && !(SKIP1 == NP)) && s == NP) && DC == 2 - InvariantResult [Line: 699]: Loop Invariant Derived loop invariant: ((((((!(IPC == 2) && !(SKIP2 == 2)) && !(1 == pended)) && compRegistered == 0) && status == 0) && !(SKIP1 == NP)) && s == NP) && DC == 2 - InvariantResult [Line: 432]: Loop Invariant Derived loop invariant: (!(1 == pended) && ((((!(IPC == 2) && !(SKIP2 == 2)) && compRegistered <= 0) && DC == 2) || (((!(IPC == 2) && !(SKIP2 == 2)) && 1 == compRegistered) && DC == 2))) && !(SKIP1 == NP) - InvariantResult [Line: 700]: Loop Invariant Derived loop invariant: ((((((!(IPC == 2) && !(SKIP2 == 2)) && !(1 == pended)) && compRegistered == 0) && status == 0) && !(SKIP1 == NP)) && s == NP) && DC == 2 - InvariantResult [Line: 81]: Loop Invariant Derived loop invariant: ((((((!(IPC == 2) && !(SKIP2 == 2)) && !(1 == pended)) && status == 0) && compRegistered <= 0) && !(SKIP1 == NP)) && DC == 2) || (((((((!(IPC == 2) && !(SKIP2 == 2)) && !(1 == pended)) && status == 0) && 1 == compRegistered) && !(SKIP1 == NP)) && DC == 2) && s == 2) - InvariantResult [Line: 353]: Loop Invariant Derived loop invariant: ((((((!(IPC == 2) && !(SKIP2 == 2)) && !(1 == pended)) && compRegistered == 0) && status == 0) && !(SKIP1 == NP)) && s == NP) && DC == 2 - InvariantResult [Line: 638]: Loop Invariant Derived loop invariant: ((((((SKIP2 == 2 || !(DC == 2)) || 1 == pended) || IPC == 2) || !(\old(s) == NP)) || ((lowerDriverReturn == \old(lowerDriverReturn) && setEventCalled == \old(setEventCalled)) && s == NP)) || !(compRegistered == 0)) || SKIP1 == NP - InvariantResult [Line: 776]: Loop Invariant Derived loop invariant: ((((((!(IPC == 2) && !(SKIP2 == 2)) && !(1 == pended)) && compRegistered == 0) && status == 0) && s == SKIP1) && !(SKIP1 == NP)) && DC == 2 - InvariantResult [Line: 511]: Loop Invariant Derived loop invariant: ((((((((((SKIP2 == 2 || !(5 <= MPR1)) || !(DC == 2)) || 1 == pended) || IPC == 2) || ((__cil_tmp7 + 1073741802 == 0 && MPR1 == s) && setEventCalled == 1)) || !(\old(s) == NP)) || !(NP == 1)) || MPR3 == 1) || !(1 == compRegistered)) || SKIP1 == NP) && (((((((SKIP2 == 2 || !(\old(s) == SKIP1)) || !(DC == 2)) || 1 == pended) || IPC == 2) || !(compRegistered == 0)) || ((lowerDriverReturn == \old(lowerDriverReturn) && setEventCalled == \old(setEventCalled)) && s == SKIP1)) || SKIP1 == NP) - InvariantResult [Line: 114]: Loop Invariant Derived loop invariant: ((((((!(IPC == 2) && !(SKIP2 == 2)) && !(1 == pended)) && compRegistered == 0) && status == 0) && !(SKIP1 == NP)) && s == NP) && DC == 2 - InvariantResult [Line: 883]: Loop Invariant Derived loop invariant: ((((((!(IPC == 2) && !(SKIP2 == 2)) && !(1 == pended)) && compRegistered == 0) && status == 0) && !(SKIP1 == NP)) && s == NP) && DC == 2 - InvariantResult [Line: 358]: Loop Invariant Derived loop invariant: ((((((!(IPC == 2) && !(SKIP2 == 2)) && !(1 == pended)) && compRegistered == 0) && status == 0) && !(SKIP1 == NP)) && s == NP) && DC == 2 - InvariantResult [Line: 568]: Loop Invariant Derived loop invariant: (((((((((SKIP2 == 2 || !(5 <= MPR1)) || !(s == NP)) || !(DC == 2)) || 1 == pended) || IPC == 2) || !(NP == 1)) || MPR3 == 1) || setEventCalled == 1) || !(1 == compRegistered)) || SKIP1 == NP - InvariantResult [Line: 363]: Loop Invariant Derived loop invariant: (((((((((!(IPC == 2) && !(SKIP2 == 2)) && !(1 == pended)) && !(MPR3 == 1)) && compRegistered == 0) && 5 <= MPR1) && status == 0) && !(SKIP1 == NP)) && s == NP) && NP == 1) && DC == 2 - InvariantResult [Line: 414]: Loop Invariant Derived loop invariant: (((((!(IPC == 2) && !(1 == pended)) && !(SKIP2 == 2)) && compRegistered <= 0) && !(SKIP1 == NP)) && DC == 2) || ((((((!(IPC == 2) && !(1 == pended)) && !(SKIP2 == 2)) && 1 == compRegistered) && !(SKIP1 == NP)) && DC == 2) && s == 2) - InvariantResult [Line: 172]: Loop Invariant Derived loop invariant: ((((((!(IPC == 2) && !(SKIP2 == 2)) && !(1 == pended)) && status == 0) && compRegistered <= 0) && !(SKIP1 == NP)) && DC == 2) || (((((((!(IPC == 2) && !(SKIP2 == 2)) && !(1 == pended)) && status == 0) && 1 == compRegistered) && !(SKIP1 == NP)) && DC == 2) && s == 2) - InvariantResult [Line: 504]: Loop Invariant Derived loop invariant: (((((((SKIP2 == 2 || !(\old(s) == SKIP1)) || !(DC == 2)) || 1 == pended) || IPC == 2) || !(compRegistered == 0)) || ((lowerDriverReturn == \old(lowerDriverReturn) && setEventCalled == \old(setEventCalled)) && s == SKIP1)) || SKIP1 == NP) && ((((((((((SKIP2 == 2 || !(5 <= MPR1)) || !(DC == 2)) || 1 == pended) || IPC == 2) || !(\old(s) == NP)) || !(NP == 1)) || (__cil_tmp7 + 1073741802 == 0 && MPR1 == s)) || MPR3 == 1) || !(1 == compRegistered)) || SKIP1 == NP) - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: ((((((((((!(IPC == 2) && !(SKIP2 == 2)) && !(1 == pended)) && !(s == NP)) && !(MPR3 == 1)) && !(MPR3 == s)) && compRegistered == 0) && 5 <= MPR1) && status == 0) && !(SKIP1 == NP)) && NP == 1) && DC == 2 - InvariantResult [Line: 373]: Loop Invariant Derived loop invariant: ((((((!(IPC == 2) && !(SKIP2 == 2)) && !(1 == pended)) && compRegistered == 0) && status == 0) && !(SKIP1 == NP)) && s == NP) && DC == 2 RESULT: Ultimate proved your program to be correct! [2021-12-17 02:50:01,329 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE