./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ntdrivers/cdaudio.i.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6c24879c 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/cdaudio.i.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 158aa30053f80b6c80bcbeac6f52ce0f8b5c03af85b763fe7e9897c790504a73 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-11 23:47:05,218 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-11 23:47:05,220 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-11 23:47:05,243 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-11 23:47:05,245 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-11 23:47:05,246 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-11 23:47:05,248 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-11 23:47:05,250 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-11 23:47:05,251 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-11 23:47:05,251 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-11 23:47:05,252 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-11 23:47:05,253 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-11 23:47:05,253 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-11 23:47:05,254 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-11 23:47:05,255 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-11 23:47:05,255 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-11 23:47:05,267 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-11 23:47:05,269 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-11 23:47:05,271 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-11 23:47:05,276 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-11 23:47:05,277 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-11 23:47:05,279 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-11 23:47:05,280 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-11 23:47:05,281 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-11 23:47:05,281 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-11 23:47:05,283 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-11 23:47:05,283 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-11 23:47:05,283 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-11 23:47:05,284 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-11 23:47:05,284 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-11 23:47:05,285 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-11 23:47:05,285 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-11 23:47:05,285 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-11 23:47:05,286 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-11 23:47:05,286 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-11 23:47:05,287 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-11 23:47:05,287 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-11 23:47:05,288 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-11 23:47:05,288 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-11 23:47:05,288 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-11 23:47:05,289 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-11 23:47:05,292 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-11 23:47:05,293 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-11 23:47:05,315 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-11 23:47:05,316 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-11 23:47:05,316 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-11 23:47:05,316 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-11 23:47:05,317 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-11 23:47:05,317 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-11 23:47:05,317 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-11 23:47:05,317 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-11 23:47:05,318 INFO L138 SettingsManager]: * Use SBE=true [2022-07-11 23:47:05,318 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-11 23:47:05,318 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-11 23:47:05,319 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-11 23:47:05,319 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-11 23:47:05,319 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-11 23:47:05,319 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-11 23:47:05,319 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-11 23:47:05,319 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-11 23:47:05,319 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-11 23:47:05,320 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-11 23:47:05,320 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-11 23:47:05,320 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-11 23:47:05,320 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-11 23:47:05,320 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-11 23:47:05,320 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-11 23:47:05,320 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-11 23:47:05,321 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-11 23:47:05,321 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-11 23:47:05,321 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-11 23:47:05,321 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-11 23:47:05,321 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-11 23:47:05,321 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-11 23:47:05,322 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-11 23:47:05,322 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-11 23:47:05,322 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 -> 158aa30053f80b6c80bcbeac6f52ce0f8b5c03af85b763fe7e9897c790504a73 [2022-07-11 23:47:05,513 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-11 23:47:05,535 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-11 23:47:05,537 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-11 23:47:05,538 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-11 23:47:05,539 INFO L275 PluginConnector]: CDTParser initialized [2022-07-11 23:47:05,539 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ntdrivers/cdaudio.i.cil-2.c [2022-07-11 23:47:05,589 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c9b0a924/985de80a0b114b0d89dcbf561feb9969/FLAG91ea59232 [2022-07-11 23:47:06,145 INFO L306 CDTParser]: Found 1 translation units. [2022-07-11 23:47:06,146 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ntdrivers/cdaudio.i.cil-2.c [2022-07-11 23:47:06,178 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c9b0a924/985de80a0b114b0d89dcbf561feb9969/FLAG91ea59232 [2022-07-11 23:47:06,569 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c9b0a924/985de80a0b114b0d89dcbf561feb9969 [2022-07-11 23:47:06,571 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-11 23:47:06,572 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-11 23:47:06,573 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-11 23:47:06,574 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-11 23:47:06,576 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-11 23:47:06,576 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 11:47:06" (1/1) ... [2022-07-11 23:47:06,577 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79b5ddc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:47:06, skipping insertion in model container [2022-07-11 23:47:06,577 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 11:47:06" (1/1) ... [2022-07-11 23:47:06,581 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-11 23:47:06,673 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-11 23:47:07,105 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/cdaudio.i.cil-2.c[90200,90213] [2022-07-11 23:47:07,603 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-11 23:47:07,610 INFO L203 MainTranslator]: Completed pre-run [2022-07-11 23:47:07,669 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/cdaudio.i.cil-2.c[90200,90213] [2022-07-11 23:47:07,869 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-11 23:47:07,889 INFO L208 MainTranslator]: Completed translation [2022-07-11 23:47:07,890 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:47:07 WrapperNode [2022-07-11 23:47:07,890 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-11 23:47:07,890 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-11 23:47:07,891 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-11 23:47:07,891 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-11 23:47:07,895 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:47:07" (1/1) ... [2022-07-11 23:47:07,994 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:47:07" (1/1) ... [2022-07-11 23:47:08,072 INFO L137 Inliner]: procedures = 121, calls = 2189, calls flagged for inlining = 23, calls inlined = 19, statements flattened = 2294 [2022-07-11 23:47:08,072 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-11 23:47:08,073 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-11 23:47:08,073 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-11 23:47:08,073 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-11 23:47:08,080 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:47:07" (1/1) ... [2022-07-11 23:47:08,080 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:47:07" (1/1) ... [2022-07-11 23:47:08,107 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:47:07" (1/1) ... [2022-07-11 23:47:08,108 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:47:07" (1/1) ... [2022-07-11 23:47:08,163 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:47:07" (1/1) ... [2022-07-11 23:47:08,182 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:47:07" (1/1) ... [2022-07-11 23:47:08,190 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:47:07" (1/1) ... [2022-07-11 23:47:08,200 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-11 23:47:08,201 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-11 23:47:08,201 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-11 23:47:08,201 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-11 23:47:08,202 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:47:07" (1/1) ... [2022-07-11 23:47:08,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-11 23:47:08,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:47:08,236 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-11 23:47:08,254 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-11 23:47:08,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-07-11 23:47:08,266 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-07-11 23:47:08,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-07-11 23:47:08,266 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-11 23:47:08,266 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2022-07-11 23:47:08,267 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2022-07-11 23:47:08,267 INFO L130 BoogieDeclarations]: Found specification of procedure MmLockPagableDataSection [2022-07-11 23:47:08,267 INFO L138 BoogieDeclarations]: Found implementation of procedure MmLockPagableDataSection [2022-07-11 23:47:08,267 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-11 23:47:08,267 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioIsPlayActive [2022-07-11 23:47:08,267 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioIsPlayActive [2022-07-11 23:47:08,267 INFO L130 BoogieDeclarations]: Found specification of procedure IoOpenDeviceRegistryKey [2022-07-11 23:47:08,267 INFO L138 BoogieDeclarations]: Found implementation of procedure IoOpenDeviceRegistryKey [2022-07-11 23:47:08,268 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2022-07-11 23:47:08,268 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2022-07-11 23:47:08,268 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-07-11 23:47:08,268 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-07-11 23:47:08,268 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_malloc [2022-07-11 23:47:08,268 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_malloc [2022-07-11 23:47:08,268 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2022-07-11 23:47:08,268 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2022-07-11 23:47:08,268 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-11 23:47:08,269 INFO L130 BoogieDeclarations]: Found specification of procedure ZwClose [2022-07-11 23:47:08,269 INFO L138 BoogieDeclarations]: Found implementation of procedure ZwClose [2022-07-11 23:47:08,269 INFO L130 BoogieDeclarations]: Found specification of procedure SendSrbSynchronous [2022-07-11 23:47:08,269 INFO L138 BoogieDeclarations]: Found implementation of procedure SendSrbSynchronous [2022-07-11 23:47:08,269 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-11 23:47:08,269 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-11 23:47:08,269 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-11 23:47:08,269 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2022-07-11 23:47:08,269 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2022-07-11 23:47:08,270 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2022-07-11 23:47:08,270 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-11 23:47:08,270 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2022-07-11 23:47:08,270 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2022-07-11 23:47:08,270 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioSignalCompletion [2022-07-11 23:47:08,270 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioSignalCompletion [2022-07-11 23:47:08,270 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-11 23:47:08,270 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2022-07-11 23:47:08,270 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2022-07-11 23:47:08,271 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memmove [2022-07-11 23:47:08,271 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memmove [2022-07-11 23:47:08,271 INFO L130 BoogieDeclarations]: Found specification of procedure HPCdrCompletion [2022-07-11 23:47:08,271 INFO L138 BoogieDeclarations]: Found implementation of procedure HPCdrCompletion [2022-07-11 23:47:08,271 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-11 23:47:08,271 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioSendToNextDriver [2022-07-11 23:47:08,271 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioSendToNextDriver [2022-07-11 23:47:08,271 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-07-11 23:47:08,271 INFO L130 BoogieDeclarations]: Found specification of procedure ExAllocatePoolWithTag [2022-07-11 23:47:08,272 INFO L138 BoogieDeclarations]: Found implementation of procedure ExAllocatePoolWithTag [2022-07-11 23:47:08,272 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-11 23:47:08,272 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-11 23:47:08,273 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioForwardIrpSynchronous [2022-07-11 23:47:08,273 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioForwardIrpSynchronous [2022-07-11 23:47:08,625 INFO L234 CfgBuilder]: Building ICFG [2022-07-11 23:47:08,627 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-11 23:47:08,785 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-11 23:47:08,797 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2022-07-11 23:47:08,798 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2022-07-11 23:47:09,109 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-11 23:47:09,128 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##21: assume !false; [2022-07-11 23:47:09,129 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##20: assume false; [2022-07-11 23:47:09,149 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-11 23:47:09,150 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-11 23:47:09,151 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-11 23:47:09,158 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-11 23:47:09,164 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-11 23:47:09,176 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-11 23:47:21,865 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##258: assume false; [2022-07-11 23:47:21,866 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##259: assume !false; [2022-07-11 23:47:21,866 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##485: assume false; [2022-07-11 23:47:21,866 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##486: assume !false; [2022-07-11 23:47:21,866 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L3709: CdAudioPnp_#res#1 := 0; [2022-07-11 23:47:21,866 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##47: assume !false; [2022-07-11 23:47:21,866 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##46: assume false; [2022-07-11 23:47:21,866 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##25: assume !false; [2022-07-11 23:47:21,866 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##24: assume false; [2022-07-11 23:47:21,866 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume !false; [2022-07-11 23:47:21,866 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##154: assume !false; [2022-07-11 23:47:21,866 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##153: assume false; [2022-07-11 23:47:21,866 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##14: assume false; [2022-07-11 23:47:21,894 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-11 23:47:21,897 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-07-11 23:47:21,897 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-07-11 23:47:21,907 INFO L275 CfgBuilder]: Performing block encoding [2022-07-11 23:47:21,922 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-11 23:47:21,923 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-11 23:47:21,925 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 11:47:21 BoogieIcfgContainer [2022-07-11 23:47:21,925 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-11 23:47:21,927 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-11 23:47:21,927 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-11 23:47:21,929 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-11 23:47:21,929 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.07 11:47:06" (1/3) ... [2022-07-11 23:47:21,930 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b87abe5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 11:47:21, skipping insertion in model container [2022-07-11 23:47:21,930 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:47:07" (2/3) ... [2022-07-11 23:47:21,931 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b87abe5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 11:47:21, skipping insertion in model container [2022-07-11 23:47:21,931 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 11:47:21" (3/3) ... [2022-07-11 23:47:21,932 INFO L111 eAbstractionObserver]: Analyzing ICFG cdaudio.i.cil-2.c [2022-07-11 23:47:21,941 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-11 23:47:21,941 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-11 23:47:22,008 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-11 23:47:22,016 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@4dcbd504, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@37e0f13a [2022-07-11 23:47:22,017 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-11 23:47:22,023 INFO L276 IsEmpty]: Start isEmpty. Operand has 617 states, 483 states have (on average 1.525879917184265) internal successors, (737), 502 states have internal predecessors, (737), 113 states have call successors, (113), 19 states have call predecessors, (113), 19 states have return successors, (113), 108 states have call predecessors, (113), 113 states have call successors, (113) [2022-07-11 23:47:22,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-11 23:47:22,030 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:47:22,030 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:47:22,031 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:47:22,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:47:22,036 INFO L85 PathProgramCache]: Analyzing trace with hash 1346091919, now seen corresponding path program 1 times [2022-07-11 23:47:22,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:47:22,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831266566] [2022-07-11 23:47:22,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:47:22,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:47:22,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:47:22,326 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-11 23:47:22,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:47:22,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831266566] [2022-07-11 23:47:22,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831266566] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:47:22,327 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:47:22,327 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:47:22,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3615260] [2022-07-11 23:47:22,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:47:22,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:47:22,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:47:22,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:47:22,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:47:22,370 INFO L87 Difference]: Start difference. First operand has 617 states, 483 states have (on average 1.525879917184265) internal successors, (737), 502 states have internal predecessors, (737), 113 states have call successors, (113), 19 states have call predecessors, (113), 19 states have return successors, (113), 108 states have call predecessors, (113), 113 states have call successors, (113) 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-11 23:47:22,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:47:22,547 INFO L93 Difference]: Finished difference Result 1094 states and 1737 transitions. [2022-07-11 23:47:22,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:47:22,549 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-11 23:47:22,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:47:22,560 INFO L225 Difference]: With dead ends: 1094 [2022-07-11 23:47:22,560 INFO L226 Difference]: Without dead ends: 610 [2022-07-11 23:47:22,565 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-11 23:47:22,568 INFO L413 NwaCegarLoop]: 928 mSDtfsCounter, 8 mSDsluCounter, 879 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 1807 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:47:22,569 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 1807 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:47:22,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2022-07-11 23:47:22,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 610. [2022-07-11 23:47:22,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 610 states, 478 states have (on average 1.4832635983263598) internal successors, (709), 495 states have internal predecessors, (709), 113 states have call successors, (113), 19 states have call predecessors, (113), 18 states have return successors, (97), 97 states have call predecessors, (97), 97 states have call successors, (97) [2022-07-11 23:47:22,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 919 transitions. [2022-07-11 23:47:22,639 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 919 transitions. Word has length 13 [2022-07-11 23:47:22,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:47:22,640 INFO L495 AbstractCegarLoop]: Abstraction has 610 states and 919 transitions. [2022-07-11 23:47:22,640 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-11 23:47:22,641 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 919 transitions. [2022-07-11 23:47:22,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-11 23:47:22,641 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:47:22,642 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:47:22,642 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-11 23:47:22,642 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:47:22,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:47:22,643 INFO L85 PathProgramCache]: Analyzing trace with hash 503268838, now seen corresponding path program 1 times [2022-07-11 23:47:22,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:47:22,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027567503] [2022-07-11 23:47:22,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:47:22,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:47:22,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:47:22,749 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-11 23:47:22,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:47:22,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027567503] [2022-07-11 23:47:22,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027567503] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:47:22,751 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:47:22,751 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:47:22,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814677892] [2022-07-11 23:47:22,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:47:22,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:47:22,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:47:22,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:47:22,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:47:22,753 INFO L87 Difference]: Start difference. First operand 610 states and 919 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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-11 23:47:22,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:47:22,924 INFO L93 Difference]: Finished difference Result 1141 states and 1702 transitions. [2022-07-11 23:47:22,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:47:22,925 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 15 [2022-07-11 23:47:22,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:47:22,930 INFO L225 Difference]: With dead ends: 1141 [2022-07-11 23:47:22,930 INFO L226 Difference]: Without dead ends: 891 [2022-07-11 23:47:22,935 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-11 23:47:22,936 INFO L413 NwaCegarLoop]: 1241 mSDtfsCounter, 833 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 833 SdHoareTripleChecker+Valid, 1666 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:47:22,936 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [833 Valid, 1666 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:47:22,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 891 states. [2022-07-11 23:47:22,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 891 to 871. [2022-07-11 23:47:22,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 871 states, 696 states have (on average 1.4612068965517242) internal successors, (1017), 699 states have internal predecessors, (1017), 142 states have call successors, (142), 33 states have call predecessors, (142), 32 states have return successors, (146), 140 states have call predecessors, (146), 130 states have call successors, (146) [2022-07-11 23:47:23,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 871 states to 871 states and 1305 transitions. [2022-07-11 23:47:23,003 INFO L78 Accepts]: Start accepts. Automaton has 871 states and 1305 transitions. Word has length 15 [2022-07-11 23:47:23,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:47:23,004 INFO L495 AbstractCegarLoop]: Abstraction has 871 states and 1305 transitions. [2022-07-11 23:47:23,004 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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-11 23:47:23,005 INFO L276 IsEmpty]: Start isEmpty. Operand 871 states and 1305 transitions. [2022-07-11 23:47:23,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-11 23:47:23,009 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:47:23,009 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] [2022-07-11 23:47:23,010 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-11 23:47:23,010 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:47:23,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:47:23,015 INFO L85 PathProgramCache]: Analyzing trace with hash -485834161, now seen corresponding path program 1 times [2022-07-11 23:47:23,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:47:23,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444688133] [2022-07-11 23:47:23,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:47:23,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:47:23,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:47:23,105 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-11 23:47:23,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:47:23,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444688133] [2022-07-11 23:47:23,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444688133] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:47:23,106 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:47:23,106 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:47:23,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039865230] [2022-07-11 23:47:23,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:47:23,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:47:23,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:47:23,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:47:23,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:47:23,107 INFO L87 Difference]: Start difference. First operand 871 states and 1305 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:47:23,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:47:23,216 INFO L93 Difference]: Finished difference Result 1865 states and 2854 transitions. [2022-07-11 23:47:23,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:47:23,217 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-07-11 23:47:23,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:47:23,224 INFO L225 Difference]: With dead ends: 1865 [2022-07-11 23:47:23,224 INFO L226 Difference]: Without dead ends: 1453 [2022-07-11 23:47:23,226 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-11 23:47:23,226 INFO L413 NwaCegarLoop]: 1451 mSDtfsCounter, 586 mSDsluCounter, 865 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 586 SdHoareTripleChecker+Valid, 2316 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:47:23,227 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [586 Valid, 2316 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:47:23,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1453 states. [2022-07-11 23:47:23,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1453 to 1050. [2022-07-11 23:47:23,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1050 states, 833 states have (on average 1.446578631452581) internal successors, (1205), 835 states have internal predecessors, (1205), 170 states have call successors, (170), 46 states have call predecessors, (170), 46 states have return successors, (217), 170 states have call predecessors, (217), 158 states have call successors, (217) [2022-07-11 23:47:23,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1050 states to 1050 states and 1592 transitions. [2022-07-11 23:47:23,263 INFO L78 Accepts]: Start accepts. Automaton has 1050 states and 1592 transitions. Word has length 22 [2022-07-11 23:47:23,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:47:23,264 INFO L495 AbstractCegarLoop]: Abstraction has 1050 states and 1592 transitions. [2022-07-11 23:47:23,264 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:47:23,264 INFO L276 IsEmpty]: Start isEmpty. Operand 1050 states and 1592 transitions. [2022-07-11 23:47:23,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-11 23:47:23,265 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:47:23,265 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] [2022-07-11 23:47:23,266 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-11 23:47:23,266 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:47:23,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:47:23,266 INFO L85 PathProgramCache]: Analyzing trace with hash 1681895330, now seen corresponding path program 1 times [2022-07-11 23:47:23,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:47:23,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943859889] [2022-07-11 23:47:23,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:47:23,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:47:23,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:47:23,330 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-11 23:47:23,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:47:23,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943859889] [2022-07-11 23:47:23,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943859889] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:47:23,331 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:47:23,331 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:47:23,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473772655] [2022-07-11 23:47:23,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:47:23,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:47:23,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:47:23,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:47:23,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:47:23,333 INFO L87 Difference]: Start difference. First operand 1050 states and 1592 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:47:23,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:47:23,367 INFO L93 Difference]: Finished difference Result 1728 states and 2570 transitions. [2022-07-11 23:47:23,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:47:23,368 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-07-11 23:47:23,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:47:23,374 INFO L225 Difference]: With dead ends: 1728 [2022-07-11 23:47:23,374 INFO L226 Difference]: Without dead ends: 1595 [2022-07-11 23:47:23,375 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-11 23:47:23,376 INFO L413 NwaCegarLoop]: 1150 mSDtfsCounter, 836 mSDsluCounter, 409 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 836 SdHoareTripleChecker+Valid, 1559 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-11 23:47:23,376 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [836 Valid, 1559 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 23:47:23,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1595 states. [2022-07-11 23:47:23,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1595 to 1533. [2022-07-11 23:47:23,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1533 states, 1229 states have (on average 1.4475183075671278) internal successors, (1779), 1227 states have internal predecessors, (1779), 227 states have call successors, (227), 72 states have call predecessors, (227), 76 states have return successors, (298), 233 states have call predecessors, (298), 218 states have call successors, (298) [2022-07-11 23:47:23,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1533 states to 1533 states and 2304 transitions. [2022-07-11 23:47:23,414 INFO L78 Accepts]: Start accepts. Automaton has 1533 states and 2304 transitions. Word has length 22 [2022-07-11 23:47:23,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:47:23,414 INFO L495 AbstractCegarLoop]: Abstraction has 1533 states and 2304 transitions. [2022-07-11 23:47:23,414 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:47:23,415 INFO L276 IsEmpty]: Start isEmpty. Operand 1533 states and 2304 transitions. [2022-07-11 23:47:23,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-11 23:47:23,415 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:47:23,415 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] [2022-07-11 23:47:23,416 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-11 23:47:23,416 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:47:23,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:47:23,416 INFO L85 PathProgramCache]: Analyzing trace with hash 1879986928, now seen corresponding path program 1 times [2022-07-11 23:47:23,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:47:23,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545687373] [2022-07-11 23:47:23,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:47:23,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:47:23,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:47:23,490 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-11 23:47:23,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:47:23,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545687373] [2022-07-11 23:47:23,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545687373] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:47:23,491 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:47:23,491 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:47:23,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907943741] [2022-07-11 23:47:23,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:47:23,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:47:23,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:47:23,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:47:23,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:47:23,492 INFO L87 Difference]: Start difference. First operand 1533 states and 2304 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:47:23,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:47:23,983 INFO L93 Difference]: Finished difference Result 2744 states and 4158 transitions. [2022-07-11 23:47:23,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:47:23,983 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-07-11 23:47:23,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:47:23,990 INFO L225 Difference]: With dead ends: 2744 [2022-07-11 23:47:23,991 INFO L226 Difference]: Without dead ends: 1832 [2022-07-11 23:47:23,993 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-11 23:47:23,994 INFO L413 NwaCegarLoop]: 1156 mSDtfsCounter, 1448 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 352 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1450 SdHoareTripleChecker+Valid, 1455 SdHoareTripleChecker+Invalid, 520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 352 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-11 23:47:23,994 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1450 Valid, 1455 Invalid, 520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [352 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-11 23:47:23,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1832 states. [2022-07-11 23:47:24,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1832 to 1521. [2022-07-11 23:47:24,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1521 states, 1219 states have (on average 1.4446267432321576) internal successors, (1761), 1217 states have internal predecessors, (1761), 225 states have call successors, (225), 70 states have call predecessors, (225), 76 states have return successors, (294), 233 states have call predecessors, (294), 216 states have call successors, (294) [2022-07-11 23:47:24,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1521 states to 1521 states and 2280 transitions. [2022-07-11 23:47:24,035 INFO L78 Accepts]: Start accepts. Automaton has 1521 states and 2280 transitions. Word has length 23 [2022-07-11 23:47:24,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:47:24,035 INFO L495 AbstractCegarLoop]: Abstraction has 1521 states and 2280 transitions. [2022-07-11 23:47:24,036 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:47:24,036 INFO L276 IsEmpty]: Start isEmpty. Operand 1521 states and 2280 transitions. [2022-07-11 23:47:24,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-11 23:47:24,036 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:47:24,036 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] [2022-07-11 23:47:24,037 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-11 23:47:24,037 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:47:24,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:47:24,037 INFO L85 PathProgramCache]: Analyzing trace with hash 405401967, now seen corresponding path program 1 times [2022-07-11 23:47:24,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:47:24,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494770085] [2022-07-11 23:47:24,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:47:24,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:47:24,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:47:24,098 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-11 23:47:24,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:47:24,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494770085] [2022-07-11 23:47:24,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494770085] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:47:24,099 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:47:24,099 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:47:24,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311123437] [2022-07-11 23:47:24,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:47:24,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:47:24,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:47:24,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:47:24,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:47:24,100 INFO L87 Difference]: Start difference. First operand 1521 states and 2280 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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-11 23:47:24,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:47:24,171 INFO L93 Difference]: Finished difference Result 1524 states and 2282 transitions. [2022-07-11 23:47:24,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:47:24,172 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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 22 [2022-07-11 23:47:24,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:47:24,178 INFO L225 Difference]: With dead ends: 1524 [2022-07-11 23:47:24,178 INFO L226 Difference]: Without dead ends: 1520 [2022-07-11 23:47:24,179 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-11 23:47:24,179 INFO L413 NwaCegarLoop]: 878 mSDtfsCounter, 22 mSDsluCounter, 833 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 1711 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-11 23:47:24,180 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 1711 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 23:47:24,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1520 states. [2022-07-11 23:47:24,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1520 to 1520. [2022-07-11 23:47:24,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1520 states, 1219 states have (on average 1.44298605414274) internal successors, (1759), 1216 states have internal predecessors, (1759), 224 states have call successors, (224), 70 states have call predecessors, (224), 76 states have return successors, (294), 233 states have call predecessors, (294), 216 states have call successors, (294) [2022-07-11 23:47:24,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1520 states to 1520 states and 2277 transitions. [2022-07-11 23:47:24,219 INFO L78 Accepts]: Start accepts. Automaton has 1520 states and 2277 transitions. Word has length 22 [2022-07-11 23:47:24,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:47:24,219 INFO L495 AbstractCegarLoop]: Abstraction has 1520 states and 2277 transitions. [2022-07-11 23:47:24,220 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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-11 23:47:24,220 INFO L276 IsEmpty]: Start isEmpty. Operand 1520 states and 2277 transitions. [2022-07-11 23:47:24,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-11 23:47:24,221 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:47:24,221 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-11 23:47:24,221 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-11 23:47:24,222 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:47:24,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:47:24,222 INFO L85 PathProgramCache]: Analyzing trace with hash -605609214, now seen corresponding path program 1 times [2022-07-11 23:47:24,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:47:24,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983725623] [2022-07-11 23:47:24,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:47:24,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:47:24,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:47:24,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-11 23:47:24,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:47:24,297 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-11 23:47:24,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:47:24,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983725623] [2022-07-11 23:47:24,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983725623] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:47:24,298 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:47:24,298 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-11 23:47:24,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794480272] [2022-07-11 23:47:24,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:47:24,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-11 23:47:24,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:47:24,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-11 23:47:24,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:47:24,300 INFO L87 Difference]: Start difference. First operand 1520 states and 2277 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-11 23:47:28,390 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:47:30,553 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:47:33,700 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:47:35,817 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:47:37,157 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:47:37,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:47:37,247 INFO L93 Difference]: Finished difference Result 2367 states and 3491 transitions. [2022-07-11 23:47:37,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-11 23:47:37,248 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2022-07-11 23:47:37,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:47:37,253 INFO L225 Difference]: With dead ends: 2367 [2022-07-11 23:47:37,255 INFO L226 Difference]: Without dead ends: 1281 [2022-07-11 23:47:37,256 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 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-11 23:47:37,257 INFO L413 NwaCegarLoop]: 959 mSDtfsCounter, 804 mSDsluCounter, 1585 mSDsCounter, 0 mSdLazyCounter, 482 mSolverCounterSat, 287 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 807 SdHoareTripleChecker+Valid, 2544 SdHoareTripleChecker+Invalid, 773 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 287 IncrementalHoareTripleChecker+Valid, 482 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.9s IncrementalHoareTripleChecker+Time [2022-07-11 23:47:37,257 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [807 Valid, 2544 Invalid, 773 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [287 Valid, 482 Invalid, 4 Unknown, 0 Unchecked, 12.9s Time] [2022-07-11 23:47:37,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1281 states. [2022-07-11 23:47:37,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1281 to 1137. [2022-07-11 23:47:37,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1137 states, 912 states have (on average 1.4221491228070176) internal successors, (1297), 911 states have internal predecessors, (1297), 163 states have call successors, (163), 55 states have call predecessors, (163), 61 states have return successors, (215), 170 states have call predecessors, (215), 155 states have call successors, (215) [2022-07-11 23:47:37,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1137 states to 1137 states and 1675 transitions. [2022-07-11 23:47:37,288 INFO L78 Accepts]: Start accepts. Automaton has 1137 states and 1675 transitions. Word has length 35 [2022-07-11 23:47:37,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:47:37,289 INFO L495 AbstractCegarLoop]: Abstraction has 1137 states and 1675 transitions. [2022-07-11 23:47:37,290 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-11 23:47:37,290 INFO L276 IsEmpty]: Start isEmpty. Operand 1137 states and 1675 transitions. [2022-07-11 23:47:37,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-11 23:47:37,292 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:47:37,292 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] [2022-07-11 23:47:37,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-11 23:47:37,293 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:47:37,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:47:37,293 INFO L85 PathProgramCache]: Analyzing trace with hash -81924256, now seen corresponding path program 1 times [2022-07-11 23:47:37,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:47:37,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126899393] [2022-07-11 23:47:37,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:47:37,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:47:37,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:47:37,385 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-11 23:47:37,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:47:37,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126899393] [2022-07-11 23:47:37,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126899393] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:47:37,386 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:47:37,386 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:47:37,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724772875] [2022-07-11 23:47:37,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:47:37,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:47:37,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:47:37,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:47:37,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:47:37,387 INFO L87 Difference]: Start difference. First operand 1137 states and 1675 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 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-11 23:47:37,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:47:37,702 INFO L93 Difference]: Finished difference Result 1200 states and 1757 transitions. [2022-07-11 23:47:37,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:47:37,702 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 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 31 [2022-07-11 23:47:37,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:47:37,707 INFO L225 Difference]: With dead ends: 1200 [2022-07-11 23:47:37,707 INFO L226 Difference]: Without dead ends: 1155 [2022-07-11 23:47:37,708 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-11 23:47:37,708 INFO L413 NwaCegarLoop]: 875 mSDtfsCounter, 924 mSDsluCounter, 638 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 924 SdHoareTripleChecker+Valid, 1513 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-11 23:47:37,710 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [924 Valid, 1513 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-11 23:47:37,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1155 states. [2022-07-11 23:47:37,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1155 to 1137. [2022-07-11 23:47:37,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1137 states, 912 states have (on average 1.4199561403508771) internal successors, (1295), 911 states have internal predecessors, (1295), 163 states have call successors, (163), 55 states have call predecessors, (163), 61 states have return successors, (215), 170 states have call predecessors, (215), 155 states have call successors, (215) [2022-07-11 23:47:37,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1137 states to 1137 states and 1673 transitions. [2022-07-11 23:47:37,755 INFO L78 Accepts]: Start accepts. Automaton has 1137 states and 1673 transitions. Word has length 31 [2022-07-11 23:47:37,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:47:37,756 INFO L495 AbstractCegarLoop]: Abstraction has 1137 states and 1673 transitions. [2022-07-11 23:47:37,756 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 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-11 23:47:37,756 INFO L276 IsEmpty]: Start isEmpty. Operand 1137 states and 1673 transitions. [2022-07-11 23:47:37,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-07-11 23:47:37,757 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:47:37,757 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-11 23:47:37,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-11 23:47:37,758 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:47:37,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:47:37,758 INFO L85 PathProgramCache]: Analyzing trace with hash -1935229893, now seen corresponding path program 1 times [2022-07-11 23:47:37,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:47:37,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417300196] [2022-07-11 23:47:37,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:47:37,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:47:37,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:47:37,821 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-11 23:47:37,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:47:37,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417300196] [2022-07-11 23:47:37,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417300196] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:47:37,822 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:47:37,822 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:47:37,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075675654] [2022-07-11 23:47:37,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:47:37,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:47:37,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:47:37,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:47:37,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:47:37,824 INFO L87 Difference]: Start difference. First operand 1137 states and 1673 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 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-11 23:47:38,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:47:38,108 INFO L93 Difference]: Finished difference Result 1189 states and 1739 transitions. [2022-07-11 23:47:38,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:47:38,109 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 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 33 [2022-07-11 23:47:38,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:47:38,114 INFO L225 Difference]: With dead ends: 1189 [2022-07-11 23:47:38,114 INFO L226 Difference]: Without dead ends: 1116 [2022-07-11 23:47:38,115 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-11 23:47:38,116 INFO L413 NwaCegarLoop]: 873 mSDtfsCounter, 904 mSDsluCounter, 638 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 904 SdHoareTripleChecker+Valid, 1511 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-11 23:47:38,117 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [904 Valid, 1511 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-11 23:47:38,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1116 states. [2022-07-11 23:47:38,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1116 to 1114. [2022-07-11 23:47:38,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1114 states, 891 states have (on average 1.425364758698092) internal successors, (1270), 897 states have internal predecessors, (1270), 163 states have call successors, (163), 55 states have call predecessors, (163), 59 states have return successors, (206), 161 states have call predecessors, (206), 155 states have call successors, (206) [2022-07-11 23:47:38,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1114 states to 1114 states and 1639 transitions. [2022-07-11 23:47:38,147 INFO L78 Accepts]: Start accepts. Automaton has 1114 states and 1639 transitions. Word has length 33 [2022-07-11 23:47:38,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:47:38,147 INFO L495 AbstractCegarLoop]: Abstraction has 1114 states and 1639 transitions. [2022-07-11 23:47:38,147 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 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-11 23:47:38,147 INFO L276 IsEmpty]: Start isEmpty. Operand 1114 states and 1639 transitions. [2022-07-11 23:47:38,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-07-11 23:47:38,149 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:47:38,149 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-11 23:47:38,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-11 23:47:38,150 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:47:38,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:47:38,150 INFO L85 PathProgramCache]: Analyzing trace with hash 1785748283, now seen corresponding path program 1 times [2022-07-11 23:47:38,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:47:38,151 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306065092] [2022-07-11 23:47:38,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:47:38,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:47:38,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:47:38,221 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-11 23:47:38,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:47:38,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306065092] [2022-07-11 23:47:38,222 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306065092] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:47:38,222 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:47:38,222 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:47:38,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878126261] [2022-07-11 23:47:38,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:47:38,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:47:38,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:47:38,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:47:38,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:47:38,224 INFO L87 Difference]: Start difference. First operand 1114 states and 1639 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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-11 23:47:38,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:47:38,281 INFO L93 Difference]: Finished difference Result 1191 states and 1741 transitions. [2022-07-11 23:47:38,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:47:38,282 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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 33 [2022-07-11 23:47:38,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:47:38,285 INFO L225 Difference]: With dead ends: 1191 [2022-07-11 23:47:38,286 INFO L226 Difference]: Without dead ends: 1172 [2022-07-11 23:47:38,286 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-11 23:47:38,286 INFO L413 NwaCegarLoop]: 880 mSDtfsCounter, 866 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 866 SdHoareTripleChecker+Valid, 937 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-11 23:47:38,287 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [866 Valid, 937 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 23:47:38,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1172 states. [2022-07-11 23:47:38,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1172 to 1150. [2022-07-11 23:47:38,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1150 states, 924 states have (on average 1.4274891774891776) internal successors, (1319), 930 states have internal predecessors, (1319), 164 states have call successors, (164), 56 states have call predecessors, (164), 61 states have return successors, (208), 163 states have call predecessors, (208), 156 states have call successors, (208) [2022-07-11 23:47:38,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1150 states to 1150 states and 1691 transitions. [2022-07-11 23:47:38,320 INFO L78 Accepts]: Start accepts. Automaton has 1150 states and 1691 transitions. Word has length 33 [2022-07-11 23:47:38,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:47:38,322 INFO L495 AbstractCegarLoop]: Abstraction has 1150 states and 1691 transitions. [2022-07-11 23:47:38,322 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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-11 23:47:38,322 INFO L276 IsEmpty]: Start isEmpty. Operand 1150 states and 1691 transitions. [2022-07-11 23:47:38,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-07-11 23:47:38,324 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:47:38,324 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-11 23:47:38,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-11 23:47:38,324 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:47:38,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:47:38,325 INFO L85 PathProgramCache]: Analyzing trace with hash 1771403374, now seen corresponding path program 1 times [2022-07-11 23:47:38,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:47:38,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426318400] [2022-07-11 23:47:38,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:47:38,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:47:38,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:47:38,379 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-11 23:47:38,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:47:38,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426318400] [2022-07-11 23:47:38,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426318400] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:47:38,380 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:47:38,380 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:47:38,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23496534] [2022-07-11 23:47:38,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:47:38,381 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:47:38,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:47:38,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:47:38,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:47:38,382 INFO L87 Difference]: Start difference. First operand 1150 states and 1691 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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-11 23:47:38,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:47:38,455 INFO L93 Difference]: Finished difference Result 1473 states and 2153 transitions. [2022-07-11 23:47:38,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:47:38,455 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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 33 [2022-07-11 23:47:38,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:47:38,460 INFO L225 Difference]: With dead ends: 1473 [2022-07-11 23:47:38,460 INFO L226 Difference]: Without dead ends: 1457 [2022-07-11 23:47:38,461 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-11 23:47:38,461 INFO L413 NwaCegarLoop]: 1178 mSDtfsCounter, 354 mSDsluCounter, 823 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 354 SdHoareTripleChecker+Valid, 2001 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-11 23:47:38,462 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [354 Valid, 2001 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 23:47:38,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1457 states. [2022-07-11 23:47:38,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1457 to 1175. [2022-07-11 23:47:38,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1175 states, 947 states have (on average 1.4181626187961984) internal successors, (1343), 953 states have internal predecessors, (1343), 164 states have call successors, (164), 56 states have call predecessors, (164), 63 states have return successors, (209), 165 states have call predecessors, (209), 156 states have call successors, (209) [2022-07-11 23:47:38,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1175 states to 1175 states and 1716 transitions. [2022-07-11 23:47:38,499 INFO L78 Accepts]: Start accepts. Automaton has 1175 states and 1716 transitions. Word has length 33 [2022-07-11 23:47:38,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:47:38,499 INFO L495 AbstractCegarLoop]: Abstraction has 1175 states and 1716 transitions. [2022-07-11 23:47:38,499 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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-11 23:47:38,499 INFO L276 IsEmpty]: Start isEmpty. Operand 1175 states and 1716 transitions. [2022-07-11 23:47:38,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-11 23:47:38,500 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:47:38,500 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] [2022-07-11 23:47:38,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-11 23:47:38,501 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:47:38,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:47:38,501 INFO L85 PathProgramCache]: Analyzing trace with hash 477313322, now seen corresponding path program 1 times [2022-07-11 23:47:38,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:47:38,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114572615] [2022-07-11 23:47:38,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:47:38,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:47:38,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:47:38,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-11 23:47:38,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:47:38,618 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-11 23:47:38,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:47:38,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114572615] [2022-07-11 23:47:38,619 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114572615] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:47:38,619 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:47:38,619 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:47:38,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123594625] [2022-07-11 23:47:38,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:47:38,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:47:38,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:47:38,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:47:38,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:47:38,620 INFO L87 Difference]: Start difference. First operand 1175 states and 1716 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-11 23:47:42,471 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:47:44,628 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:47:47,604 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:47:49,201 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:47:51,221 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:47:51,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:47:51,319 INFO L93 Difference]: Finished difference Result 1829 states and 2683 transitions. [2022-07-11 23:47:51,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:47:51,321 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2022-07-11 23:47:51,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:47:51,325 INFO L225 Difference]: With dead ends: 1829 [2022-07-11 23:47:51,326 INFO L226 Difference]: Without dead ends: 1167 [2022-07-11 23:47:51,327 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-11 23:47:51,327 INFO L413 NwaCegarLoop]: 850 mSDtfsCounter, 915 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 135 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 975 SdHoareTripleChecker+Valid, 1247 SdHoareTripleChecker+Invalid, 458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.6s IncrementalHoareTripleChecker+Time [2022-07-11 23:47:51,327 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [975 Valid, 1247 Invalid, 458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 319 Invalid, 4 Unknown, 0 Unchecked, 12.6s Time] [2022-07-11 23:47:51,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1167 states. [2022-07-11 23:47:51,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1167 to 1108. [2022-07-11 23:47:51,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1108 states, 887 states have (on average 1.4126268320180384) internal successors, (1253), 891 states have internal predecessors, (1253), 161 states have call successors, (161), 55 states have call predecessors, (161), 59 states have return successors, (205), 161 states have call predecessors, (205), 155 states have call successors, (205) [2022-07-11 23:47:51,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1108 states to 1108 states and 1619 transitions. [2022-07-11 23:47:51,364 INFO L78 Accepts]: Start accepts. Automaton has 1108 states and 1619 transitions. Word has length 36 [2022-07-11 23:47:51,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:47:51,364 INFO L495 AbstractCegarLoop]: Abstraction has 1108 states and 1619 transitions. [2022-07-11 23:47:51,364 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-11 23:47:51,364 INFO L276 IsEmpty]: Start isEmpty. Operand 1108 states and 1619 transitions. [2022-07-11 23:47:51,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-11 23:47:51,365 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:47:51,365 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-11 23:47:51,366 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-11 23:47:51,366 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:47:51,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:47:51,366 INFO L85 PathProgramCache]: Analyzing trace with hash -467724112, now seen corresponding path program 1 times [2022-07-11 23:47:51,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:47:51,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920093197] [2022-07-11 23:47:51,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:47:51,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:47:51,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:47:51,446 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-11 23:47:51,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:47:51,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920093197] [2022-07-11 23:47:51,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920093197] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:47:51,447 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:47:51,447 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-11 23:47:51,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400764956] [2022-07-11 23:47:51,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:47:51,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-11 23:47:51,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:47:51,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-11 23:47:51,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-11 23:47:51,448 INFO L87 Difference]: Start difference. First operand 1108 states and 1619 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 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-11 23:47:51,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:47:51,546 INFO L93 Difference]: Finished difference Result 1122 states and 1634 transitions. [2022-07-11 23:47:51,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-11 23:47:51,546 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 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-11 23:47:51,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:47:51,550 INFO L225 Difference]: With dead ends: 1122 [2022-07-11 23:47:51,551 INFO L226 Difference]: Without dead ends: 1118 [2022-07-11 23:47:51,551 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-11 23:47:51,552 INFO L413 NwaCegarLoop]: 866 mSDtfsCounter, 42 mSDsluCounter, 3417 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 4283 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-11 23:47:51,552 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 4283 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 23:47:51,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1118 states. [2022-07-11 23:47:51,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1118 to 1116. [2022-07-11 23:47:51,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1116 states, 895 states have (on average 1.4100558659217877) internal successors, (1262), 899 states have internal predecessors, (1262), 161 states have call successors, (161), 55 states have call predecessors, (161), 59 states have return successors, (205), 161 states have call predecessors, (205), 155 states have call successors, (205) [2022-07-11 23:47:51,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1116 states to 1116 states and 1628 transitions. [2022-07-11 23:47:51,588 INFO L78 Accepts]: Start accepts. Automaton has 1116 states and 1628 transitions. Word has length 34 [2022-07-11 23:47:51,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:47:51,588 INFO L495 AbstractCegarLoop]: Abstraction has 1116 states and 1628 transitions. [2022-07-11 23:47:51,588 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 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-11 23:47:51,589 INFO L276 IsEmpty]: Start isEmpty. Operand 1116 states and 1628 transitions. [2022-07-11 23:47:51,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-11 23:47:51,590 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:47:51,590 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-11 23:47:51,590 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-11 23:47:51,590 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:47:51,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:47:51,590 INFO L85 PathProgramCache]: Analyzing trace with hash -468000942, now seen corresponding path program 1 times [2022-07-11 23:47:51,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:47:51,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745029951] [2022-07-11 23:47:51,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:47:51,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:47:51,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:47:51,654 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-11 23:47:51,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:47:51,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745029951] [2022-07-11 23:47:51,655 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745029951] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:47:51,655 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:47:51,655 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:47:51,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93607905] [2022-07-11 23:47:51,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:47:51,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:47:51,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:47:51,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:47:51,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:47:51,656 INFO L87 Difference]: Start difference. First operand 1116 states and 1628 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-11 23:47:52,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:47:52,054 INFO L93 Difference]: Finished difference Result 1385 states and 2024 transitions. [2022-07-11 23:47:52,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:47:52,055 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-11 23:47:52,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:47:52,059 INFO L225 Difference]: With dead ends: 1385 [2022-07-11 23:47:52,059 INFO L226 Difference]: Without dead ends: 1357 [2022-07-11 23:47:52,060 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-11 23:47:52,060 INFO L413 NwaCegarLoop]: 1155 mSDtfsCounter, 1145 mSDsluCounter, 625 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1155 SdHoareTripleChecker+Valid, 1780 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-11 23:47:52,060 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1155 Valid, 1780 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-11 23:47:52,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1357 states. [2022-07-11 23:47:52,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1357 to 1094. [2022-07-11 23:47:52,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1094 states, 873 states have (on average 1.4158075601374571) internal successors, (1236), 877 states have internal predecessors, (1236), 161 states have call successors, (161), 55 states have call predecessors, (161), 59 states have return successors, (205), 161 states have call predecessors, (205), 155 states have call successors, (205) [2022-07-11 23:47:52,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1094 states to 1094 states and 1602 transitions. [2022-07-11 23:47:52,098 INFO L78 Accepts]: Start accepts. Automaton has 1094 states and 1602 transitions. Word has length 34 [2022-07-11 23:47:52,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:47:52,098 INFO L495 AbstractCegarLoop]: Abstraction has 1094 states and 1602 transitions. [2022-07-11 23:47:52,098 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-11 23:47:52,098 INFO L276 IsEmpty]: Start isEmpty. Operand 1094 states and 1602 transitions. [2022-07-11 23:47:52,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-11 23:47:52,100 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:47:52,100 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-11 23:47:52,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-11 23:47:52,100 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:47:52,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:47:52,100 INFO L85 PathProgramCache]: Analyzing trace with hash 962516437, now seen corresponding path program 1 times [2022-07-11 23:47:52,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:47:52,101 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015921596] [2022-07-11 23:47:52,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:47:52,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:47:52,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:47:52,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-11 23:47:52,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:47:52,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-11 23:47:52,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:47:52,184 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-11 23:47:52,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:47:52,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015921596] [2022-07-11 23:47:52,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015921596] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:47:52,184 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:47:52,184 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-11 23:47:52,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377265709] [2022-07-11 23:47:52,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:47:52,185 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-11 23:47:52,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:47:52,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-11 23:47:52,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:47:52,186 INFO L87 Difference]: Start difference. First operand 1094 states and 1602 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 3 states have internal predecessors, (36), 3 states have call successors, (5), 5 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-11 23:47:56,460 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:47:59,437 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:48:01,762 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:48:03,766 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.93s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:48:04,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:48:04,390 INFO L93 Difference]: Finished difference Result 1794 states and 2641 transitions. [2022-07-11 23:48:04,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-11 23:48:04,392 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 3 states have internal predecessors, (36), 3 states have call successors, (5), 5 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 43 [2022-07-11 23:48:04,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:48:04,396 INFO L225 Difference]: With dead ends: 1794 [2022-07-11 23:48:04,396 INFO L226 Difference]: Without dead ends: 1226 [2022-07-11 23:48:04,397 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-11 23:48:04,398 INFO L413 NwaCegarLoop]: 914 mSDtfsCounter, 615 mSDsluCounter, 1446 mSDsCounter, 0 mSdLazyCounter, 606 mSolverCounterSat, 264 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 644 SdHoareTripleChecker+Valid, 2360 SdHoareTripleChecker+Invalid, 872 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 264 IncrementalHoareTripleChecker+Valid, 606 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:48:04,398 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [644 Valid, 2360 Invalid, 872 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [264 Valid, 606 Invalid, 2 Unknown, 0 Unchecked, 12.1s Time] [2022-07-11 23:48:04,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1226 states. [2022-07-11 23:48:04,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1226 to 1053. [2022-07-11 23:48:04,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1053 states, 840 states have (on average 1.4166666666666667) internal successors, (1190), 847 states have internal predecessors, (1190), 156 states have call successors, (156), 51 states have call predecessors, (156), 56 states have return successors, (212), 154 states have call predecessors, (212), 150 states have call successors, (212) [2022-07-11 23:48:04,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1053 states to 1053 states and 1558 transitions. [2022-07-11 23:48:04,434 INFO L78 Accepts]: Start accepts. Automaton has 1053 states and 1558 transitions. Word has length 43 [2022-07-11 23:48:04,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:48:04,434 INFO L495 AbstractCegarLoop]: Abstraction has 1053 states and 1558 transitions. [2022-07-11 23:48:04,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 3 states have internal predecessors, (36), 3 states have call successors, (5), 5 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-11 23:48:04,434 INFO L276 IsEmpty]: Start isEmpty. Operand 1053 states and 1558 transitions. [2022-07-11 23:48:04,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-11 23:48:04,435 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:48:04,436 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-11 23:48:04,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-11 23:48:04,436 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:48:04,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:48:04,436 INFO L85 PathProgramCache]: Analyzing trace with hash 314723646, now seen corresponding path program 1 times [2022-07-11 23:48:04,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:48:04,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947527730] [2022-07-11 23:48:04,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:48:04,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:48:04,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:48:04,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-11 23:48:04,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:48:04,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-11 23:48:04,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:48:04,502 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-11 23:48:04,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:48:04,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947527730] [2022-07-11 23:48:04,504 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947527730] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:48:04,504 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:48:04,504 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-11 23:48:04,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839016375] [2022-07-11 23:48:04,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:48:04,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-11 23:48:04,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:48:04,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-11 23:48:04,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:48:04,506 INFO L87 Difference]: Start difference. First operand 1053 states and 1558 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (3), 3 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-11 23:48:08,678 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:48:10,832 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:48:12,754 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.92s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:48:15,164 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:48:17,256 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:48:19,287 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:48:19,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:48:19,381 INFO L93 Difference]: Finished difference Result 1167 states and 1731 transitions. [2022-07-11 23:48:19,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-11 23:48:19,382 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), 2 states have call successors, (3), 3 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 43 [2022-07-11 23:48:19,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:48:19,386 INFO L225 Difference]: With dead ends: 1167 [2022-07-11 23:48:19,386 INFO L226 Difference]: Without dead ends: 1138 [2022-07-11 23:48:19,387 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-11 23:48:19,387 INFO L413 NwaCegarLoop]: 827 mSDtfsCounter, 291 mSDsluCounter, 1552 mSDsCounter, 0 mSdLazyCounter, 644 mSolverCounterSat, 253 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 2379 SdHoareTripleChecker+Invalid, 902 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 253 IncrementalHoareTripleChecker+Valid, 644 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.8s IncrementalHoareTripleChecker+Time [2022-07-11 23:48:19,387 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 2379 Invalid, 902 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [253 Valid, 644 Invalid, 5 Unknown, 0 Unchecked, 14.8s Time] [2022-07-11 23:48:19,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1138 states. [2022-07-11 23:48:19,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1138 to 1054. [2022-07-11 23:48:19,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1054 states, 841 states have (on average 1.4161712247324614) internal successors, (1191), 848 states have internal predecessors, (1191), 156 states have call successors, (156), 51 states have call predecessors, (156), 56 states have return successors, (212), 154 states have call predecessors, (212), 150 states have call successors, (212) [2022-07-11 23:48:19,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1054 states to 1054 states and 1559 transitions. [2022-07-11 23:48:19,434 INFO L78 Accepts]: Start accepts. Automaton has 1054 states and 1559 transitions. Word has length 43 [2022-07-11 23:48:19,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:48:19,435 INFO L495 AbstractCegarLoop]: Abstraction has 1054 states and 1559 transitions. [2022-07-11 23:48:19,435 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), 2 states have call successors, (3), 3 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-11 23:48:19,435 INFO L276 IsEmpty]: Start isEmpty. Operand 1054 states and 1559 transitions. [2022-07-11 23:48:19,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-11 23:48:19,437 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:48:19,437 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-11 23:48:19,437 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-11 23:48:19,437 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:48:19,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:48:19,437 INFO L85 PathProgramCache]: Analyzing trace with hash 737425472, now seen corresponding path program 1 times [2022-07-11 23:48:19,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:48:19,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692881734] [2022-07-11 23:48:19,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:48:19,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:48:19,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:48:19,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-11 23:48:19,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:48:19,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-11 23:48:19,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:48:19,526 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-11 23:48:19,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:48:19,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692881734] [2022-07-11 23:48:19,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692881734] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:48:19,527 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:48:19,527 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-11 23:48:19,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551553703] [2022-07-11 23:48:19,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:48:19,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-11 23:48:19,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:48:19,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-11 23:48:19,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:48:19,528 INFO L87 Difference]: Start difference. First operand 1054 states and 1559 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 3 states have internal predecessors, (38), 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-11 23:48:23,502 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:48:25,470 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.82s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:48:27,105 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:48:29,517 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:48:30,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:48:30,866 INFO L93 Difference]: Finished difference Result 1136 states and 1692 transitions. [2022-07-11 23:48:30,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-11 23:48:30,869 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), 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 43 [2022-07-11 23:48:30,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:48:30,873 INFO L225 Difference]: With dead ends: 1136 [2022-07-11 23:48:30,873 INFO L226 Difference]: Without dead ends: 1129 [2022-07-11 23:48:30,873 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-11 23:48:30,874 INFO L413 NwaCegarLoop]: 825 mSDtfsCounter, 261 mSDsluCounter, 1559 mSDsCounter, 0 mSdLazyCounter, 665 mSolverCounterSat, 241 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 2384 SdHoareTripleChecker+Invalid, 908 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 241 IncrementalHoareTripleChecker+Valid, 665 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.3s IncrementalHoareTripleChecker+Time [2022-07-11 23:48:30,874 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [261 Valid, 2384 Invalid, 908 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [241 Valid, 665 Invalid, 2 Unknown, 0 Unchecked, 11.3s Time] [2022-07-11 23:48:30,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1129 states. [2022-07-11 23:48:30,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1129 to 1066. [2022-07-11 23:48:30,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1066 states, 853 states have (on average 1.4126611957796014) internal successors, (1205), 860 states have internal predecessors, (1205), 156 states have call successors, (156), 51 states have call predecessors, (156), 56 states have return successors, (212), 154 states have call predecessors, (212), 150 states have call successors, (212) [2022-07-11 23:48:30,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1066 states to 1066 states and 1573 transitions. [2022-07-11 23:48:30,911 INFO L78 Accepts]: Start accepts. Automaton has 1066 states and 1573 transitions. Word has length 43 [2022-07-11 23:48:30,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:48:30,912 INFO L495 AbstractCegarLoop]: Abstraction has 1066 states and 1573 transitions. [2022-07-11 23:48:30,912 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), 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-11 23:48:30,912 INFO L276 IsEmpty]: Start isEmpty. Operand 1066 states and 1573 transitions. [2022-07-11 23:48:30,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-11 23:48:30,913 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:48:30,913 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-11 23:48:30,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-11 23:48:30,914 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:48:30,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:48:30,914 INFO L85 PathProgramCache]: Analyzing trace with hash 975586301, now seen corresponding path program 1 times [2022-07-11 23:48:30,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:48:30,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805526007] [2022-07-11 23:48:30,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:48:30,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:48:30,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:48:30,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-11 23:48:30,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:48:31,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-11 23:48:31,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:48:31,005 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-11 23:48:31,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:48:31,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805526007] [2022-07-11 23:48:31,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805526007] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:48:31,006 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:48:31,006 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-11 23:48:31,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753101851] [2022-07-11 23:48:31,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:48:31,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-11 23:48:31,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:48:31,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-11 23:48:31,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:48:31,007 INFO L87 Difference]: Start difference. First operand 1066 states and 1573 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), 4 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-11 23:48:35,080 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:48:37,213 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:48:39,236 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:48:41,684 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:48:43,775 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:48:44,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:48:44,843 INFO L93 Difference]: Finished difference Result 1206 states and 1776 transitions. [2022-07-11 23:48:44,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-11 23:48:44,845 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), 4 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-11 23:48:44,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:48:44,849 INFO L225 Difference]: With dead ends: 1206 [2022-07-11 23:48:44,849 INFO L226 Difference]: Without dead ends: 1131 [2022-07-11 23:48:44,849 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-11 23:48:44,850 INFO L413 NwaCegarLoop]: 835 mSDtfsCounter, 901 mSDsluCounter, 1195 mSDsCounter, 0 mSdLazyCounter, 579 mSolverCounterSat, 281 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 964 SdHoareTripleChecker+Valid, 2030 SdHoareTripleChecker+Invalid, 865 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 281 IncrementalHoareTripleChecker+Valid, 579 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.7s IncrementalHoareTripleChecker+Time [2022-07-11 23:48:44,850 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [964 Valid, 2030 Invalid, 865 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [281 Valid, 579 Invalid, 5 Unknown, 0 Unchecked, 13.7s Time] [2022-07-11 23:48:44,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1131 states. [2022-07-11 23:48:44,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1131 to 1055. [2022-07-11 23:48:44,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1055 states, 846 states have (on average 1.41371158392435) internal successors, (1196), 853 states have internal predecessors, (1196), 154 states have call successors, (154), 49 states have call predecessors, (154), 54 states have return successors, (210), 152 states have call predecessors, (210), 148 states have call successors, (210) [2022-07-11 23:48:44,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1055 states to 1055 states and 1560 transitions. [2022-07-11 23:48:44,904 INFO L78 Accepts]: Start accepts. Automaton has 1055 states and 1560 transitions. Word has length 44 [2022-07-11 23:48:44,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:48:44,904 INFO L495 AbstractCegarLoop]: Abstraction has 1055 states and 1560 transitions. [2022-07-11 23:48:44,904 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), 4 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-11 23:48:44,904 INFO L276 IsEmpty]: Start isEmpty. Operand 1055 states and 1560 transitions. [2022-07-11 23:48:44,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-07-11 23:48:44,906 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:48:44,906 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] [2022-07-11 23:48:44,906 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-11 23:48:44,906 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:48:44,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:48:44,907 INFO L85 PathProgramCache]: Analyzing trace with hash -1737788824, now seen corresponding path program 1 times [2022-07-11 23:48:44,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:48:44,907 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027105388] [2022-07-11 23:48:44,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:48:44,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:48:44,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:48:44,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-11 23:48:44,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:48:44,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-11 23:48:45,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:48:45,030 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-11 23:48:45,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:48:45,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027105388] [2022-07-11 23:48:45,031 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027105388] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:48:45,031 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:48:45,031 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-11 23:48:45,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745949669] [2022-07-11 23:48:45,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:48:45,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-11 23:48:45,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:48:45,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-11 23:48:45,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-07-11 23:48:45,033 INFO L87 Difference]: Start difference. First operand 1055 states and 1560 transitions. Second operand has 10 states, 10 states have (on average 4.2) internal successors, (42), 7 states have internal predecessors, (42), 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-11 23:48:52,849 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:48:55,022 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:48:57,056 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:48:59,469 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:49:00,912 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:49:02,935 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:49:03,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:49:03,022 INFO L93 Difference]: Finished difference Result 1107 states and 1648 transitions. [2022-07-11 23:49:03,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-11 23:49:03,024 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 7 states have internal predecessors, (42), 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 47 [2022-07-11 23:49:03,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:49:03,028 INFO L225 Difference]: With dead ends: 1107 [2022-07-11 23:49:03,028 INFO L226 Difference]: Without dead ends: 1092 [2022-07-11 23:49:03,028 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-11 23:49:03,029 INFO L413 NwaCegarLoop]: 840 mSDtfsCounter, 90 mSDsluCounter, 5255 mSDsCounter, 0 mSdLazyCounter, 1580 mSolverCounterSat, 103 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 6095 SdHoareTripleChecker+Invalid, 1688 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 1580 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.9s IncrementalHoareTripleChecker+Time [2022-07-11 23:49:03,029 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 6095 Invalid, 1688 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 1580 Invalid, 5 Unknown, 0 Unchecked, 17.9s Time] [2022-07-11 23:49:03,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1092 states. [2022-07-11 23:49:03,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1092 to 1053. [2022-07-11 23:49:03,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1053 states, 845 states have (on average 1.4130177514792899) internal successors, (1194), 852 states have internal predecessors, (1194), 153 states have call successors, (153), 49 states have call predecessors, (153), 54 states have return successors, (209), 151 states have call predecessors, (209), 147 states have call successors, (209) [2022-07-11 23:49:03,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1053 states to 1053 states and 1556 transitions. [2022-07-11 23:49:03,071 INFO L78 Accepts]: Start accepts. Automaton has 1053 states and 1556 transitions. Word has length 47 [2022-07-11 23:49:03,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:49:03,071 INFO L495 AbstractCegarLoop]: Abstraction has 1053 states and 1556 transitions. [2022-07-11 23:49:03,071 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 7 states have internal predecessors, (42), 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-11 23:49:03,071 INFO L276 IsEmpty]: Start isEmpty. Operand 1053 states and 1556 transitions. [2022-07-11 23:49:03,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-11 23:49:03,073 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:49:03,073 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] [2022-07-11 23:49:03,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-11 23:49:03,073 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:49:03,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:49:03,074 INFO L85 PathProgramCache]: Analyzing trace with hash 1317341012, now seen corresponding path program 1 times [2022-07-11 23:49:03,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:49:03,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274341404] [2022-07-11 23:49:03,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:49:03,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:49:03,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:49:03,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-11 23:49:03,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:49:03,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-11 23:49:03,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:49:03,191 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-11 23:49:03,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:49:03,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274341404] [2022-07-11 23:49:03,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274341404] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:49:03,192 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:49:03,192 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-11 23:49:03,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341269473] [2022-07-11 23:49:03,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:49:03,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-11 23:49:03,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:49:03,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-11 23:49:03,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-07-11 23:49:03,194 INFO L87 Difference]: Start difference. First operand 1053 states and 1556 transitions. Second operand has 10 states, 10 states have (on average 4.0) internal successors, (40), 7 states have internal predecessors, (40), 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-11 23:49:09,345 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:49:11,502 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:49:12,720 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:49:14,435 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:49:16,511 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:49:18,471 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.96s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:49:18,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:49:18,595 INFO L93 Difference]: Finished difference Result 1104 states and 1643 transitions. [2022-07-11 23:49:18,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-11 23:49:18,597 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 7 states have internal predecessors, (40), 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 45 [2022-07-11 23:49:18,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:49:18,601 INFO L225 Difference]: With dead ends: 1104 [2022-07-11 23:49:18,601 INFO L226 Difference]: Without dead ends: 1089 [2022-07-11 23:49:18,602 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-11 23:49:18,602 INFO L413 NwaCegarLoop]: 832 mSDtfsCounter, 90 mSDsluCounter, 5212 mSDsCounter, 0 mSdLazyCounter, 1571 mSolverCounterSat, 102 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 6044 SdHoareTripleChecker+Invalid, 1675 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 1571 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.3s IncrementalHoareTripleChecker+Time [2022-07-11 23:49:18,602 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 6044 Invalid, 1675 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 1571 Invalid, 2 Unknown, 0 Unchecked, 15.3s Time] [2022-07-11 23:49:18,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1089 states. [2022-07-11 23:49:18,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1089 to 1050. [2022-07-11 23:49:18,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1050 states, 843 states have (on average 1.4128113879003559) internal successors, (1191), 850 states have internal predecessors, (1191), 152 states have call successors, (152), 49 states have call predecessors, (152), 54 states have return successors, (208), 150 states have call predecessors, (208), 146 states have call successors, (208) [2022-07-11 23:49:18,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1050 states to 1050 states and 1551 transitions. [2022-07-11 23:49:18,654 INFO L78 Accepts]: Start accepts. Automaton has 1050 states and 1551 transitions. Word has length 45 [2022-07-11 23:49:18,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:49:18,654 INFO L495 AbstractCegarLoop]: Abstraction has 1050 states and 1551 transitions. [2022-07-11 23:49:18,654 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 7 states have internal predecessors, (40), 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-11 23:49:18,654 INFO L276 IsEmpty]: Start isEmpty. Operand 1050 states and 1551 transitions. [2022-07-11 23:49:18,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-11 23:49:18,656 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:49:18,656 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] [2022-07-11 23:49:18,656 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-11 23:49:18,656 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:49:18,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:49:18,656 INFO L85 PathProgramCache]: Analyzing trace with hash 267737260, now seen corresponding path program 1 times [2022-07-11 23:49:18,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:49:18,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972887702] [2022-07-11 23:49:18,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:49:18,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:49:18,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:49:18,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-11 23:49:18,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:49:18,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-11 23:49:18,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:49:18,747 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-11 23:49:18,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:49:18,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972887702] [2022-07-11 23:49:18,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972887702] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:49:18,748 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:49:18,748 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-11 23:49:18,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802040025] [2022-07-11 23:49:18,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:49:18,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-11 23:49:18,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:49:18,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-11 23:49:18,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-11 23:49:18,750 INFO L87 Difference]: Start difference. First operand 1050 states and 1551 transitions. Second operand has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 5 states have internal predecessors, (40), 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-11 23:49:21,697 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:49:24,526 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:49:26,690 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:49:27,870 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:49:30,213 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:49:32,303 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:49:32,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:49:32,852 INFO L93 Difference]: Finished difference Result 1121 states and 1667 transitions. [2022-07-11 23:49:32,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-11 23:49:32,853 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 5 states have internal predecessors, (40), 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 45 [2022-07-11 23:49:32,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:49:32,857 INFO L225 Difference]: With dead ends: 1121 [2022-07-11 23:49:32,857 INFO L226 Difference]: Without dead ends: 1115 [2022-07-11 23:49:32,857 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2022-07-11 23:49:32,858 INFO L413 NwaCegarLoop]: 809 mSDtfsCounter, 1101 mSDsluCounter, 1987 mSDsCounter, 0 mSdLazyCounter, 1049 mSolverCounterSat, 293 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1191 SdHoareTripleChecker+Valid, 2796 SdHoareTripleChecker+Invalid, 1346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 293 IncrementalHoareTripleChecker+Valid, 1049 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.0s IncrementalHoareTripleChecker+Time [2022-07-11 23:49:32,858 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1191 Valid, 2796 Invalid, 1346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [293 Valid, 1049 Invalid, 4 Unknown, 0 Unchecked, 14.0s Time] [2022-07-11 23:49:32,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1115 states. [2022-07-11 23:49:32,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1115 to 1050. [2022-07-11 23:49:32,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1050 states, 843 states have (on average 1.4116251482799524) internal successors, (1190), 850 states have internal predecessors, (1190), 152 states have call successors, (152), 49 states have call predecessors, (152), 54 states have return successors, (208), 150 states have call predecessors, (208), 146 states have call successors, (208) [2022-07-11 23:49:32,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1050 states to 1050 states and 1550 transitions. [2022-07-11 23:49:32,908 INFO L78 Accepts]: Start accepts. Automaton has 1050 states and 1550 transitions. Word has length 45 [2022-07-11 23:49:32,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:49:32,908 INFO L495 AbstractCegarLoop]: Abstraction has 1050 states and 1550 transitions. [2022-07-11 23:49:32,909 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 5 states have internal predecessors, (40), 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-11 23:49:32,909 INFO L276 IsEmpty]: Start isEmpty. Operand 1050 states and 1550 transitions. [2022-07-11 23:49:32,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-11 23:49:32,910 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:49:32,910 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] [2022-07-11 23:49:32,910 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-11 23:49:32,910 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:49:32,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:49:32,911 INFO L85 PathProgramCache]: Analyzing trace with hash -234696471, now seen corresponding path program 1 times [2022-07-11 23:49:32,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:49:32,911 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365887059] [2022-07-11 23:49:32,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:49:32,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:49:32,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:49:32,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-11 23:49:32,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:49:33,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-11 23:49:33,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:49:33,011 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-11 23:49:33,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:49:33,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365887059] [2022-07-11 23:49:33,012 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365887059] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:49:33,012 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:49:33,012 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-11 23:49:33,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526167783] [2022-07-11 23:49:33,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:49:33,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-11 23:49:33,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:49:33,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-11 23:49:33,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-11 23:49:33,013 INFO L87 Difference]: Start difference. First operand 1050 states and 1550 transitions. Second operand has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 7 states have internal predecessors, (41), 3 states have call successors, (3), 3 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-11 23:49:39,507 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:49:41,667 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:49:43,690 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:49:46,160 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:49:48,437 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.19s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:49:49,633 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:49:49,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:49:49,774 INFO L93 Difference]: Finished difference Result 1133 states and 1683 transitions. [2022-07-11 23:49:49,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-11 23:49:49,777 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 7 states have internal predecessors, (41), 3 states have call successors, (3), 3 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 46 [2022-07-11 23:49:49,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:49:49,780 INFO L225 Difference]: With dead ends: 1133 [2022-07-11 23:49:49,780 INFO L226 Difference]: Without dead ends: 1107 [2022-07-11 23:49:49,781 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2022-07-11 23:49:49,781 INFO L413 NwaCegarLoop]: 813 mSDtfsCounter, 300 mSDsluCounter, 4316 mSDsCounter, 0 mSdLazyCounter, 1314 mSolverCounterSat, 239 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 5129 SdHoareTripleChecker+Invalid, 1558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 239 IncrementalHoareTripleChecker+Valid, 1314 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.6s IncrementalHoareTripleChecker+Time [2022-07-11 23:49:49,781 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 5129 Invalid, 1558 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [239 Valid, 1314 Invalid, 5 Unknown, 0 Unchecked, 16.6s Time] [2022-07-11 23:49:49,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1107 states. [2022-07-11 23:49:49,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1107 to 1045. [2022-07-11 23:49:49,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1045 states, 839 states have (on average 1.3945172824791419) internal successors, (1170), 846 states have internal predecessors, (1170), 151 states have call successors, (151), 49 states have call predecessors, (151), 54 states have return successors, (207), 149 states have call predecessors, (207), 145 states have call successors, (207) [2022-07-11 23:49:49,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1045 states to 1045 states and 1528 transitions. [2022-07-11 23:49:49,817 INFO L78 Accepts]: Start accepts. Automaton has 1045 states and 1528 transitions. Word has length 46 [2022-07-11 23:49:49,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:49:49,817 INFO L495 AbstractCegarLoop]: Abstraction has 1045 states and 1528 transitions. [2022-07-11 23:49:49,817 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 7 states have internal predecessors, (41), 3 states have call successors, (3), 3 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-11 23:49:49,817 INFO L276 IsEmpty]: Start isEmpty. Operand 1045 states and 1528 transitions. [2022-07-11 23:49:49,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-11 23:49:49,819 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:49:49,819 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] [2022-07-11 23:49:49,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-11 23:49:49,819 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:49:49,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:49:49,820 INFO L85 PathProgramCache]: Analyzing trace with hash 1831784630, now seen corresponding path program 1 times [2022-07-11 23:49:49,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:49:49,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912017194] [2022-07-11 23:49:49,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:49:49,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:49:49,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:49:49,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-11 23:49:49,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:49:49,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-11 23:49:49,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:49:49,891 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-11 23:49:49,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:49:49,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912017194] [2022-07-11 23:49:49,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912017194] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:49:49,891 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:49:49,891 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-11 23:49:49,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413353455] [2022-07-11 23:49:49,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:49:49,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-11 23:49:49,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:49:49,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-11 23:49:49,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:49:49,893 INFO L87 Difference]: Start difference. First operand 1045 states and 1528 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (3), 3 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-11 23:49:54,257 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:49:55,653 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:49:57,058 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:49:59,494 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:50:00,617 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:50:02,634 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:50:02,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:50:02,764 INFO L93 Difference]: Finished difference Result 1158 states and 1700 transitions. [2022-07-11 23:50:02,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-11 23:50:02,764 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (3), 3 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 46 [2022-07-11 23:50:02,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:50:02,767 INFO L225 Difference]: With dead ends: 1158 [2022-07-11 23:50:02,767 INFO L226 Difference]: Without dead ends: 1134 [2022-07-11 23:50:02,768 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-11 23:50:02,768 INFO L413 NwaCegarLoop]: 817 mSDtfsCounter, 286 mSDsluCounter, 1506 mSDsCounter, 0 mSdLazyCounter, 650 mSolverCounterSat, 247 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 2323 SdHoareTripleChecker+Invalid, 900 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 247 IncrementalHoareTripleChecker+Valid, 650 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.8s IncrementalHoareTripleChecker+Time [2022-07-11 23:50:02,768 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 2323 Invalid, 900 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [247 Valid, 650 Invalid, 3 Unknown, 0 Unchecked, 12.8s Time] [2022-07-11 23:50:02,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1134 states. [2022-07-11 23:50:02,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1134 to 1050. [2022-07-11 23:50:02,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1050 states, 844 states have (on average 1.3945497630331753) internal successors, (1177), 851 states have internal predecessors, (1177), 151 states have call successors, (151), 49 states have call predecessors, (151), 54 states have return successors, (207), 149 states have call predecessors, (207), 145 states have call successors, (207) [2022-07-11 23:50:02,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1050 states to 1050 states and 1535 transitions. [2022-07-11 23:50:02,811 INFO L78 Accepts]: Start accepts. Automaton has 1050 states and 1535 transitions. Word has length 46 [2022-07-11 23:50:02,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:50:02,811 INFO L495 AbstractCegarLoop]: Abstraction has 1050 states and 1535 transitions. [2022-07-11 23:50:02,811 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (3), 3 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-11 23:50:02,811 INFO L276 IsEmpty]: Start isEmpty. Operand 1050 states and 1535 transitions. [2022-07-11 23:50:02,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-11 23:50:02,813 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:50:02,813 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] [2022-07-11 23:50:02,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-11 23:50:02,813 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:50:02,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:50:02,814 INFO L85 PathProgramCache]: Analyzing trace with hash 1697771124, now seen corresponding path program 1 times [2022-07-11 23:50:02,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:50:02,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734954912] [2022-07-11 23:50:02,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:50:02,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:50:02,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:50:02,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-11 23:50:02,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:50:02,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-11 23:50:02,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:50:02,925 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-11 23:50:02,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:50:02,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734954912] [2022-07-11 23:50:02,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734954912] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:50:02,925 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:50:02,925 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-11 23:50:02,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432315854] [2022-07-11 23:50:02,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:50:02,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-11 23:50:02,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:50:02,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-11 23:50:02,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-11 23:50:02,927 INFO L87 Difference]: Start difference. First operand 1050 states and 1535 transitions. Second operand has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 7 states have internal predecessors, (41), 3 states have call successors, (3), 3 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-11 23:50:09,668 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:50:12,932 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:50:14,149 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:50:14,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:50:14,483 INFO L93 Difference]: Finished difference Result 1133 states and 1667 transitions. [2022-07-11 23:50:14,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-11 23:50:14,485 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 7 states have internal predecessors, (41), 3 states have call successors, (3), 3 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 46 [2022-07-11 23:50:14,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:50:14,488 INFO L225 Difference]: With dead ends: 1133 [2022-07-11 23:50:14,488 INFO L226 Difference]: Without dead ends: 1107 [2022-07-11 23:50:14,488 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2022-07-11 23:50:14,489 INFO L413 NwaCegarLoop]: 808 mSDtfsCounter, 300 mSDsluCounter, 4216 mSDsCounter, 0 mSdLazyCounter, 1321 mSolverCounterSat, 237 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 5024 SdHoareTripleChecker+Invalid, 1559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 237 IncrementalHoareTripleChecker+Valid, 1321 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.4s IncrementalHoareTripleChecker+Time [2022-07-11 23:50:14,489 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 5024 Invalid, 1559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [237 Valid, 1321 Invalid, 1 Unknown, 0 Unchecked, 11.4s Time] [2022-07-11 23:50:14,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1107 states. [2022-07-11 23:50:14,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1107 to 1041. [2022-07-11 23:50:14,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1041 states, 836 states have (on average 1.3779904306220097) internal successors, (1152), 843 states have internal predecessors, (1152), 150 states have call successors, (150), 49 states have call predecessors, (150), 54 states have return successors, (206), 148 states have call predecessors, (206), 144 states have call successors, (206) [2022-07-11 23:50:14,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1041 states to 1041 states and 1508 transitions. [2022-07-11 23:50:14,526 INFO L78 Accepts]: Start accepts. Automaton has 1041 states and 1508 transitions. Word has length 46 [2022-07-11 23:50:14,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:50:14,526 INFO L495 AbstractCegarLoop]: Abstraction has 1041 states and 1508 transitions. [2022-07-11 23:50:14,526 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 7 states have internal predecessors, (41), 3 states have call successors, (3), 3 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-11 23:50:14,527 INFO L276 IsEmpty]: Start isEmpty. Operand 1041 states and 1508 transitions. [2022-07-11 23:50:14,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-11 23:50:14,533 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:50:14,533 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-11 23:50:14,533 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-07-11 23:50:14,533 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:50:14,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:50:14,533 INFO L85 PathProgramCache]: Analyzing trace with hash 2006892282, now seen corresponding path program 1 times [2022-07-11 23:50:14,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:50:14,534 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52958312] [2022-07-11 23:50:14,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:50:14,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:50:14,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:50:14,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-11 23:50:14,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:50:14,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-11 23:50:14,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:50:14,654 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-11 23:50:14,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:50:14,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52958312] [2022-07-11 23:50:14,655 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52958312] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:50:14,655 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:50:14,655 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-11 23:50:14,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967783623] [2022-07-11 23:50:14,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:50:14,656 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-11 23:50:14,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:50:14,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-11 23:50:14,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-07-11 23:50:14,657 INFO L87 Difference]: Start difference. First operand 1041 states and 1508 transitions. Second operand has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 8 states have internal predecessors, (43), 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-11 23:50:21,619 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:50:23,783 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:50:25,257 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:50:26,870 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:50:28,956 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:50:31,037 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:50:32,083 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:50:32,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:50:32,161 INFO L93 Difference]: Finished difference Result 1094 states and 1595 transitions. [2022-07-11 23:50:32,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-11 23:50:32,163 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 8 states have internal predecessors, (43), 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 48 [2022-07-11 23:50:32,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:50:32,166 INFO L225 Difference]: With dead ends: 1094 [2022-07-11 23:50:32,166 INFO L226 Difference]: Without dead ends: 1077 [2022-07-11 23:50:32,166 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2022-07-11 23:50:32,167 INFO L413 NwaCegarLoop]: 785 mSDtfsCounter, 101 mSDsluCounter, 5549 mSDsCounter, 0 mSdLazyCounter, 1701 mSolverCounterSat, 99 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 6334 SdHoareTripleChecker+Invalid, 1804 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 1701 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.4s IncrementalHoareTripleChecker+Time [2022-07-11 23:50:32,167 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 6334 Invalid, 1804 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 1701 Invalid, 4 Unknown, 0 Unchecked, 17.4s Time] [2022-07-11 23:50:32,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1077 states. [2022-07-11 23:50:32,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1077 to 1038. [2022-07-11 23:50:32,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1038 states, 834 states have (on average 1.3776978417266188) internal successors, (1149), 841 states have internal predecessors, (1149), 149 states have call successors, (149), 49 states have call predecessors, (149), 54 states have return successors, (205), 147 states have call predecessors, (205), 143 states have call successors, (205) [2022-07-11 23:50:32,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1038 states to 1038 states and 1503 transitions. [2022-07-11 23:50:32,210 INFO L78 Accepts]: Start accepts. Automaton has 1038 states and 1503 transitions. Word has length 48 [2022-07-11 23:50:32,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:50:32,210 INFO L495 AbstractCegarLoop]: Abstraction has 1038 states and 1503 transitions. [2022-07-11 23:50:32,211 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 8 states have internal predecessors, (43), 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-11 23:50:32,211 INFO L276 IsEmpty]: Start isEmpty. Operand 1038 states and 1503 transitions. [2022-07-11 23:50:32,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-07-11 23:50:32,215 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:50:32,215 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, 1, 1, 1, 1] [2022-07-11 23:50:32,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-07-11 23:50:32,215 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:50:32,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:50:32,216 INFO L85 PathProgramCache]: Analyzing trace with hash -337810077, now seen corresponding path program 1 times [2022-07-11 23:50:32,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:50:32,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165350892] [2022-07-11 23:50:32,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:50:32,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:50:32,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:50:32,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-11 23:50:32,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:50:32,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-11 23:50:32,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:50:32,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-11 23:50:32,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:50:32,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-11 23:50:32,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:50:32,311 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-11 23:50:32,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:50:32,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165350892] [2022-07-11 23:50:32,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165350892] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:50:32,312 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:50:32,312 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-11 23:50:32,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542356293] [2022-07-11 23:50:32,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:50:32,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-11 23:50:32,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:50:32,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-11 23:50:32,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-11 23:50:32,313 INFO L87 Difference]: Start difference. First operand 1038 states and 1503 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (7), 5 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-11 23:50:37,146 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:50:39,045 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:50:40,795 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:50:43,463 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:50:44,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:50:44,488 INFO L93 Difference]: Finished difference Result 1606 states and 2346 transitions. [2022-07-11 23:50:44,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-11 23:50:44,490 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (7), 5 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 53 [2022-07-11 23:50:44,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:50:44,494 INFO L225 Difference]: With dead ends: 1606 [2022-07-11 23:50:44,494 INFO L226 Difference]: Without dead ends: 1096 [2022-07-11 23:50:44,496 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2022-07-11 23:50:44,496 INFO L413 NwaCegarLoop]: 792 mSDtfsCounter, 446 mSDsluCounter, 1964 mSDsCounter, 0 mSdLazyCounter, 771 mSolverCounterSat, 342 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 446 SdHoareTripleChecker+Valid, 2756 SdHoareTripleChecker+Invalid, 1114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 342 IncrementalHoareTripleChecker+Valid, 771 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:50:44,496 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [446 Valid, 2756 Invalid, 1114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [342 Valid, 771 Invalid, 1 Unknown, 0 Unchecked, 12.1s Time] [2022-07-11 23:50:44,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1096 states. [2022-07-11 23:50:44,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1096 to 1040. [2022-07-11 23:50:44,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1040 states, 836 states have (on average 1.3732057416267942) internal successors, (1148), 843 states have internal predecessors, (1148), 148 states have call successors, (148), 49 states have call predecessors, (148), 55 states have return successors, (207), 147 states have call predecessors, (207), 143 states have call successors, (207) [2022-07-11 23:50:44,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1040 states to 1040 states and 1503 transitions. [2022-07-11 23:50:44,549 INFO L78 Accepts]: Start accepts. Automaton has 1040 states and 1503 transitions. Word has length 53 [2022-07-11 23:50:44,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:50:44,549 INFO L495 AbstractCegarLoop]: Abstraction has 1040 states and 1503 transitions. [2022-07-11 23:50:44,549 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (7), 5 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-11 23:50:44,549 INFO L276 IsEmpty]: Start isEmpty. Operand 1040 states and 1503 transitions. [2022-07-11 23:50:44,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-07-11 23:50:44,552 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:50:44,552 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, 1] [2022-07-11 23:50:44,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-07-11 23:50:44,553 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:50:44,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:50:44,553 INFO L85 PathProgramCache]: Analyzing trace with hash -1963103447, now seen corresponding path program 1 times [2022-07-11 23:50:44,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:50:44,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104825306] [2022-07-11 23:50:44,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:50:44,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:50:44,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:50:44,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-11 23:50:44,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:50:44,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-11 23:50:44,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:50:44,682 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-11 23:50:44,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:50:44,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104825306] [2022-07-11 23:50:44,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104825306] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:50:44,683 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:50:44,683 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-11 23:50:44,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370520200] [2022-07-11 23:50:44,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:50:44,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-11 23:50:44,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:50:44,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-11 23:50:44,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2022-07-11 23:50:44,685 INFO L87 Difference]: Start difference. First operand 1040 states and 1503 transitions. Second operand has 12 states, 12 states have (on average 3.75) internal successors, (45), 9 states have internal predecessors, (45), 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-11 23:50:52,686 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:50:55,269 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:50:56,834 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:50:58,942 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:51:00,467 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:51:02,487 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:51:02,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:51:02,585 INFO L93 Difference]: Finished difference Result 1093 states and 1590 transitions. [2022-07-11 23:51:02,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-11 23:51:02,587 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.75) internal successors, (45), 9 states have internal predecessors, (45), 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 50 [2022-07-11 23:51:02,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:51:02,590 INFO L225 Difference]: With dead ends: 1093 [2022-07-11 23:51:02,590 INFO L226 Difference]: Without dead ends: 1076 [2022-07-11 23:51:02,590 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2022-07-11 23:51:02,591 INFO L413 NwaCegarLoop]: 789 mSDtfsCounter, 113 mSDsluCounter, 6212 mSDsCounter, 0 mSdLazyCounter, 1866 mSolverCounterSat, 97 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 7001 SdHoareTripleChecker+Invalid, 1967 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 1866 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.8s IncrementalHoareTripleChecker+Time [2022-07-11 23:51:02,591 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 7001 Invalid, 1967 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 1866 Invalid, 4 Unknown, 0 Unchecked, 17.8s Time] [2022-07-11 23:51:02,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1076 states. [2022-07-11 23:51:02,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1076 to 1037. [2022-07-11 23:51:02,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1037 states, 834 states have (on average 1.3729016786570742) internal successors, (1145), 841 states have internal predecessors, (1145), 147 states have call successors, (147), 49 states have call predecessors, (147), 55 states have return successors, (206), 146 states have call predecessors, (206), 142 states have call successors, (206) [2022-07-11 23:51:02,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1037 states to 1037 states and 1498 transitions. [2022-07-11 23:51:02,628 INFO L78 Accepts]: Start accepts. Automaton has 1037 states and 1498 transitions. Word has length 50 [2022-07-11 23:51:02,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:51:02,628 INFO L495 AbstractCegarLoop]: Abstraction has 1037 states and 1498 transitions. [2022-07-11 23:51:02,628 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.75) internal successors, (45), 9 states have internal predecessors, (45), 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-11 23:51:02,628 INFO L276 IsEmpty]: Start isEmpty. Operand 1037 states and 1498 transitions. [2022-07-11 23:51:02,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-07-11 23:51:02,631 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:51:02,631 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-11 23:51:02,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-07-11 23:51:02,632 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:51:02,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:51:02,632 INFO L85 PathProgramCache]: Analyzing trace with hash 667442599, now seen corresponding path program 1 times [2022-07-11 23:51:02,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:51:02,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436306004] [2022-07-11 23:51:02,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:51:02,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:51:02,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:51:02,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-11 23:51:02,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:51:02,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-11 23:51:02,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:51:02,786 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-11 23:51:02,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:51:02,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436306004] [2022-07-11 23:51:02,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436306004] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:51:02,787 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:51:02,787 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-11 23:51:02,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556861261] [2022-07-11 23:51:02,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:51:02,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-11 23:51:02,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:51:02,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-11 23:51:02,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2022-07-11 23:51:02,788 INFO L87 Difference]: Start difference. First operand 1037 states and 1498 transitions. Second operand has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 9 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-11 23:51:09,743 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:51:11,915 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:51:13,939 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:51:17,281 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:51:18,687 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:51:18,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:51:18,768 INFO L93 Difference]: Finished difference Result 1090 states and 1585 transitions. [2022-07-11 23:51:18,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-11 23:51:18,770 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 9 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-11 23:51:18,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:51:18,783 INFO L225 Difference]: With dead ends: 1090 [2022-07-11 23:51:18,783 INFO L226 Difference]: Without dead ends: 1073 [2022-07-11 23:51:18,784 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2022-07-11 23:51:18,784 INFO L413 NwaCegarLoop]: 773 mSDtfsCounter, 113 mSDsluCounter, 6113 mSDsCounter, 0 mSdLazyCounter, 1852 mSolverCounterSat, 96 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 6886 SdHoareTripleChecker+Invalid, 1951 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 1852 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.9s IncrementalHoareTripleChecker+Time [2022-07-11 23:51:18,785 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 6886 Invalid, 1951 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 1852 Invalid, 3 Unknown, 0 Unchecked, 15.9s Time] [2022-07-11 23:51:18,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1073 states. [2022-07-11 23:51:18,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1073 to 1034. [2022-07-11 23:51:18,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1034 states, 832 states have (on average 1.3725961538461537) internal successors, (1142), 839 states have internal predecessors, (1142), 146 states have call successors, (146), 49 states have call predecessors, (146), 55 states have return successors, (205), 145 states have call predecessors, (205), 141 states have call successors, (205) [2022-07-11 23:51:18,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1034 states to 1034 states and 1493 transitions. [2022-07-11 23:51:18,820 INFO L78 Accepts]: Start accepts. Automaton has 1034 states and 1493 transitions. Word has length 49 [2022-07-11 23:51:18,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:51:18,821 INFO L495 AbstractCegarLoop]: Abstraction has 1034 states and 1493 transitions. [2022-07-11 23:51:18,821 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 9 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-11 23:51:18,821 INFO L276 IsEmpty]: Start isEmpty. Operand 1034 states and 1493 transitions. [2022-07-11 23:51:18,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-07-11 23:51:18,822 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:51:18,823 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, 1] [2022-07-11 23:51:18,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-07-11 23:51:18,823 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:51:18,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:51:18,823 INFO L85 PathProgramCache]: Analyzing trace with hash 1895273355, now seen corresponding path program 1 times [2022-07-11 23:51:18,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:51:18,823 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695164333] [2022-07-11 23:51:18,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:51:18,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:51:18,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:51:18,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-11 23:51:18,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:51:18,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-11 23:51:18,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:51:18,905 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-11 23:51:18,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:51:18,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695164333] [2022-07-11 23:51:18,906 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695164333] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:51:18,906 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:51:18,906 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-11 23:51:18,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696889888] [2022-07-11 23:51:18,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:51:18,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-11 23:51:18,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:51:18,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-11 23:51:18,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-11 23:51:18,907 INFO L87 Difference]: Start difference. First operand 1034 states and 1493 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-11 23:51:20,920 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:51:23,385 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:51:25,933 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:51:28,905 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:51:30,930 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:51:31,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:51:31,017 INFO L93 Difference]: Finished difference Result 1138 states and 1641 transitions. [2022-07-11 23:51:31,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-11 23:51:31,019 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 50 [2022-07-11 23:51:31,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:51:31,022 INFO L225 Difference]: With dead ends: 1138 [2022-07-11 23:51:31,022 INFO L226 Difference]: Without dead ends: 1103 [2022-07-11 23:51:31,022 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-07-11 23:51:31,023 INFO L413 NwaCegarLoop]: 856 mSDtfsCounter, 1053 mSDsluCounter, 974 mSDsCounter, 0 mSdLazyCounter, 692 mSolverCounterSat, 254 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1113 SdHoareTripleChecker+Valid, 1830 SdHoareTripleChecker+Invalid, 948 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 254 IncrementalHoareTripleChecker+Valid, 692 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.0s IncrementalHoareTripleChecker+Time [2022-07-11 23:51:31,023 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1113 Valid, 1830 Invalid, 948 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [254 Valid, 692 Invalid, 2 Unknown, 0 Unchecked, 12.0s Time] [2022-07-11 23:51:31,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1103 states. [2022-07-11 23:51:31,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1103 to 1034. [2022-07-11 23:51:31,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1034 states, 832 states have (on average 1.3713942307692308) internal successors, (1141), 839 states have internal predecessors, (1141), 146 states have call successors, (146), 49 states have call predecessors, (146), 55 states have return successors, (205), 145 states have call predecessors, (205), 141 states have call successors, (205) [2022-07-11 23:51:31,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1034 states to 1034 states and 1492 transitions. [2022-07-11 23:51:31,068 INFO L78 Accepts]: Start accepts. Automaton has 1034 states and 1492 transitions. Word has length 50 [2022-07-11 23:51:31,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:51:31,068 INFO L495 AbstractCegarLoop]: Abstraction has 1034 states and 1492 transitions. [2022-07-11 23:51:31,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-11 23:51:31,069 INFO L276 IsEmpty]: Start isEmpty. Operand 1034 states and 1492 transitions. [2022-07-11 23:51:31,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-11 23:51:31,070 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:51:31,070 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:51:31,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-07-11 23:51:31,071 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:51:31,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:51:31,071 INFO L85 PathProgramCache]: Analyzing trace with hash -1774924927, now seen corresponding path program 1 times [2022-07-11 23:51:31,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:51:31,071 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052241693] [2022-07-11 23:51:31,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:51:31,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:51:31,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:51:31,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-11 23:51:31,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:51:31,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-11 23:51:31,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:51:31,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-11 23:51:31,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:51:31,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-11 23:51:31,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:51:31,179 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-11 23:51:31,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:51:31,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052241693] [2022-07-11 23:51:31,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052241693] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:51:31,180 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:51:31,180 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-11 23:51:31,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599951181] [2022-07-11 23:51:31,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:51:31,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-11 23:51:31,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:51:31,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-11 23:51:31,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-11 23:51:31,181 INFO L87 Difference]: Start difference. First operand 1034 states and 1492 transitions. Second operand has 8 states, 8 states have (on average 5.875) internal successors, (47), 5 states have internal predecessors, (47), 4 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4)