./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ntdrivers-simplified/kbfiltr_simpl2.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 35987657 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-2.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 a05fbc1d8a2048d37fda072c6a9d42f1f996d033c914869a4e2960aadff82dde --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-20 22:30:48,226 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-20 22:30:48,227 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-20 22:30:48,271 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-20 22:30:48,272 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-20 22:30:48,273 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-20 22:30:48,277 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-20 22:30:48,278 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-20 22:30:48,280 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-20 22:30:48,280 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-20 22:30:48,281 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-20 22:30:48,282 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-20 22:30:48,283 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-20 22:30:48,283 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-20 22:30:48,284 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-20 22:30:48,285 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-20 22:30:48,286 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-20 22:30:48,287 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-20 22:30:48,288 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-20 22:30:48,289 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-20 22:30:48,292 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-20 22:30:48,296 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-20 22:30:48,297 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-20 22:30:48,299 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-20 22:30:48,300 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-20 22:30:48,302 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-20 22:30:48,307 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-20 22:30:48,308 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-20 22:30:48,309 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-20 22:30:48,309 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-20 22:30:48,310 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-20 22:30:48,310 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-20 22:30:48,311 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-20 22:30:48,312 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-20 22:30:48,313 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-20 22:30:48,314 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-20 22:30:48,314 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-20 22:30:48,315 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-20 22:30:48,315 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-20 22:30:48,315 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-20 22:30:48,316 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-20 22:30:48,318 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-20 22:30:48,322 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-20 22:30:48,348 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-20 22:30:48,348 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-20 22:30:48,349 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-20 22:30:48,349 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-20 22:30:48,350 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-20 22:30:48,350 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-20 22:30:48,351 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-20 22:30:48,351 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-20 22:30:48,351 INFO L138 SettingsManager]: * Use SBE=true [2022-07-20 22:30:48,352 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-20 22:30:48,352 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-20 22:30:48,352 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-20 22:30:48,353 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-20 22:30:48,353 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-20 22:30:48,353 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-20 22:30:48,353 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-20 22:30:48,353 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-20 22:30:48,353 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-20 22:30:48,354 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-20 22:30:48,354 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-20 22:30:48,354 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-20 22:30:48,354 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-20 22:30:48,354 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-20 22:30:48,355 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-20 22:30:48,355 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 22:30:48,355 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-20 22:30:48,355 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-20 22:30:48,355 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-20 22:30:48,356 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-20 22:30:48,356 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-20 22:30:48,356 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-20 22:30:48,356 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-20 22:30:48,356 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-20 22:30:48,357 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 -> a05fbc1d8a2048d37fda072c6a9d42f1f996d033c914869a4e2960aadff82dde [2022-07-20 22:30:48,636 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-20 22:30:48,663 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-20 22:30:48,666 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-20 22:30:48,667 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-20 22:30:48,667 INFO L275 PluginConnector]: CDTParser initialized [2022-07-20 22:30:48,669 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ntdrivers-simplified/kbfiltr_simpl2.cil-2.c [2022-07-20 22:30:48,729 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8799f763b/0f6d5f296a484ca6b0ae9665dafa84f3/FLAGd60a22157 [2022-07-20 22:30:49,219 INFO L306 CDTParser]: Found 1 translation units. [2022-07-20 22:30:49,220 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ntdrivers-simplified/kbfiltr_simpl2.cil-2.c [2022-07-20 22:30:49,230 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8799f763b/0f6d5f296a484ca6b0ae9665dafa84f3/FLAGd60a22157 [2022-07-20 22:30:49,705 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8799f763b/0f6d5f296a484ca6b0ae9665dafa84f3 [2022-07-20 22:30:49,711 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-20 22:30:49,712 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-20 22:30:49,713 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-20 22:30:49,713 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-20 22:30:49,717 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-20 22:30:49,717 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 10:30:49" (1/1) ... [2022-07-20 22:30:49,718 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23364cda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:30:49, skipping insertion in model container [2022-07-20 22:30:49,718 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 10:30:49" (1/1) ... [2022-07-20 22:30:49,724 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-20 22:30:49,773 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-20 22:30:50,010 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-2.c[29656,29669] [2022-07-20 22:30:50,019 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 22:30:50,027 INFO L203 MainTranslator]: Completed pre-run [2022-07-20 22:30:50,109 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-2.c[29656,29669] [2022-07-20 22:30:50,112 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 22:30:50,124 INFO L208 MainTranslator]: Completed translation [2022-07-20 22:30:50,125 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:30:50 WrapperNode [2022-07-20 22:30:50,125 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-20 22:30:50,126 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-20 22:30:50,126 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-20 22:30:50,126 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-20 22:30:50,132 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:30:50" (1/1) ... [2022-07-20 22:30:50,150 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:30:50" (1/1) ... [2022-07-20 22:30:50,191 INFO L137 Inliner]: procedures = 29, calls = 44, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 663 [2022-07-20 22:30:50,191 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-20 22:30:50,192 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-20 22:30:50,192 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-20 22:30:50,192 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-20 22:30:50,199 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:30:50" (1/1) ... [2022-07-20 22:30:50,200 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:30:50" (1/1) ... [2022-07-20 22:30:50,203 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:30:50" (1/1) ... [2022-07-20 22:30:50,203 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:30:50" (1/1) ... [2022-07-20 22:30:50,211 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:30:50" (1/1) ... [2022-07-20 22:30:50,216 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:30:50" (1/1) ... [2022-07-20 22:30:50,218 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:30:50" (1/1) ... [2022-07-20 22:30:50,222 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-20 22:30:50,222 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-20 22:30:50,223 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-20 22:30:50,223 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-20 22:30:50,223 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:30:50" (1/1) ... [2022-07-20 22:30:50,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 22:30:50,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 22:30:50,248 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) [2022-07-20 22:30:50,273 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 [2022-07-20 22:30:50,292 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-20 22:30:50,293 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_Complete [2022-07-20 22:30:50,293 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_Complete [2022-07-20 22:30:50,293 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2022-07-20 22:30:50,293 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2022-07-20 22:30:50,293 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_CreateClose [2022-07-20 22:30:50,293 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_CreateClose [2022-07-20 22:30:50,293 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2022-07-20 22:30:50,294 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2022-07-20 22:30:50,294 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2022-07-20 22:30:50,294 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2022-07-20 22:30:50,294 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-20 22:30:50,294 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2022-07-20 22:30:50,294 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2022-07-20 22:30:50,303 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-20 22:30:50,303 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-20 22:30:50,303 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_DispatchPassThrough [2022-07-20 22:30:50,303 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_DispatchPassThrough [2022-07-20 22:30:50,438 INFO L234 CfgBuilder]: Building ICFG [2022-07-20 22:30:50,444 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-20 22:30:50,539 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-20 22:30:50,544 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-20 22:30:50,546 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-20 22:30:50,550 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-20 22:30:50,552 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-20 22:30:50,878 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume !false; [2022-07-20 22:30:50,878 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##86: assume false; [2022-07-20 22:30:50,878 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##63: assume !false; [2022-07-20 22:30:50,878 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##62: assume false; [2022-07-20 22:30:50,879 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##129: assume false; [2022-07-20 22:30:50,879 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##130: assume !false; [2022-07-20 22:30:50,879 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume false; [2022-07-20 22:30:50,879 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##19: assume !false; [2022-07-20 22:30:50,879 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##113: assume !false; [2022-07-20 22:30:50,879 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##112: assume false; [2022-07-20 22:30:50,888 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-20 22:30:50,916 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##12: assume !false; [2022-07-20 22:30:50,916 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume false; [2022-07-20 22:30:50,921 INFO L275 CfgBuilder]: Performing block encoding [2022-07-20 22:30:50,929 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-20 22:30:50,929 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-20 22:30:50,931 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 10:30:50 BoogieIcfgContainer [2022-07-20 22:30:50,931 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-20 22:30:50,933 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-20 22:30:50,933 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-20 22:30:50,935 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-20 22:30:50,935 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.07 10:30:49" (1/3) ... [2022-07-20 22:30:50,936 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40b78180 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 10:30:50, skipping insertion in model container [2022-07-20 22:30:50,936 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:30:50" (2/3) ... [2022-07-20 22:30:50,936 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40b78180 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 10:30:50, skipping insertion in model container [2022-07-20 22:30:50,936 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 10:30:50" (3/3) ... [2022-07-20 22:30:50,937 INFO L111 eAbstractionObserver]: Analyzing ICFG kbfiltr_simpl2.cil-2.c [2022-07-20 22:30:50,948 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-20 22:30:50,952 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-20 22:30:51,009 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-20 22:30:51,017 INFO L357 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@74e85eec, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1974edec [2022-07-20 22:30:51,017 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-20 22:30:51,022 INFO L276 IsEmpty]: Start isEmpty. Operand has 209 states, 171 states have (on average 1.5964912280701755) internal successors, (273), 189 states have internal predecessors, (273), 29 states have call successors, (29), 7 states have call predecessors, (29), 7 states have return successors, (29), 27 states have call predecessors, (29), 29 states have call successors, (29) [2022-07-20 22:30:51,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-20 22:30:51,035 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:30:51,036 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 22:30:51,036 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:30:51,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:30:51,041 INFO L85 PathProgramCache]: Analyzing trace with hash -809123759, now seen corresponding path program 1 times [2022-07-20 22:30:51,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:30:51,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524132105] [2022-07-20 22:30:51,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:30:51,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:30:51,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:30:51,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 22:30:51,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:30:51,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524132105] [2022-07-20 22:30:51,236 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524132105] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:30:51,237 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:30:51,237 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 22:30:51,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040974898] [2022-07-20 22:30:51,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:30:51,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 22:30:51,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:30:51,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 22:30:51,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 22:30:51,272 INFO L87 Difference]: Start difference. First operand has 209 states, 171 states have (on average 1.5964912280701755) internal successors, (273), 189 states have internal predecessors, (273), 29 states have call successors, (29), 7 states have call predecessors, (29), 7 states have return successors, (29), 27 states have call predecessors, (29), 29 states have call successors, (29) 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) [2022-07-20 22:30:51,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:30:51,371 INFO L93 Difference]: Finished difference Result 340 states and 533 transitions. [2022-07-20 22:30:51,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 22:30:51,373 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 [2022-07-20 22:30:51,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:30:51,384 INFO L225 Difference]: With dead ends: 340 [2022-07-20 22:30:51,384 INFO L226 Difference]: Without dead ends: 201 [2022-07-20 22:30:51,387 INFO L412 NwaCegarLoop]: 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 [2022-07-20 22:30:51,389 INFO L413 NwaCegarLoop]: 309 mSDtfsCounter, 178 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 417 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 [2022-07-20 22:30:51,390 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 417 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 22:30:51,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2022-07-20 22:30:51,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2022-07-20 22:30:51,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 165 states have (on average 1.5272727272727273) internal successors, (252), 181 states have internal predecessors, (252), 29 states have call successors, (29), 7 states have call predecessors, (29), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-07-20 22:30:51,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 296 transitions. [2022-07-20 22:30:51,433 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 296 transitions. Word has length 13 [2022-07-20 22:30:51,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:30:51,434 INFO L495 AbstractCegarLoop]: Abstraction has 201 states and 296 transitions. [2022-07-20 22:30:51,434 INFO L496 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) [2022-07-20 22:30:51,434 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 296 transitions. [2022-07-20 22:30:51,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-20 22:30:51,435 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:30:51,435 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 22:30:51,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-20 22:30:51,436 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:30:51,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:30:51,436 INFO L85 PathProgramCache]: Analyzing trace with hash 705160648, now seen corresponding path program 1 times [2022-07-20 22:30:51,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:30:51,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624278350] [2022-07-20 22:30:51,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:30:51,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:30:51,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:30:51,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 22:30:51,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:30:51,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624278350] [2022-07-20 22:30:51,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624278350] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:30:51,568 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:30:51,568 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 22:30:51,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398265695] [2022-07-20 22:30:51,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:30:51,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 22:30:51,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:30:51,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 22:30:51,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 22:30:51,571 INFO L87 Difference]: Start difference. First operand 201 states and 296 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) [2022-07-20 22:30:51,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:30:51,704 INFO L93 Difference]: Finished difference Result 323 states and 461 transitions. [2022-07-20 22:30:51,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 22:30:51,705 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 [2022-07-20 22:30:51,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:30:51,711 INFO L225 Difference]: With dead ends: 323 [2022-07-20 22:30:51,711 INFO L226 Difference]: Without dead ends: 268 [2022-07-20 22:30:51,715 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 22:30:51,716 INFO L413 NwaCegarLoop]: 331 mSDtfsCounter, 205 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 22:30:51,717 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 440 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 22:30:51,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2022-07-20 22:30:51,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 252. [2022-07-20 22:30:51,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 215 states have (on average 1.4325581395348836) internal successors, (308), 218 states have internal predecessors, (308), 26 states have call successors, (26), 11 states have call predecessors, (26), 10 states have return successors, (27), 25 states have call predecessors, (27), 18 states have call successors, (27) [2022-07-20 22:30:51,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 361 transitions. [2022-07-20 22:30:51,754 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 361 transitions. Word has length 19 [2022-07-20 22:30:51,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:30:51,754 INFO L495 AbstractCegarLoop]: Abstraction has 252 states and 361 transitions. [2022-07-20 22:30:51,755 INFO L496 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) [2022-07-20 22:30:51,755 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 361 transitions. [2022-07-20 22:30:51,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-20 22:30:51,756 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:30:51,756 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 22:30:51,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-20 22:30:51,757 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:30:51,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:30:51,761 INFO L85 PathProgramCache]: Analyzing trace with hash -2016043499, now seen corresponding path program 1 times [2022-07-20 22:30:51,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:30:51,762 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291056710] [2022-07-20 22:30:51,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:30:51,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:30:51,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:30:51,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 22:30:51,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:30:51,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291056710] [2022-07-20 22:30:51,809 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291056710] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:30:51,810 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:30:51,810 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 22:30:51,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496953749] [2022-07-20 22:30:51,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:30:51,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 22:30:51,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:30:51,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 22:30:51,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 22:30:51,812 INFO L87 Difference]: Start difference. First operand 252 states and 361 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) [2022-07-20 22:30:51,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:30:51,836 INFO L93 Difference]: Finished difference Result 411 states and 569 transitions. [2022-07-20 22:30:51,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 22:30:51,837 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 [2022-07-20 22:30:51,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:30:51,839 INFO L225 Difference]: With dead ends: 411 [2022-07-20 22:30:51,840 INFO L226 Difference]: Without dead ends: 312 [2022-07-20 22:30:51,842 INFO L412 NwaCegarLoop]: 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 [2022-07-20 22:30:51,844 INFO L413 NwaCegarLoop]: 272 mSDtfsCounter, 242 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 360 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 [2022-07-20 22:30:51,845 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 360 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 22:30:51,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2022-07-20 22:30:51,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 290. [2022-07-20 22:30:51,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 255 states have (on average 1.419607843137255) internal successors, (362), 256 states have internal predecessors, (362), 22 states have call successors, (22), 11 states have call predecessors, (22), 12 states have return successors, (26), 23 states have call predecessors, (26), 16 states have call successors, (26) [2022-07-20 22:30:51,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 410 transitions. [2022-07-20 22:30:51,861 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 410 transitions. Word has length 18 [2022-07-20 22:30:51,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:30:51,861 INFO L495 AbstractCegarLoop]: Abstraction has 290 states and 410 transitions. [2022-07-20 22:30:51,861 INFO L496 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) [2022-07-20 22:30:51,862 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 410 transitions. [2022-07-20 22:30:51,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-20 22:30:51,868 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:30:51,868 INFO L195 NwaCegarLoop]: 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] [2022-07-20 22:30:51,868 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-20 22:30:51,869 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:30:51,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:30:51,869 INFO L85 PathProgramCache]: Analyzing trace with hash 2075722554, now seen corresponding path program 1 times [2022-07-20 22:30:51,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:30:51,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684375623] [2022-07-20 22:30:51,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:30:51,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:30:51,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:30:51,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 22:30:51,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:30:51,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684375623] [2022-07-20 22:30:51,921 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684375623] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:30:51,921 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:30:51,921 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 22:30:51,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104366585] [2022-07-20 22:30:51,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:30:51,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 22:30:51,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:30:51,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 22:30:51,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 22:30:51,923 INFO L87 Difference]: Start difference. First operand 290 states and 410 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) [2022-07-20 22:30:51,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:30:51,981 INFO L93 Difference]: Finished difference Result 293 states and 412 transitions. [2022-07-20 22:30:51,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 22:30:51,982 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 [2022-07-20 22:30:51,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:30:51,984 INFO L225 Difference]: With dead ends: 293 [2022-07-20 22:30:51,984 INFO L226 Difference]: Without dead ends: 289 [2022-07-20 22:30:51,984 INFO L412 NwaCegarLoop]: 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 [2022-07-20 22:30:51,985 INFO L413 NwaCegarLoop]: 271 mSDtfsCounter, 25 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 22:30:51,986 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 476 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 22:30:51,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2022-07-20 22:30:51,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 289. [2022-07-20 22:30:51,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 255 states have (on average 1.411764705882353) internal successors, (360), 255 states have internal predecessors, (360), 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) [2022-07-20 22:30:52,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 407 transitions. [2022-07-20 22:30:52,001 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 407 transitions. Word has length 29 [2022-07-20 22:30:52,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:30:52,001 INFO L495 AbstractCegarLoop]: Abstraction has 289 states and 407 transitions. [2022-07-20 22:30:52,001 INFO L496 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) [2022-07-20 22:30:52,002 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 407 transitions. [2022-07-20 22:30:52,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-07-20 22:30:52,004 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:30:52,004 INFO L195 NwaCegarLoop]: 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] [2022-07-20 22:30:52,004 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-20 22:30:52,005 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:30:52,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:30:52,005 INFO L85 PathProgramCache]: Analyzing trace with hash -889185583, now seen corresponding path program 1 times [2022-07-20 22:30:52,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:30:52,006 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595558466] [2022-07-20 22:30:52,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:30:52,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:30:52,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:30:52,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 22:30:52,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:30:52,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 22:30:52,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:30:52,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595558466] [2022-07-20 22:30:52,110 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595558466] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:30:52,110 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:30:52,110 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 22:30:52,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637625838] [2022-07-20 22:30:52,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:30:52,111 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 22:30:52,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:30:52,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 22:30:52,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-20 22:30:52,112 INFO L87 Difference]: Start difference. First operand 289 states and 407 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) [2022-07-20 22:30:52,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:30:52,323 INFO L93 Difference]: Finished difference Result 315 states and 437 transitions. [2022-07-20 22:30:52,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 22:30:52,324 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 [2022-07-20 22:30:52,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:30:52,329 INFO L225 Difference]: With dead ends: 315 [2022-07-20 22:30:52,329 INFO L226 Difference]: Without dead ends: 306 [2022-07-20 22:30:52,329 INFO L412 NwaCegarLoop]: 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 [2022-07-20 22:30:52,331 INFO L413 NwaCegarLoop]: 255 mSDtfsCounter, 323 mSDsluCounter, 568 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 325 SdHoareTripleChecker+Valid, 823 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 22:30:52,331 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [325 Valid, 823 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-20 22:30:52,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2022-07-20 22:30:52,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 301. [2022-07-20 22:30:52,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 267 states have (on average 1.404494382022472) internal successors, (375), 266 states have internal predecessors, (375), 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) [2022-07-20 22:30:52,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 422 transitions. [2022-07-20 22:30:52,347 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 422 transitions. Word has length 33 [2022-07-20 22:30:52,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:30:52,347 INFO L495 AbstractCegarLoop]: Abstraction has 301 states and 422 transitions. [2022-07-20 22:30:52,348 INFO L496 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) [2022-07-20 22:30:52,348 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 422 transitions. [2022-07-20 22:30:52,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-20 22:30:52,349 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:30:52,350 INFO L195 NwaCegarLoop]: 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] [2022-07-20 22:30:52,350 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-20 22:30:52,350 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:30:52,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:30:52,351 INFO L85 PathProgramCache]: Analyzing trace with hash 2121154083, now seen corresponding path program 1 times [2022-07-20 22:30:52,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:30:52,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499331473] [2022-07-20 22:30:52,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:30:52,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:30:52,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:30:52,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 22:30:52,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:30:52,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 22:30:52,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:30:52,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499331473] [2022-07-20 22:30:52,448 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499331473] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:30:52,449 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:30:52,449 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 22:30:52,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122957837] [2022-07-20 22:30:52,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:30:52,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 22:30:52,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:30:52,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 22:30:52,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-20 22:30:52,451 INFO L87 Difference]: Start difference. First operand 301 states and 422 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) [2022-07-20 22:30:52,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:30:52,623 INFO L93 Difference]: Finished difference Result 311 states and 430 transitions. [2022-07-20 22:30:52,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 22:30:52,624 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 [2022-07-20 22:30:52,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:30:52,626 INFO L225 Difference]: With dead ends: 311 [2022-07-20 22:30:52,627 INFO L226 Difference]: Without dead ends: 306 [2022-07-20 22:30:52,627 INFO L412 NwaCegarLoop]: 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 [2022-07-20 22:30:52,629 INFO L413 NwaCegarLoop]: 255 mSDtfsCounter, 331 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 632 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 22:30:52,629 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [333 Valid, 632 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 22:30:52,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2022-07-20 22:30:52,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 301. [2022-07-20 22:30:52,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 267 states have (on average 1.400749063670412) internal successors, (374), 266 states have internal predecessors, (374), 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) [2022-07-20 22:30:52,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 421 transitions. [2022-07-20 22:30:52,650 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 421 transitions. Word has length 34 [2022-07-20 22:30:52,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:30:52,651 INFO L495 AbstractCegarLoop]: Abstraction has 301 states and 421 transitions. [2022-07-20 22:30:52,651 INFO L496 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) [2022-07-20 22:30:52,651 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 421 transitions. [2022-07-20 22:30:52,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-20 22:30:52,652 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:30:52,653 INFO L195 NwaCegarLoop]: 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] [2022-07-20 22:30:52,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-20 22:30:52,653 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:30:52,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:30:52,654 INFO L85 PathProgramCache]: Analyzing trace with hash -1780979361, now seen corresponding path program 1 times [2022-07-20 22:30:52,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:30:52,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549813172] [2022-07-20 22:30:52,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:30:52,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:30:52,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:30:52,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 22:30:52,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:30:52,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 22:30:52,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:30:52,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549813172] [2022-07-20 22:30:52,710 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549813172] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:30:52,710 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:30:52,710 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-20 22:30:52,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555987444] [2022-07-20 22:30:52,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:30:52,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 22:30:52,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:30:52,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 22:30:52,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-20 22:30:52,712 INFO L87 Difference]: Start difference. First operand 301 states and 421 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) [2022-07-20 22:30:52,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:30:52,850 INFO L93 Difference]: Finished difference Result 340 states and 460 transitions. [2022-07-20 22:30:52,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-20 22:30:52,851 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 [2022-07-20 22:30:52,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:30:52,853 INFO L225 Difference]: With dead ends: 340 [2022-07-20 22:30:52,853 INFO L226 Difference]: Without dead ends: 282 [2022-07-20 22:30:52,853 INFO L412 NwaCegarLoop]: 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 [2022-07-20 22:30:52,854 INFO L413 NwaCegarLoop]: 292 mSDtfsCounter, 317 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 739 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 22:30:52,854 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [317 Valid, 739 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 22:30:52,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2022-07-20 22:30:52,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 268. [2022-07-20 22:30:52,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 236 states have (on average 1.3898305084745763) internal successors, (328), 235 states have internal predecessors, (328), 19 states have call successors, (19), 10 states have call predecessors, (19), 12 states have return successors, (23), 22 states have call predecessors, (23), 14 states have call successors, (23) [2022-07-20 22:30:52,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 370 transitions. [2022-07-20 22:30:52,868 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 370 transitions. Word has length 34 [2022-07-20 22:30:52,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:30:52,868 INFO L495 AbstractCegarLoop]: Abstraction has 268 states and 370 transitions. [2022-07-20 22:30:52,868 INFO L496 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) [2022-07-20 22:30:52,869 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 370 transitions. [2022-07-20 22:30:52,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-20 22:30:52,870 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:30:52,870 INFO L195 NwaCegarLoop]: 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] [2022-07-20 22:30:52,870 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-20 22:30:52,870 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:30:52,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:30:52,871 INFO L85 PathProgramCache]: Analyzing trace with hash -2069817079, now seen corresponding path program 1 times [2022-07-20 22:30:52,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:30:52,871 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836566768] [2022-07-20 22:30:52,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:30:52,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:30:52,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:30:52,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 22:30:52,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:30:52,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836566768] [2022-07-20 22:30:52,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836566768] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:30:52,900 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:30:52,900 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 22:30:52,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879943341] [2022-07-20 22:30:52,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:30:52,900 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 22:30:52,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:30:52,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 22:30:52,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 22:30:52,901 INFO L87 Difference]: Start difference. First operand 268 states and 370 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) [2022-07-20 22:30:53,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:30:53,003 INFO L93 Difference]: Finished difference Result 329 states and 444 transitions. [2022-07-20 22:30:53,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 22:30:53,004 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 [2022-07-20 22:30:53,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:30:53,005 INFO L225 Difference]: With dead ends: 329 [2022-07-20 22:30:53,005 INFO L226 Difference]: Without dead ends: 290 [2022-07-20 22:30:53,006 INFO L412 NwaCegarLoop]: 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 [2022-07-20 22:30:53,008 INFO L413 NwaCegarLoop]: 250 mSDtfsCounter, 296 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 22:30:53,009 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 430 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 22:30:53,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2022-07-20 22:30:53,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 268. [2022-07-20 22:30:53,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 236 states have (on average 1.38135593220339) internal successors, (326), 235 states have internal predecessors, (326), 19 states have call successors, (19), 10 states have call predecessors, (19), 12 states have return successors, (23), 22 states have call predecessors, (23), 14 states have call successors, (23) [2022-07-20 22:30:53,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 368 transitions. [2022-07-20 22:30:53,025 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 368 transitions. Word has length 34 [2022-07-20 22:30:53,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:30:53,026 INFO L495 AbstractCegarLoop]: Abstraction has 268 states and 368 transitions. [2022-07-20 22:30:53,026 INFO L496 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) [2022-07-20 22:30:53,026 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 368 transitions. [2022-07-20 22:30:53,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-20 22:30:53,027 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:30:53,027 INFO L195 NwaCegarLoop]: 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] [2022-07-20 22:30:53,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-20 22:30:53,028 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:30:53,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:30:53,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1120484039, now seen corresponding path program 1 times [2022-07-20 22:30:53,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:30:53,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646533579] [2022-07-20 22:30:53,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:30:53,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:30:53,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:30:53,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 22:30:53,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:30:53,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 22:30:53,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:30:53,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646533579] [2022-07-20 22:30:53,086 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646533579] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:30:53,086 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:30:53,087 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 22:30:53,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652370604] [2022-07-20 22:30:53,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:30:53,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 22:30:53,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:30:53,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 22:30:53,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 22:30:53,090 INFO L87 Difference]: Start difference. First operand 268 states and 368 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) [2022-07-20 22:30:53,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:30:53,167 INFO L93 Difference]: Finished difference Result 286 states and 390 transitions. [2022-07-20 22:30:53,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 22:30:53,167 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 [2022-07-20 22:30:53,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:30:53,169 INFO L225 Difference]: With dead ends: 286 [2022-07-20 22:30:53,169 INFO L226 Difference]: Without dead ends: 232 [2022-07-20 22:30:53,169 INFO L412 NwaCegarLoop]: 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 [2022-07-20 22:30:53,171 INFO L413 NwaCegarLoop]: 247 mSDtfsCounter, 289 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 22:30:53,172 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 425 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 22:30:53,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2022-07-20 22:30:53,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 210. [2022-07-20 22:30:53,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 186 states have (on average 1.39247311827957) internal successors, (259), 189 states have internal predecessors, (259), 16 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (12), 12 states have call predecessors, (12), 11 states have call successors, (12) [2022-07-20 22:30:53,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 287 transitions. [2022-07-20 22:30:53,187 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 287 transitions. Word has length 35 [2022-07-20 22:30:53,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:30:53,189 INFO L495 AbstractCegarLoop]: Abstraction has 210 states and 287 transitions. [2022-07-20 22:30:53,189 INFO L496 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) [2022-07-20 22:30:53,189 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 287 transitions. [2022-07-20 22:30:53,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-20 22:30:53,190 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:30:53,191 INFO L195 NwaCegarLoop]: 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] [2022-07-20 22:30:53,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-20 22:30:53,191 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:30:53,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:30:53,192 INFO L85 PathProgramCache]: Analyzing trace with hash -152990302, now seen corresponding path program 1 times [2022-07-20 22:30:53,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:30:53,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627201592] [2022-07-20 22:30:53,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:30:53,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:30:53,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:30:53,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-20 22:30:53,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:30:53,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-20 22:30:53,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:30:53,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 22:30:53,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:30:53,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627201592] [2022-07-20 22:30:53,248 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627201592] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:30:53,248 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:30:53,248 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-20 22:30:53,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173114896] [2022-07-20 22:30:53,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:30:53,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 22:30:53,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:30:53,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 22:30:53,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-20 22:30:53,251 INFO L87 Difference]: Start difference. First operand 210 states and 287 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) [2022-07-20 22:30:53,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:30:53,372 INFO L93 Difference]: Finished difference Result 234 states and 316 transitions. [2022-07-20 22:30:53,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-20 22:30:53,373 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 [2022-07-20 22:30:53,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:30:53,375 INFO L225 Difference]: With dead ends: 234 [2022-07-20 22:30:53,375 INFO L226 Difference]: Without dead ends: 208 [2022-07-20 22:30:53,375 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-20 22:30:53,376 INFO L413 NwaCegarLoop]: 246 mSDtfsCounter, 84 mSDsluCounter, 570 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 816 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 22:30:53,377 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 816 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 22:30:53,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2022-07-20 22:30:53,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 208. [2022-07-20 22:30:53,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 185 states have (on average 1.3837837837837839) internal successors, (256), 187 states have internal predecessors, (256), 15 states have call successors, (15), 8 states have call predecessors, (15), 7 states have return successors, (12), 12 states have call predecessors, (12), 11 states have call successors, (12) [2022-07-20 22:30:53,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 283 transitions. [2022-07-20 22:30:53,388 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 283 transitions. Word has length 39 [2022-07-20 22:30:53,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:30:53,388 INFO L495 AbstractCegarLoop]: Abstraction has 208 states and 283 transitions. [2022-07-20 22:30:53,388 INFO L496 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) [2022-07-20 22:30:53,388 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 283 transitions. [2022-07-20 22:30:53,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-20 22:30:53,390 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:30:53,390 INFO L195 NwaCegarLoop]: 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] [2022-07-20 22:30:53,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-20 22:30:53,391 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:30:53,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:30:53,391 INFO L85 PathProgramCache]: Analyzing trace with hash 143802695, now seen corresponding path program 1 times [2022-07-20 22:30:53,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:30:53,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912782974] [2022-07-20 22:30:53,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:30:53,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:30:53,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:30:53,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 22:30:53,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:30:53,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912782974] [2022-07-20 22:30:53,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912782974] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:30:53,442 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:30:53,442 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 22:30:53,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020921788] [2022-07-20 22:30:53,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:30:53,443 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 22:30:53,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:30:53,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 22:30:53,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 22:30:53,444 INFO L87 Difference]: Start difference. First operand 208 states and 283 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 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) [2022-07-20 22:30:53,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:30:53,505 INFO L93 Difference]: Finished difference Result 220 states and 295 transitions. [2022-07-20 22:30:53,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 22:30:53,505 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 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 37 [2022-07-20 22:30:53,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:30:53,507 INFO L225 Difference]: With dead ends: 220 [2022-07-20 22:30:53,507 INFO L226 Difference]: Without dead ends: 186 [2022-07-20 22:30:53,508 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-20 22:30:53,508 INFO L413 NwaCegarLoop]: 244 mSDtfsCounter, 36 mSDsluCounter, 922 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 1166 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 22:30:53,509 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 1166 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 22:30:53,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2022-07-20 22:30:53,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2022-07-20 22:30:53,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 163 states have (on average 1.3742331288343559) internal successors, (224), 165 states have internal predecessors, (224), 15 states have call successors, (15), 8 states have call predecessors, (15), 7 states have return successors, (12), 12 states have call predecessors, (12), 11 states have call successors, (12) [2022-07-20 22:30:53,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 251 transitions. [2022-07-20 22:30:53,519 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 251 transitions. Word has length 37 [2022-07-20 22:30:53,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:30:53,519 INFO L495 AbstractCegarLoop]: Abstraction has 186 states and 251 transitions. [2022-07-20 22:30:53,520 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 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) [2022-07-20 22:30:53,520 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 251 transitions. [2022-07-20 22:30:53,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-20 22:30:53,521 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:30:53,521 INFO L195 NwaCegarLoop]: 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] [2022-07-20 22:30:53,521 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-20 22:30:53,521 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:30:53,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:30:53,522 INFO L85 PathProgramCache]: Analyzing trace with hash 793066956, now seen corresponding path program 1 times [2022-07-20 22:30:53,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:30:53,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767423520] [2022-07-20 22:30:53,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:30:53,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:30:53,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:30:53,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 22:30:53,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:30:53,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 22:30:53,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:30:53,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 22:30:53,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:30:53,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767423520] [2022-07-20 22:30:53,620 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767423520] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:30:53,620 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:30:53,620 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-20 22:30:53,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812834107] [2022-07-20 22:30:53,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:30:53,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-20 22:30:53,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:30:53,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-20 22:30:53,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-20 22:30:53,621 INFO L87 Difference]: Start difference. First operand 186 states and 251 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) [2022-07-20 22:30:53,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:30:53,761 INFO L93 Difference]: Finished difference Result 267 states and 354 transitions. [2022-07-20 22:30:53,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-20 22:30:53,762 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 [2022-07-20 22:30:53,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:30:53,763 INFO L225 Difference]: With dead ends: 267 [2022-07-20 22:30:53,764 INFO L226 Difference]: Without dead ends: 204 [2022-07-20 22:30:53,764 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-07-20 22:30:53,765 INFO L413 NwaCegarLoop]: 203 mSDtfsCounter, 88 mSDsluCounter, 937 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 1140 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 22:30:53,765 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 1140 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 22:30:53,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2022-07-20 22:30:53,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 194. [2022-07-20 22:30:53,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 170 states have (on average 1.3647058823529412) internal successors, (232), 172 states have internal predecessors, (232), 15 states have call successors, (15), 8 states have call predecessors, (15), 8 states have return successors, (13), 13 states have call predecessors, (13), 11 states have call successors, (13) [2022-07-20 22:30:53,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 260 transitions. [2022-07-20 22:30:53,777 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 260 transitions. Word has length 41 [2022-07-20 22:30:53,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:30:53,777 INFO L495 AbstractCegarLoop]: Abstraction has 194 states and 260 transitions. [2022-07-20 22:30:53,777 INFO L496 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) [2022-07-20 22:30:53,778 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 260 transitions. [2022-07-20 22:30:53,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-20 22:30:53,778 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:30:53,779 INFO L195 NwaCegarLoop]: 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] [2022-07-20 22:30:53,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-20 22:30:53,779 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:30:53,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:30:53,779 INFO L85 PathProgramCache]: Analyzing trace with hash 493706385, now seen corresponding path program 1 times [2022-07-20 22:30:53,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:30:53,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598858587] [2022-07-20 22:30:53,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:30:53,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:30:53,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:30:53,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 22:30:53,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:30:53,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 22:30:53,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:30:53,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 22:30:53,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:30:53,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598858587] [2022-07-20 22:30:53,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598858587] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:30:53,849 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:30:53,849 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-20 22:30:53,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497380738] [2022-07-20 22:30:53,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:30:53,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-20 22:30:53,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:30:53,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-20 22:30:53,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-20 22:30:53,850 INFO L87 Difference]: Start difference. First operand 194 states and 260 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) [2022-07-20 22:30:54,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:30:54,036 INFO L93 Difference]: Finished difference Result 221 states and 292 transitions. [2022-07-20 22:30:54,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-20 22:30:54,036 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 [2022-07-20 22:30:54,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:30:54,038 INFO L225 Difference]: With dead ends: 221 [2022-07-20 22:30:54,038 INFO L226 Difference]: Without dead ends: 214 [2022-07-20 22:30:54,038 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2022-07-20 22:30:54,039 INFO L413 NwaCegarLoop]: 214 mSDtfsCounter, 119 mSDsluCounter, 1058 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 1272 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 22:30:54,039 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 1272 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 22:30:54,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2022-07-20 22:30:54,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 195. [2022-07-20 22:30:54,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 171 states have (on average 1.3625730994152048) internal successors, (233), 173 states have internal predecessors, (233), 15 states have call successors, (15), 8 states have call predecessors, (15), 8 states have return successors, (13), 13 states have call predecessors, (13), 11 states have call successors, (13) [2022-07-20 22:30:54,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 261 transitions. [2022-07-20 22:30:54,054 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 261 transitions. Word has length 43 [2022-07-20 22:30:54,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:30:54,055 INFO L495 AbstractCegarLoop]: Abstraction has 195 states and 261 transitions. [2022-07-20 22:30:54,055 INFO L496 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) [2022-07-20 22:30:54,055 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 261 transitions. [2022-07-20 22:30:54,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-20 22:30:54,056 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:30:54,056 INFO L195 NwaCegarLoop]: 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] [2022-07-20 22:30:54,056 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-20 22:30:54,056 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:30:54,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:30:54,057 INFO L85 PathProgramCache]: Analyzing trace with hash 149096210, now seen corresponding path program 1 times [2022-07-20 22:30:54,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:30:54,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937216066] [2022-07-20 22:30:54,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:30:54,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:30:54,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:30:54,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 22:30:54,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:30:54,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 22:30:54,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:30:54,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 22:30:54,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:30:54,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937216066] [2022-07-20 22:30:54,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937216066] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:30:54,094 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:30:54,094 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-20 22:30:54,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459590262] [2022-07-20 22:30:54,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:30:54,095 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 22:30:54,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:30:54,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 22:30:54,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-20 22:30:54,096 INFO L87 Difference]: Start difference. First operand 195 states and 261 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) [2022-07-20 22:30:54,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:30:54,175 INFO L93 Difference]: Finished difference Result 211 states and 278 transitions. [2022-07-20 22:30:54,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-20 22:30:54,176 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 [2022-07-20 22:30:54,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:30:54,177 INFO L225 Difference]: With dead ends: 211 [2022-07-20 22:30:54,177 INFO L226 Difference]: Without dead ends: 206 [2022-07-20 22:30:54,178 INFO L412 NwaCegarLoop]: 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 [2022-07-20 22:30:54,178 INFO L413 NwaCegarLoop]: 216 mSDtfsCounter, 81 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 559 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 22:30:54,178 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 559 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 22:30:54,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2022-07-20 22:30:54,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 197. [2022-07-20 22:30:54,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 173 states have (on average 1.3526011560693643) internal successors, (234), 175 states have internal predecessors, (234), 15 states have call successors, (15), 8 states have call predecessors, (15), 8 states have return successors, (13), 13 states have call predecessors, (13), 11 states have call successors, (13) [2022-07-20 22:30:54,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 262 transitions. [2022-07-20 22:30:54,188 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 262 transitions. Word has length 42 [2022-07-20 22:30:54,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:30:54,189 INFO L495 AbstractCegarLoop]: Abstraction has 197 states and 262 transitions. [2022-07-20 22:30:54,189 INFO L496 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) [2022-07-20 22:30:54,189 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 262 transitions. [2022-07-20 22:30:54,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-20 22:30:54,190 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:30:54,190 INFO L195 NwaCegarLoop]: 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] [2022-07-20 22:30:54,190 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-20 22:30:54,190 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:30:54,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:30:54,191 INFO L85 PathProgramCache]: Analyzing trace with hash 423879184, now seen corresponding path program 1 times [2022-07-20 22:30:54,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:30:54,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569215873] [2022-07-20 22:30:54,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:30:54,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:30:54,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:30:54,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 22:30:54,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:30:54,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 22:30:54,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:30:54,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 22:30:54,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:30:54,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569215873] [2022-07-20 22:30:54,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569215873] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:30:54,228 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:30:54,228 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-20 22:30:54,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956443690] [2022-07-20 22:30:54,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:30:54,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 22:30:54,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:30:54,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 22:30:54,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-20 22:30:54,230 INFO L87 Difference]: Start difference. First operand 197 states and 262 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) [2022-07-20 22:30:54,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:30:54,346 INFO L93 Difference]: Finished difference Result 386 states and 514 transitions. [2022-07-20 22:30:54,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 22:30:54,346 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 [2022-07-20 22:30:54,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:30:54,348 INFO L225 Difference]: With dead ends: 386 [2022-07-20 22:30:54,348 INFO L226 Difference]: Without dead ends: 379 [2022-07-20 22:30:54,349 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-07-20 22:30:54,349 INFO L413 NwaCegarLoop]: 223 mSDtfsCounter, 300 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 592 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 22:30:54,350 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [305 Valid, 592 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 22:30:54,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2022-07-20 22:30:54,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 344. [2022-07-20 22:30:54,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 305 states have (on average 1.380327868852459) internal successors, (421), 312 states have internal predecessors, (421), 23 states have call successors, (23), 13 states have call predecessors, (23), 15 states have return successors, (23), 18 states have call predecessors, (23), 19 states have call successors, (23) [2022-07-20 22:30:54,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 467 transitions. [2022-07-20 22:30:54,367 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 467 transitions. Word has length 44 [2022-07-20 22:30:54,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:30:54,367 INFO L495 AbstractCegarLoop]: Abstraction has 344 states and 467 transitions. [2022-07-20 22:30:54,368 INFO L496 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) [2022-07-20 22:30:54,368 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 467 transitions. [2022-07-20 22:30:54,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-20 22:30:54,369 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:30:54,369 INFO L195 NwaCegarLoop]: 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] [2022-07-20 22:30:54,369 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-20 22:30:54,370 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:30:54,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:30:54,370 INFO L85 PathProgramCache]: Analyzing trace with hash -2096080750, now seen corresponding path program 1 times [2022-07-20 22:30:54,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:30:54,370 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888502500] [2022-07-20 22:30:54,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:30:54,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:30:54,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:30:54,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 22:30:54,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:30:54,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 22:30:54,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:30:54,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 22:30:54,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:30:54,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888502500] [2022-07-20 22:30:54,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888502500] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:30:54,433 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:30:54,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-20 22:30:54,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789473915] [2022-07-20 22:30:54,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:30:54,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-20 22:30:54,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:30:54,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-20 22:30:54,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-20 22:30:54,435 INFO L87 Difference]: Start difference. First operand 344 states and 467 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) [2022-07-20 22:30:54,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:30:54,536 INFO L93 Difference]: Finished difference Result 404 states and 537 transitions. [2022-07-20 22:30:54,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 22:30:54,537 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 [2022-07-20 22:30:54,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:30:54,539 INFO L225 Difference]: With dead ends: 404 [2022-07-20 22:30:54,539 INFO L226 Difference]: Without dead ends: 332 [2022-07-20 22:30:54,539 INFO L412 NwaCegarLoop]: 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 [2022-07-20 22:30:54,540 INFO L413 NwaCegarLoop]: 219 mSDtfsCounter, 53 mSDsluCounter, 919 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 1138 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 22:30:54,540 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 1138 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 22:30:54,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2022-07-20 22:30:54,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 332. [2022-07-20 22:30:54,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 293 states have (on average 1.3754266211604096) internal successors, (403), 300 states have internal predecessors, (403), 23 states have call successors, (23), 13 states have call predecessors, (23), 15 states have return successors, (23), 18 states have call predecessors, (23), 19 states have call successors, (23) [2022-07-20 22:30:54,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 449 transitions. [2022-07-20 22:30:54,561 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 449 transitions. Word has length 44 [2022-07-20 22:30:54,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:30:54,561 INFO L495 AbstractCegarLoop]: Abstraction has 332 states and 449 transitions. [2022-07-20 22:30:54,561 INFO L496 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) [2022-07-20 22:30:54,562 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 449 transitions. [2022-07-20 22:30:54,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-20 22:30:54,563 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:30:54,563 INFO L195 NwaCegarLoop]: 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] [2022-07-20 22:30:54,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-20 22:30:54,563 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:30:54,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:30:54,564 INFO L85 PathProgramCache]: Analyzing trace with hash 1891894546, now seen corresponding path program 1 times [2022-07-20 22:30:54,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:30:54,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132858960] [2022-07-20 22:30:54,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:30:54,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:30:54,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:30:54,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 22:30:54,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:30:54,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 22:30:54,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:30:54,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132858960] [2022-07-20 22:30:54,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132858960] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:30:54,624 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:30:54,624 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-20 22:30:54,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482976027] [2022-07-20 22:30:54,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:30:54,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-20 22:30:54,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:30:54,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-20 22:30:54,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-20 22:30:54,625 INFO L87 Difference]: Start difference. First operand 332 states and 449 transitions. Second operand has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 6 states have internal predecessors, (39), 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) [2022-07-20 22:30:54,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:30:54,778 INFO L93 Difference]: Finished difference Result 368 states and 493 transitions. [2022-07-20 22:30:54,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 22:30:54,779 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 6 states have internal predecessors, (39), 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 42 [2022-07-20 22:30:54,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:30:54,780 INFO L225 Difference]: With dead ends: 368 [2022-07-20 22:30:54,780 INFO L226 Difference]: Without dead ends: 328 [2022-07-20 22:30:54,781 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-07-20 22:30:54,781 INFO L413 NwaCegarLoop]: 200 mSDtfsCounter, 244 mSDsluCounter, 620 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 820 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 22:30:54,782 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 820 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 22:30:54,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2022-07-20 22:30:54,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 324. [2022-07-20 22:30:54,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 285 states have (on average 1.3649122807017544) internal successors, (389), 292 states have internal predecessors, (389), 23 states have call successors, (23), 13 states have call predecessors, (23), 15 states have return successors, (23), 18 states have call predecessors, (23), 19 states have call successors, (23) [2022-07-20 22:30:54,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 435 transitions. [2022-07-20 22:30:54,799 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 435 transitions. Word has length 42 [2022-07-20 22:30:54,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:30:54,799 INFO L495 AbstractCegarLoop]: Abstraction has 324 states and 435 transitions. [2022-07-20 22:30:54,799 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 6 states have internal predecessors, (39), 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) [2022-07-20 22:30:54,799 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 435 transitions. [2022-07-20 22:30:54,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-20 22:30:54,800 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:30:54,800 INFO L195 NwaCegarLoop]: 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] [2022-07-20 22:30:54,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-20 22:30:54,801 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:30:54,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:30:54,801 INFO L85 PathProgramCache]: Analyzing trace with hash 2035173904, now seen corresponding path program 1 times [2022-07-20 22:30:54,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:30:54,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414750338] [2022-07-20 22:30:54,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:30:54,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:30:54,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:30:54,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 22:30:54,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:30:54,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 22:30:54,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:30:54,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414750338] [2022-07-20 22:30:54,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414750338] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:30:54,866 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:30:54,866 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-20 22:30:54,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329206346] [2022-07-20 22:30:54,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:30:54,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-20 22:30:54,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:30:54,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-20 22:30:54,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-20 22:30:54,867 INFO L87 Difference]: Start difference. First operand 324 states and 435 transitions. Second operand has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 7 states have internal predecessors, (39), 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) [2022-07-20 22:30:55,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:30:55,029 INFO L93 Difference]: Finished difference Result 338 states and 449 transitions. [2022-07-20 22:30:55,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-20 22:30:55,029 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 7 states have internal predecessors, (39), 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 42 [2022-07-20 22:30:55,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:30:55,031 INFO L225 Difference]: With dead ends: 338 [2022-07-20 22:30:55,031 INFO L226 Difference]: Without dead ends: 315 [2022-07-20 22:30:55,031 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-07-20 22:30:55,032 INFO L413 NwaCegarLoop]: 204 mSDtfsCounter, 52 mSDsluCounter, 1234 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 1438 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 22:30:55,032 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 1438 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 22:30:55,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2022-07-20 22:30:55,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 315. [2022-07-20 22:30:55,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 278 states have (on average 1.3669064748201438) internal successors, (380), 284 states have internal predecessors, (380), 21 states have call successors, (21), 13 states have call predecessors, (21), 15 states have return successors, (21), 17 states have call predecessors, (21), 17 states have call successors, (21) [2022-07-20 22:30:55,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 422 transitions. [2022-07-20 22:30:55,048 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 422 transitions. Word has length 42 [2022-07-20 22:30:55,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:30:55,048 INFO L495 AbstractCegarLoop]: Abstraction has 315 states and 422 transitions. [2022-07-20 22:30:55,048 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 7 states have internal predecessors, (39), 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) [2022-07-20 22:30:55,048 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 422 transitions. [2022-07-20 22:30:55,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-20 22:30:55,049 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:30:55,049 INFO L195 NwaCegarLoop]: 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] [2022-07-20 22:30:55,049 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-20 22:30:55,050 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:30:55,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:30:55,050 INFO L85 PathProgramCache]: Analyzing trace with hash 688199024, now seen corresponding path program 1 times [2022-07-20 22:30:55,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:30:55,050 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700396850] [2022-07-20 22:30:55,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:30:55,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:30:55,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:30:55,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 22:30:55,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:30:55,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-20 22:30:55,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:30:55,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 22:30:55,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:30:55,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700396850] [2022-07-20 22:30:55,080 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700396850] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:30:55,080 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:30:55,080 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 22:30:55,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213050061] [2022-07-20 22:30:55,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:30:55,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 22:30:55,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:30:55,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 22:30:55,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 22:30:55,081 INFO L87 Difference]: Start difference. First operand 315 states and 422 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-20 22:30:55,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:30:55,142 INFO L93 Difference]: Finished difference Result 375 states and 486 transitions. [2022-07-20 22:30:55,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 22:30:55,143 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 48 [2022-07-20 22:30:55,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:30:55,144 INFO L225 Difference]: With dead ends: 375 [2022-07-20 22:30:55,144 INFO L226 Difference]: Without dead ends: 313 [2022-07-20 22:30:55,145 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 22:30:55,145 INFO L413 NwaCegarLoop]: 203 mSDtfsCounter, 26 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 541 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 22:30:55,146 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 541 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 22:30:55,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2022-07-20 22:30:55,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 313. [2022-07-20 22:30:55,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 276 states have (on average 1.3405797101449275) internal successors, (370), 282 states have internal predecessors, (370), 21 states have call successors, (21), 13 states have call predecessors, (21), 15 states have return successors, (21), 17 states have call predecessors, (21), 17 states have call successors, (21) [2022-07-20 22:30:55,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 412 transitions. [2022-07-20 22:30:55,161 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 412 transitions. Word has length 48 [2022-07-20 22:30:55,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:30:55,161 INFO L495 AbstractCegarLoop]: Abstraction has 313 states and 412 transitions. [2022-07-20 22:30:55,161 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-20 22:30:55,161 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 412 transitions. [2022-07-20 22:30:55,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-07-20 22:30:55,163 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:30:55,163 INFO L195 NwaCegarLoop]: 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] [2022-07-20 22:30:55,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-20 22:30:55,163 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:30:55,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:30:55,164 INFO L85 PathProgramCache]: Analyzing trace with hash -1404526372, now seen corresponding path program 1 times [2022-07-20 22:30:55,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:30:55,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987781408] [2022-07-20 22:30:55,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:30:55,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:30:55,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:30:55,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-20 22:30:55,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:30:55,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-20 22:30:55,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:30:55,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 22:30:55,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:30:55,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987781408] [2022-07-20 22:30:55,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987781408] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:30:55,247 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:30:55,247 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-20 22:30:55,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321516522] [2022-07-20 22:30:55,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:30:55,248 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-20 22:30:55,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:30:55,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-20 22:30:55,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-07-20 22:30:55,249 INFO L87 Difference]: Start difference. First operand 313 states and 412 transitions. Second operand has 10 states, 10 states have (on average 4.4) internal successors, (44), 7 states have internal predecessors, (44), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-20 22:30:55,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:30:55,409 INFO L93 Difference]: Finished difference Result 325 states and 424 transitions. [2022-07-20 22:30:55,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-20 22:30:55,409 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 7 states have internal predecessors, (44), 2 states have call successors, (3), 2 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 49 [2022-07-20 22:30:55,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:30:55,411 INFO L225 Difference]: With dead ends: 325 [2022-07-20 22:30:55,411 INFO L226 Difference]: Without dead ends: 262 [2022-07-20 22:30:55,411 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2022-07-20 22:30:55,412 INFO L413 NwaCegarLoop]: 201 mSDtfsCounter, 41 mSDsluCounter, 1371 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 1572 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 22:30:55,412 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 1572 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 22:30:55,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2022-07-20 22:30:55,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 262. [2022-07-20 22:30:55,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 229 states have (on average 1.314410480349345) internal successors, (301), 234 states have internal predecessors, (301), 18 states have call successors, (18), 12 states have call predecessors, (18), 14 states have return successors, (18), 15 states have call predecessors, (18), 14 states have call successors, (18) [2022-07-20 22:30:55,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 337 transitions. [2022-07-20 22:30:55,425 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 337 transitions. Word has length 49 [2022-07-20 22:30:55,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:30:55,425 INFO L495 AbstractCegarLoop]: Abstraction has 262 states and 337 transitions. [2022-07-20 22:30:55,425 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 7 states have internal predecessors, (44), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-20 22:30:55,425 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 337 transitions. [2022-07-20 22:30:55,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-20 22:30:55,426 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:30:55,426 INFO L195 NwaCegarLoop]: 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] [2022-07-20 22:30:55,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-20 22:30:55,427 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:30:55,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:30:55,427 INFO L85 PathProgramCache]: Analyzing trace with hash 128898727, now seen corresponding path program 1 times [2022-07-20 22:30:55,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:30:55,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424328313] [2022-07-20 22:30:55,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:30:55,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:30:55,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:30:55,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-20 22:30:55,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:30:55,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 22:30:55,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:30:55,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424328313] [2022-07-20 22:30:55,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424328313] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:30:55,489 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:30:55,489 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-20 22:30:55,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715058975] [2022-07-20 22:30:55,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:30:55,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-20 22:30:55,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:30:55,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-20 22:30:55,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-20 22:30:55,491 INFO L87 Difference]: Start difference. First operand 262 states and 337 transitions. Second operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 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) [2022-07-20 22:30:55,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:30:55,710 INFO L93 Difference]: Finished difference Result 319 states and 399 transitions. [2022-07-20 22:30:55,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-20 22:30:55,711 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 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 43 [2022-07-20 22:30:55,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:30:55,712 INFO L225 Difference]: With dead ends: 319 [2022-07-20 22:30:55,712 INFO L226 Difference]: Without dead ends: 304 [2022-07-20 22:30:55,713 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2022-07-20 22:30:55,713 INFO L413 NwaCegarLoop]: 156 mSDtfsCounter, 325 mSDsluCounter, 560 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 325 SdHoareTripleChecker+Valid, 716 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 22:30:55,714 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [325 Valid, 716 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 22:30:55,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2022-07-20 22:30:55,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 274. [2022-07-20 22:30:55,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 239 states have (on average 1.301255230125523) internal successors, (311), 246 states have internal predecessors, (311), 18 states have call successors, (18), 12 states have call predecessors, (18), 16 states have return successors, (21), 15 states have call predecessors, (21), 14 states have call successors, (21) [2022-07-20 22:30:55,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 350 transitions. [2022-07-20 22:30:55,728 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 350 transitions. Word has length 43 [2022-07-20 22:30:55,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:30:55,729 INFO L495 AbstractCegarLoop]: Abstraction has 274 states and 350 transitions. [2022-07-20 22:30:55,729 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 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) [2022-07-20 22:30:55,729 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 350 transitions. [2022-07-20 22:30:55,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-20 22:30:55,730 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:30:55,730 INFO L195 NwaCegarLoop]: 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] [2022-07-20 22:30:55,730 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-20 22:30:55,730 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:30:55,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:30:55,731 INFO L85 PathProgramCache]: Analyzing trace with hash 1523737831, now seen corresponding path program 1 times [2022-07-20 22:30:55,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:30:55,731 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592269267] [2022-07-20 22:30:55,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:30:55,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:30:55,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:30:55,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-20 22:30:55,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:30:55,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 22:30:55,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:30:55,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592269267] [2022-07-20 22:30:55,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592269267] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:30:55,781 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:30:55,781 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-20 22:30:55,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889691897] [2022-07-20 22:30:55,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:30:55,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-20 22:30:55,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:30:55,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-20 22:30:55,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-20 22:30:55,783 INFO L87 Difference]: Start difference. First operand 274 states and 350 transitions. Second operand has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 7 states have internal predecessors, (40), 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) [2022-07-20 22:30:55,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:30:55,931 INFO L93 Difference]: Finished difference Result 288 states and 364 transitions. [2022-07-20 22:30:55,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-20 22:30:55,932 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 7 states have internal predecessors, (40), 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 43 [2022-07-20 22:30:55,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:30:55,934 INFO L225 Difference]: With dead ends: 288 [2022-07-20 22:30:55,934 INFO L226 Difference]: Without dead ends: 224 [2022-07-20 22:30:55,934 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-07-20 22:30:55,935 INFO L413 NwaCegarLoop]: 157 mSDtfsCounter, 52 mSDsluCounter, 917 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 1074 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 22:30:55,935 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 1074 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 22:30:55,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2022-07-20 22:30:55,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 224. [2022-07-20 22:30:55,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 192 states have (on average 1.171875) internal successors, (225), 197 states have internal predecessors, (225), 16 states have call successors, (16), 12 states have call predecessors, (16), 15 states have return successors, (17), 14 states have call predecessors, (17), 12 states have call successors, (17) [2022-07-20 22:30:55,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 258 transitions. [2022-07-20 22:30:55,949 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 258 transitions. Word has length 43 [2022-07-20 22:30:55,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:30:55,949 INFO L495 AbstractCegarLoop]: Abstraction has 224 states and 258 transitions. [2022-07-20 22:30:55,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 7 states have internal predecessors, (40), 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) [2022-07-20 22:30:55,949 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 258 transitions. [2022-07-20 22:30:55,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-20 22:30:55,950 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:30:55,950 INFO L195 NwaCegarLoop]: 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] [2022-07-20 22:30:55,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-20 22:30:55,950 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:30:55,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:30:55,951 INFO L85 PathProgramCache]: Analyzing trace with hash -2019746375, now seen corresponding path program 1 times [2022-07-20 22:30:55,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:30:55,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477840013] [2022-07-20 22:30:55,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:30:55,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:30:55,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-20 22:30:55,961 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-20 22:30:55,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-20 22:30:55,991 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-20 22:30:55,991 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-20 22:30:55,992 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-20 22:30:55,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-20 22:30:55,996 INFO L356 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, 1] [2022-07-20 22:30:55,999 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-20 22:30:56,052 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.07 10:30:56 BoogieIcfgContainer [2022-07-20 22:30:56,053 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-20 22:30:56,053 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-20 22:30:56,053 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-20 22:30:56,053 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-20 22:30:56,054 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 10:30:50" (3/4) ... [2022-07-20 22:30:56,055 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-07-20 22:30:56,129 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-20 22:30:56,129 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-20 22:30:56,130 INFO L158 Benchmark]: Toolchain (without parser) took 6417.83ms. Allocated memory was 58.7MB in the beginning and 117.4MB in the end (delta: 58.7MB). Free memory was 37.1MB in the beginning and 90.6MB in the end (delta: -53.5MB). Peak memory consumption was 71.4MB. Max. memory is 16.1GB. [2022-07-20 22:30:56,130 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 58.7MB. Free memory was 41.0MB in the beginning and 41.0MB in the end (delta: 44.5kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-20 22:30:56,130 INFO L158 Benchmark]: CACSL2BoogieTranslator took 411.84ms. Allocated memory is still 58.7MB. Free memory was 37.0MB in the beginning and 36.0MB in the end (delta: 957.6kB). Peak memory consumption was 16.1MB. Max. memory is 16.1GB. [2022-07-20 22:30:56,131 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.84ms. Allocated memory is still 58.7MB. Free memory was 36.0MB in the beginning and 32.4MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-20 22:30:56,131 INFO L158 Benchmark]: Boogie Preprocessor took 29.65ms. Allocated memory is still 58.7MB. Free memory was 32.4MB in the beginning and 29.9MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-20 22:30:56,131 INFO L158 Benchmark]: RCFGBuilder took 708.75ms. Allocated memory was 58.7MB in the beginning and 77.6MB in the end (delta: 18.9MB). Free memory was 29.7MB in the beginning and 46.2MB in the end (delta: -16.4MB). Peak memory consumption was 15.1MB. Max. memory is 16.1GB. [2022-07-20 22:30:56,132 INFO L158 Benchmark]: TraceAbstraction took 5120.04ms. Allocated memory was 77.6MB in the beginning and 117.4MB in the end (delta: 39.8MB). Free memory was 45.5MB in the beginning and 34.0MB in the end (delta: 11.6MB). Peak memory consumption was 50.6MB. Max. memory is 16.1GB. [2022-07-20 22:30:56,132 INFO L158 Benchmark]: Witness Printer took 76.52ms. Allocated memory is still 117.4MB. Free memory was 34.0MB in the beginning and 90.6MB in the end (delta: -56.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-20 22:30:56,133 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.20ms. Allocated memory is still 58.7MB. Free memory was 41.0MB in the beginning and 41.0MB in the end (delta: 44.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 411.84ms. Allocated memory is still 58.7MB. Free memory was 37.0MB in the beginning and 36.0MB in the end (delta: 957.6kB). Peak memory consumption was 16.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 65.84ms. Allocated memory is still 58.7MB. Free memory was 36.0MB in the beginning and 32.4MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 29.65ms. Allocated memory is still 58.7MB. Free memory was 32.4MB in the beginning and 29.9MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 708.75ms. Allocated memory was 58.7MB in the beginning and 77.6MB in the end (delta: 18.9MB). Free memory was 29.7MB in the beginning and 46.2MB in the end (delta: -16.4MB). Peak memory consumption was 15.1MB. Max. memory is 16.1GB. * TraceAbstraction took 5120.04ms. Allocated memory was 77.6MB in the beginning and 117.4MB in the end (delta: 39.8MB). Free memory was 45.5MB in the beginning and 34.0MB in the end (delta: 11.6MB). Peak memory consumption was 50.6MB. Max. memory is 16.1GB. * Witness Printer took 76.52ms. Allocated memory is still 117.4MB. Free memory was 34.0MB in the beginning and 90.6MB in the end (delta: -56.6MB). Peak memory consumption was 8.4MB. 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 - CounterExampleResult [Line: 1013]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L23] int KernelMode ; [L24] int Executive ; [L25] int DevicePowerState ; [L26] int s ; [L27] int UNLOADED ; [L28] int NP ; [L29] int DC ; [L30] int SKIP1 ; [L31] int SKIP2 ; [L32] int MPR1 ; [L33] int MPR3 ; [L34] int IPC ; [L35] int pended ; [L36] int compFptr ; [L37] int compRegistered ; [L38] int lowerDriverReturn ; [L39] int setEventCalled ; [L40] int customIrp ; [L41] int myStatus ; VAL [compFptr=0, compRegistered=0, customIrp=0, DC=0, DevicePowerState=0, Executive=0, IPC=0, KernelMode=0, lowerDriverReturn=0, MPR1=0, MPR3=0, myStatus=0, NP=0, pended=0, s=0, setEventCalled=0, SKIP1=0, SKIP2=0, UNLOADED=0] [L294] int status ; [L295] int irp = __VERIFIER_nondet_int() ; [L296] int pirp ; [L297] int pirp__IoStatus__Status ; [L298] int irp_choice = __VERIFIER_nondet_int() ; [L299] int devobj = __VERIFIER_nondet_int() ; [L300] int __cil_tmp8 ; [L302] KernelMode = 0 [L303] Executive = 0 [L304] DevicePowerState = 1 [L305] s = 0 [L306] UNLOADED = 0 [L307] NP = 0 [L308] DC = 0 [L309] SKIP1 = 0 [L310] SKIP2 = 0 [L311] MPR1 = 0 [L312] MPR3 = 0 [L313] IPC = 0 [L314] pended = 0 [L315] compFptr = 0 [L316] compRegistered = 0 [L317] lowerDriverReturn = 0 [L318] setEventCalled = 0 [L319] customIrp = 0 [L320] myStatus = 0 [L324] status = 0 [L325] pirp = irp [L326] CALL _BLAST_init() [L61] UNLOADED = 0 [L62] NP = 1 [L63] DC = 2 [L64] SKIP1 = 3 [L65] SKIP2 = 4 [L66] MPR1 = 5 [L67] MPR3 = 6 [L68] IPC = 7 [L69] s = UNLOADED [L70] pended = 0 [L71] compFptr = 0 [L72] compRegistered = 0 [L73] lowerDriverReturn = 0 [L74] setEventCalled = 0 [L75] customIrp = 0 VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, s=0, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L326] RET _BLAST_init() [L328] COND TRUE status >= 0 [L329] s = NP [L330] customIrp = 0 [L331] setEventCalled = customIrp [L332] lowerDriverReturn = setEventCalled [L333] compRegistered = lowerDriverReturn [L334] pended = compRegistered [L335] pirp__IoStatus__Status = 0 [L336] myStatus = 0 VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, devobj=-2, Executive=0, IPC=7, irp=-3, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, pirp=-3, pirp__IoStatus__Status=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, UNLOADED=0] [L337] COND TRUE irp_choice == 0 [L338] pirp__IoStatus__Status = -1073741637 [L339] myStatus = -1073741637 VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, devobj=-2, Executive=0, IPC=7, irp=-3, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=-3, pirp__IoStatus__Status=-1073741637, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, UNLOADED=0] [L342] CALL stub_driver_init() [L47] s = NP [L48] pended = 0 [L49] compFptr = 0 [L50] compRegistered = 0 [L51] lowerDriverReturn = 0 [L52] setEventCalled = 0 [L53] customIrp = 0 VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L342] RET stub_driver_init() [L345] COND FALSE !(status < 0) [L349] int tmp_ndt_1; [L350] tmp_ndt_1 = __VERIFIER_nondet_int() [L351] COND FALSE !(tmp_ndt_1 == 0) [L354] int tmp_ndt_2; [L355] tmp_ndt_2 = __VERIFIER_nondet_int() [L356] COND FALSE !(tmp_ndt_2 == 1) [L359] int tmp_ndt_3; [L360] tmp_ndt_3 = __VERIFIER_nondet_int() [L361] COND TRUE tmp_ndt_3 == 3 VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, devobj=-2, Executive=0, IPC=7, irp=-3, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=-3, pirp__IoStatus__Status=-1073741637, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, tmp_ndt_1=1, tmp_ndt_2=-4, tmp_ndt_3=3, UNLOADED=0] [L388] CALL, EXPR KbFilter_PnP(devobj, pirp) [L80] int devExt ; [L81] int irpStack ; [L82] int status ; [L83] int event = __VERIFIER_nondet_int() ; [L84] int DeviceObject__DeviceExtension = __VERIFIER_nondet_int() ; [L85] int Irp__Tail__Overlay__CurrentStackLocation = __VERIFIER_nondet_int() ; [L86] int irpStack__MinorFunction = __VERIFIER_nondet_int() ; [L87] int devExt__TopOfStack = __VERIFIER_nondet_int() ; [L88] int devExt__Started ; [L89] int devExt__Removed ; [L90] int devExt__SurpriseRemoved ; [L91] int Irp__IoStatus__Status ; [L92] int Irp__IoStatus__Information ; [L93] int Irp__CurrentLocation = __VERIFIER_nondet_int() ; [L94] int irpSp ; [L95] int nextIrpSp ; [L96] int nextIrpSp__Control ; [L97] int irpSp___0 ; [L98] int irpSp__Context ; [L99] int irpSp__Control ; [L100] long __cil_tmp23 ; [L103] status = 0 [L104] devExt = DeviceObject__DeviceExtension [L105] irpStack = Irp__Tail__Overlay__CurrentStackLocation VAL [\old(DeviceObject)=-2, \old(Irp)=-3, compFptr=0, compRegistered=0, customIrp=0, DC=2, devExt=0, devExt__TopOfStack=0, DeviceObject=-2, DeviceObject__DeviceExtension=0, DevicePowerState=1, event=0, Executive=0, IPC=7, Irp=-3, Irp__CurrentLocation=-1, Irp__Tail__Overlay__CurrentStackLocation=0, irpStack=0, irpStack__MinorFunction=2, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, UNLOADED=0] [L106] COND FALSE !(irpStack__MinorFunction == 0) VAL [\old(DeviceObject)=-2, \old(Irp)=-3, compFptr=0, compRegistered=0, customIrp=0, DC=2, devExt=0, devExt__TopOfStack=0, DeviceObject=-2, DeviceObject__DeviceExtension=0, DevicePowerState=1, event=0, Executive=0, IPC=7, Irp=-3, Irp__CurrentLocation=-1, Irp__Tail__Overlay__CurrentStackLocation=0, irpStack=0, irpStack__MinorFunction=2, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, UNLOADED=0] [L109] COND FALSE !(irpStack__MinorFunction == 23) VAL [\old(DeviceObject)=-2, \old(Irp)=-3, compFptr=0, compRegistered=0, customIrp=0, DC=2, devExt=0, devExt__TopOfStack=0, DeviceObject=-2, DeviceObject__DeviceExtension=0, DevicePowerState=1, event=0, Executive=0, IPC=7, Irp=-3, Irp__CurrentLocation=-1, Irp__Tail__Overlay__CurrentStackLocation=0, irpStack=0, irpStack__MinorFunction=2, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, UNLOADED=0] [L112] COND TRUE irpStack__MinorFunction == 2 VAL [\old(DeviceObject)=-2, \old(Irp)=-3, compFptr=0, compRegistered=0, customIrp=0, DC=2, devExt=0, devExt__TopOfStack=0, DeviceObject=-2, DeviceObject__DeviceExtension=0, DevicePowerState=1, event=0, Executive=0, IPC=7, Irp=-3, Irp__CurrentLocation=-1, Irp__Tail__Overlay__CurrentStackLocation=0, irpStack=0, irpStack__MinorFunction=2, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, UNLOADED=0] [L236] devExt__Removed = 1 VAL [\old(DeviceObject)=-2, \old(Irp)=-3, compFptr=0, compRegistered=0, customIrp=0, DC=2, devExt=0, devExt__Removed=1, devExt__TopOfStack=0, DeviceObject=-2, DeviceObject__DeviceExtension=0, DevicePowerState=1, event=0, Executive=0, IPC=7, Irp=-3, Irp__CurrentLocation=-1, Irp__Tail__Overlay__CurrentStackLocation=0, irpStack=0, irpStack__MinorFunction=2, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, UNLOADED=0] [L237] COND TRUE s == NP [L238] s = SKIP1 VAL [\old(DeviceObject)=-2, \old(Irp)=-3, compFptr=0, compRegistered=0, customIrp=0, DC=2, devExt=0, devExt__Removed=1, devExt__TopOfStack=0, DeviceObject=-2, DeviceObject__DeviceExtension=0, DevicePowerState=1, event=0, Executive=0, IPC=7, Irp=-3, Irp__CurrentLocation=-1, Irp__Tail__Overlay__CurrentStackLocation=0, irpStack=0, irpStack__MinorFunction=2, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, UNLOADED=0] [L245] Irp__CurrentLocation ++ [L246] Irp__Tail__Overlay__CurrentStackLocation ++ VAL [\old(DeviceObject)=-2, \old(Irp)=-3, compFptr=0, compRegistered=0, customIrp=0, DC=2, devExt=0, devExt__Removed=1, devExt__TopOfStack=0, DeviceObject=-2, DeviceObject__DeviceExtension=0, DevicePowerState=1, event=0, Executive=0, IPC=7, Irp=-3, Irp__CurrentLocation=0, Irp__Tail__Overlay__CurrentStackLocation=1, irpStack=0, irpStack__MinorFunction=2, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, UNLOADED=0] [L247] CALL IofCallDriver(devExt__TopOfStack, Irp) VAL [\old(DeviceObject)=0, \old(Irp)=-3, \old(lowerDriverReturn)=0, \old(s)=3, \old(setEventCalled)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L483] int returnVal2 ; [L484] int compRetStatus ; [L485] int lcontext = __VERIFIER_nondet_int() ; [L486] long long __cil_tmp7 ; VAL [\old(DeviceObject)=0, \old(Irp)=-3, \old(lowerDriverReturn)=0, \old(s)=3, \old(setEventCalled)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DeviceObject=0, DevicePowerState=1, Executive=0, IPC=7, Irp=-3, KernelMode=0, lcontext=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L489] COND FALSE !(\read(compRegistered)) VAL [\old(DeviceObject)=0, \old(Irp)=-3, \old(lowerDriverReturn)=0, \old(s)=3, \old(setEventCalled)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DeviceObject=0, DevicePowerState=1, Executive=0, IPC=7, Irp=-3, KernelMode=0, lcontext=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L502] int tmp_ndt_6; [L503] tmp_ndt_6 = __VERIFIER_nondet_int() [L504] COND FALSE !(tmp_ndt_6 == 0) [L507] int tmp_ndt_7; [L508] tmp_ndt_7 = __VERIFIER_nondet_int() [L509] COND TRUE tmp_ndt_7 == 1 VAL [\old(DeviceObject)=0, \old(Irp)=-3, \old(lowerDriverReturn)=0, \old(s)=3, \old(setEventCalled)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DeviceObject=0, DevicePowerState=1, Executive=0, IPC=7, Irp=-3, KernelMode=0, lcontext=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, tmp_ndt_6=-5, tmp_ndt_7=1, UNLOADED=0] [L518] returnVal2 = -1073741823 VAL [\old(DeviceObject)=0, \old(Irp)=-3, \old(lowerDriverReturn)=0, \old(s)=3, \old(setEventCalled)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DeviceObject=0, DevicePowerState=1, Executive=0, IPC=7, Irp=-3, KernelMode=0, lcontext=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, returnVal2=-1073741823, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, tmp_ndt_6=-5, tmp_ndt_7=1, UNLOADED=0] [L528] COND FALSE !(s == NP) VAL [\old(DeviceObject)=0, \old(Irp)=-3, \old(lowerDriverReturn)=0, \old(s)=3, \old(setEventCalled)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DeviceObject=0, DevicePowerState=1, Executive=0, IPC=7, Irp=-3, KernelMode=0, lcontext=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, returnVal2=-1073741823, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, tmp_ndt_6=-5, tmp_ndt_7=1, UNLOADED=0] [L532] COND FALSE !(s == MPR1) VAL [\old(DeviceObject)=0, \old(Irp)=-3, \old(lowerDriverReturn)=0, \old(s)=3, \old(setEventCalled)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DeviceObject=0, DevicePowerState=1, Executive=0, IPC=7, Irp=-3, KernelMode=0, lcontext=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, returnVal2=-1073741823, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, tmp_ndt_6=-5, tmp_ndt_7=1, UNLOADED=0] [L541] COND TRUE s == SKIP1 [L542] s = SKIP2 [L543] lowerDriverReturn = returnVal2 VAL [\old(DeviceObject)=0, \old(Irp)=-3, \old(lowerDriverReturn)=0, \old(s)=3, \old(setEventCalled)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DeviceObject=0, DevicePowerState=1, Executive=0, IPC=7, Irp=-3, KernelMode=0, lcontext=0, lowerDriverReturn=-1073741823, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, returnVal2=-1073741823, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, tmp_ndt_6=-5, tmp_ndt_7=1, UNLOADED=0] [L551] return (returnVal2); VAL [\old(DeviceObject)=0, \old(Irp)=-3, \old(lowerDriverReturn)=0, \old(s)=3, \old(setEventCalled)=0, \result=-1073741823, compFptr=0, compRegistered=0, customIrp=0, DC=2, DeviceObject=0, DevicePowerState=1, Executive=0, IPC=7, Irp=-3, KernelMode=0, lcontext=0, lowerDriverReturn=-1073741823, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, returnVal2=-1073741823, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, tmp_ndt_6=-5, tmp_ndt_7=1, UNLOADED=0] [L247] RET IofCallDriver(devExt__TopOfStack, Irp) VAL [\old(DeviceObject)=-2, \old(Irp)=-3, compFptr=0, compRegistered=0, customIrp=0, DC=2, devExt=0, devExt__Removed=1, devExt__TopOfStack=0, DeviceObject=-2, DeviceObject__DeviceExtension=0, DevicePowerState=1, event=0, Executive=0, IofCallDriver(devExt__TopOfStack, Irp)=-1073741823, IPC=7, Irp=-3, Irp__CurrentLocation=0, Irp__Tail__Overlay__CurrentStackLocation=1, irpStack=0, irpStack__MinorFunction=2, KernelMode=0, lowerDriverReturn=-1073741823, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, UNLOADED=0] [L248] status = 0 VAL [\old(DeviceObject)=-2, \old(Irp)=-3, compFptr=0, compRegistered=0, customIrp=0, DC=2, devExt=0, devExt__Removed=1, devExt__TopOfStack=0, DeviceObject=-2, DeviceObject__DeviceExtension=0, DevicePowerState=1, event=0, Executive=0, IPC=7, Irp=-3, Irp__CurrentLocation=0, Irp__Tail__Overlay__CurrentStackLocation=1, irpStack=0, irpStack__MinorFunction=2, KernelMode=0, lowerDriverReturn=-1073741823, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, UNLOADED=0] [L290] return (status); VAL [\old(DeviceObject)=-2, \old(Irp)=-3, \result=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, devExt=0, devExt__Removed=1, devExt__TopOfStack=0, DeviceObject=-2, DeviceObject__DeviceExtension=0, DevicePowerState=1, event=0, Executive=0, IPC=7, Irp=-3, Irp__CurrentLocation=0, Irp__Tail__Overlay__CurrentStackLocation=1, irpStack=0, irpStack__MinorFunction=2, KernelMode=0, lowerDriverReturn=-1073741823, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, UNLOADED=0] [L388] RET, EXPR KbFilter_PnP(devobj, pirp) [L388] status = KbFilter_PnP(devobj, pirp) [L412] COND FALSE !(pended == 1) VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, devobj=-2, Executive=0, IPC=7, irp=-3, irp_choice=0, KernelMode=0, lowerDriverReturn=-1073741823, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=-3, pirp__IoStatus__Status=-1073741637, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, tmp_ndt_1=1, tmp_ndt_2=-4, tmp_ndt_3=3, UNLOADED=0] [L420] COND FALSE !(pended == 1) VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, devobj=-2, Executive=0, IPC=7, irp=-3, irp_choice=0, KernelMode=0, lowerDriverReturn=-1073741823, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=-3, pirp__IoStatus__Status=-1073741637, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, tmp_ndt_1=1, tmp_ndt_2=-4, tmp_ndt_3=3, UNLOADED=0] [L428] COND TRUE s != UNLOADED VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, devobj=-2, Executive=0, IPC=7, irp=-3, irp_choice=0, KernelMode=0, lowerDriverReturn=-1073741823, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=-3, pirp__IoStatus__Status=-1073741637, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, tmp_ndt_1=1, tmp_ndt_2=-4, tmp_ndt_3=3, UNLOADED=0] [L429] COND TRUE status != -1 VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, devobj=-2, Executive=0, IPC=7, irp=-3, irp_choice=0, KernelMode=0, lowerDriverReturn=-1073741823, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=-3, pirp__IoStatus__Status=-1073741637, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, tmp_ndt_1=1, tmp_ndt_2=-4, tmp_ndt_3=3, UNLOADED=0] [L430] COND FALSE !(s != SKIP2) VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, devobj=-2, Executive=0, IPC=7, irp=-3, irp_choice=0, KernelMode=0, lowerDriverReturn=-1073741823, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=-3, pirp__IoStatus__Status=-1073741637, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, tmp_ndt_1=1, tmp_ndt_2=-4, tmp_ndt_3=3, UNLOADED=0] [L440] COND FALSE !(pended == 1) VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, devobj=-2, Executive=0, IPC=7, irp=-3, irp_choice=0, KernelMode=0, lowerDriverReturn=-1073741823, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=-3, pirp__IoStatus__Status=-1073741637, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, tmp_ndt_1=1, tmp_ndt_2=-4, tmp_ndt_3=3, UNLOADED=0] [L447] COND FALSE !(s == DC) VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, devobj=-2, Executive=0, IPC=7, irp=-3, irp_choice=0, KernelMode=0, lowerDriverReturn=-1073741823, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=-3, pirp__IoStatus__Status=-1073741637, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, tmp_ndt_1=1, tmp_ndt_2=-4, tmp_ndt_3=3, UNLOADED=0] [L452] COND TRUE status != lowerDriverReturn VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, devobj=-2, Executive=0, IPC=7, irp=-3, irp_choice=0, KernelMode=0, lowerDriverReturn=-1073741823, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=-3, pirp__IoStatus__Status=-1073741637, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, tmp_ndt_1=1, tmp_ndt_2=-4, tmp_ndt_3=3, UNLOADED=0] [L453] CALL errorFn() VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=-1073741823, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L1013] reach_error() VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=-1073741823, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 209 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.0s, OverallIterations: 23, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3736 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3707 mSDsluCounter, 17586 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 12418 mSDsCounter, 573 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2759 IncrementalHoareTripleChecker+Invalid, 3332 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 573 mSolverCounterUnsat, 5168 mSDtfsCounter, 2759 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 219 GetRequests, 88 SyntacticMatches, 1 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=344occurred in iteration=15, InterpolantAutomatonStates: 149, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 22 MinimizatonAttempts, 213 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 850 NumberOfCodeBlocks, 850 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 784 ConstructedInterpolants, 0 QuantifiedInterpolants, 1952 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 RESULT: Ultimate proved your program to be incorrect! [2022-07-20 22:30:56,164 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE