./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--message--fusion--mptctl.ko-entry_point.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/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.6.800.v20240513-1750.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/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--message--fusion--mptctl.ko-entry_point.cil.out.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --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 64bit --witnessprinter.graph.data.programhash 1cfba800a850f13ff72fddf9946e31aec208a19aa4b82d402046e12670b66199 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 19:36:51,234 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 19:36:51,301 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-08 19:36:51,307 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 19:36:51,307 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 19:36:51,330 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 19:36:51,331 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 19:36:51,331 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 19:36:51,331 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 19:36:51,331 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 19:36:51,332 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 19:36:51,332 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 19:36:51,332 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 19:36:51,332 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 19:36:51,333 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 19:36:51,333 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 19:36:51,333 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 19:36:51,333 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 19:36:51,333 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 19:36:51,333 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 19:36:51,333 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 19:36:51,333 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 19:36:51,334 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 19:36:51,334 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 19:36:51,334 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 19:36:51,334 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 19:36:51,334 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 19:36:51,334 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 19:36:51,334 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 19:36:51,334 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 19:36:51,334 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 19:36:51,335 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 19:36:51,335 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 19:36:51,335 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 19:36:51,335 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 19:36:51,335 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 19:36:51,335 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 19:36:51,335 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 19:36:51,335 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 19:36:51,336 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 19:36:51,336 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1cfba800a850f13ff72fddf9946e31aec208a19aa4b82d402046e12670b66199 [2025-03-08 19:36:51,574 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 19:36:51,584 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 19:36:51,586 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 19:36:51,587 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 19:36:51,587 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 19:36:51,588 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--message--fusion--mptctl.ko-entry_point.cil.out.i [2025-03-08 19:36:52,732 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ed88f083/594577c6c5774a4fb2ca1d91aaa43a0e/FLAG9229539a8 [2025-03-08 19:36:53,323 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 19:36:53,323 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--message--fusion--mptctl.ko-entry_point.cil.out.i [2025-03-08 19:36:53,364 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ed88f083/594577c6c5774a4fb2ca1d91aaa43a0e/FLAG9229539a8 [2025-03-08 19:36:53,383 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ed88f083/594577c6c5774a4fb2ca1d91aaa43a0e [2025-03-08 19:36:53,385 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 19:36:53,387 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 19:36:53,388 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 19:36:53,388 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 19:36:53,392 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 19:36:53,394 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 07:36:53" (1/1) ... [2025-03-08 19:36:53,395 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@193a91f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:36:53, skipping insertion in model container [2025-03-08 19:36:53,395 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 07:36:53" (1/1) ... [2025-03-08 19:36:53,481 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 19:36:54,930 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--message--fusion--mptctl.ko-entry_point.cil.out.i[277952,277965] [2025-03-08 19:36:55,133 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 19:36:55,159 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 19:36:55,256 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("1:\tud2\n.pushsection __bug_table,\"a\"\n2:\t.long 1b - 2b, %c0 - 2b\n\t.word %c1, 0\n\t.org 2b+%c2\n.popsection": : "i" ((char *)"include/asm-generic/dma-mapping-common.h"), "i" (19), "i" (12UL)); [5693-5694] [2025-03-08 19:36:55,260 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("1:\tud2\n.pushsection __bug_table,\"a\"\n2:\t.long 1b - 2b, %c0 - 2b\n\t.word %c1, 0\n\t.org 2b+%c2\n.popsection": : "i" ((char *)"include/asm-generic/dma-mapping-common.h"), "i" (36), "i" (12UL)); [5722-5723] [2025-03-08 19:36:55,445 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--message--fusion--mptctl.ko-entry_point.cil.out.i[277952,277965] [2025-03-08 19:36:55,463 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 19:36:55,515 INFO L204 MainTranslator]: Completed translation [2025-03-08 19:36:55,516 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:36:55 WrapperNode [2025-03-08 19:36:55,517 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 19:36:55,518 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 19:36:55,518 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 19:36:55,518 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 19:36:55,523 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:36:55" (1/1) ... [2025-03-08 19:36:55,606 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:36:55" (1/1) ... [2025-03-08 19:36:55,800 INFO L138 Inliner]: procedures = 258, calls = 2402, calls flagged for inlining = 96, calls inlined = 93, statements flattened = 6774 [2025-03-08 19:36:55,801 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 19:36:55,801 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 19:36:55,802 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 19:36:55,802 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 19:36:55,809 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:36:55" (1/1) ... [2025-03-08 19:36:55,809 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:36:55" (1/1) ... [2025-03-08 19:36:55,841 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:36:55" (1/1) ... [2025-03-08 19:36:56,233 INFO L175 MemorySlicer]: Split 1117 memory accesses to 24 slices as follows [549, 2, 1, 5, 17, 57, 6, 8, 4, 25, 8, 26, 11, 2, 2, 11, 13, 1, 36, 15, 16, 2, 294, 6]. 49 percent of accesses are in the largest equivalence class. The 30 initializations are split as follows [0, 2, 1, 0, 0, 0, 0, 8, 0, 0, 8, 0, 0, 0, 2, 0, 0, 0, 7, 0, 0, 2, 0, 0]. The 309 writes are split as follows [184, 0, 0, 2, 12, 16, 3, 0, 1, 22, 0, 12, 4, 1, 0, 1, 4, 0, 29, 0, 12, 0, 3, 3]. [2025-03-08 19:36:56,233 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:36:55" (1/1) ... [2025-03-08 19:36:56,233 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:36:55" (1/1) ... [2025-03-08 19:36:56,327 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:36:55" (1/1) ... [2025-03-08 19:36:56,339 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:36:55" (1/1) ... [2025-03-08 19:36:56,360 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:36:55" (1/1) ... [2025-03-08 19:36:56,379 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:36:55" (1/1) ... [2025-03-08 19:36:56,431 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 19:36:56,433 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 19:36:56,433 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 19:36:56,433 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 19:36:56,435 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:36:55" (1/1) ... [2025-03-08 19:36:56,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 19:36:56,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 19:36:56,460 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 19:36:56,462 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 19:36:56,478 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-03-08 19:36:56,478 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-03-08 19:36:56,478 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-03-08 19:36:56,478 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-03-08 19:36:56,479 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-03-08 19:36:56,479 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2025-03-08 19:36:56,479 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2025-03-08 19:36:56,479 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#7 [2025-03-08 19:36:56,479 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#8 [2025-03-08 19:36:56,479 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#9 [2025-03-08 19:36:56,479 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#10 [2025-03-08 19:36:56,479 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#11 [2025-03-08 19:36:56,479 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#12 [2025-03-08 19:36:56,479 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#13 [2025-03-08 19:36:56,479 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#14 [2025-03-08 19:36:56,479 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#15 [2025-03-08 19:36:56,479 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#16 [2025-03-08 19:36:56,479 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#17 [2025-03-08 19:36:56,479 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#18 [2025-03-08 19:36:56,479 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#19 [2025-03-08 19:36:56,479 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#20 [2025-03-08 19:36:56,479 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#21 [2025-03-08 19:36:56,479 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#22 [2025-03-08 19:36:56,479 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#23 [2025-03-08 19:36:56,479 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2025-03-08 19:36:56,479 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2025-03-08 19:36:56,479 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2025-03-08 19:36:56,479 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2025-03-08 19:36:56,479 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~~u32~0~X~~dma_addr_t~0~TO~VOID [2025-03-08 19:36:56,479 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~~u32~0~X~~dma_addr_t~0~TO~VOID [2025-03-08 19:36:56,479 INFO L130 BoogieDeclarations]: Found specification of procedure wait_for_completion_timeout [2025-03-08 19:36:56,479 INFO L138 BoogieDeclarations]: Found implementation of procedure wait_for_completion_timeout [2025-03-08 19:36:56,479 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_mpctl_mutex [2025-03-08 19:36:56,479 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_mpctl_mutex [2025-03-08 19:36:56,479 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2025-03-08 19:36:56,480 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2025-03-08 19:36:56,480 INFO L130 BoogieDeclarations]: Found specification of procedure mpt_GetIocState [2025-03-08 19:36:56,480 INFO L138 BoogieDeclarations]: Found implementation of procedure mpt_GetIocState [2025-03-08 19:36:56,480 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_trylock [2025-03-08 19:36:56,480 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_trylock [2025-03-08 19:36:56,480 INFO L130 BoogieDeclarations]: Found specification of procedure __scsi_iterate_devices [2025-03-08 19:36:56,480 INFO L138 BoogieDeclarations]: Found implementation of procedure __scsi_iterate_devices [2025-03-08 19:36:56,480 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2025-03-08 19:36:56,480 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2025-03-08 19:36:56,480 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2025-03-08 19:36:56,480 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2025-03-08 19:36:56,480 INFO L130 BoogieDeclarations]: Found specification of procedure mptctl_syscall_down [2025-03-08 19:36:56,480 INFO L138 BoogieDeclarations]: Found implementation of procedure mptctl_syscall_down [2025-03-08 19:36:56,480 INFO L130 BoogieDeclarations]: Found specification of procedure mpt_device_driver_deregister [2025-03-08 19:36:56,480 INFO L138 BoogieDeclarations]: Found implementation of procedure mpt_device_driver_deregister [2025-03-08 19:36:56,480 INFO L130 BoogieDeclarations]: Found specification of procedure valid_dma_direction [2025-03-08 19:36:56,480 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_dma_direction [2025-03-08 19:36:56,480 INFO L130 BoogieDeclarations]: Found specification of procedure mptctl_remove [2025-03-08 19:36:56,480 INFO L138 BoogieDeclarations]: Found implementation of procedure mptctl_remove [2025-03-08 19:36:56,480 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-03-08 19:36:56,480 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-03-08 19:36:56,480 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-03-08 19:36:56,480 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#3 [2025-03-08 19:36:56,480 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#4 [2025-03-08 19:36:56,480 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#5 [2025-03-08 19:36:56,480 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#6 [2025-03-08 19:36:56,480 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#7 [2025-03-08 19:36:56,480 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#8 [2025-03-08 19:36:56,482 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#9 [2025-03-08 19:36:56,482 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#10 [2025-03-08 19:36:56,483 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#11 [2025-03-08 19:36:56,483 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#12 [2025-03-08 19:36:56,483 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#13 [2025-03-08 19:36:56,483 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#14 [2025-03-08 19:36:56,483 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#15 [2025-03-08 19:36:56,483 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#16 [2025-03-08 19:36:56,483 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#17 [2025-03-08 19:36:56,483 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#18 [2025-03-08 19:36:56,483 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#19 [2025-03-08 19:36:56,484 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#20 [2025-03-08 19:36:56,484 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#21 [2025-03-08 19:36:56,484 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#22 [2025-03-08 19:36:56,484 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#23 [2025-03-08 19:36:56,484 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-03-08 19:36:56,484 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-03-08 19:36:56,484 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-03-08 19:36:56,484 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#3 [2025-03-08 19:36:56,484 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#4 [2025-03-08 19:36:56,484 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#5 [2025-03-08 19:36:56,484 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#6 [2025-03-08 19:36:56,484 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#7 [2025-03-08 19:36:56,484 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#8 [2025-03-08 19:36:56,484 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#9 [2025-03-08 19:36:56,484 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#10 [2025-03-08 19:36:56,484 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#11 [2025-03-08 19:36:56,484 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#12 [2025-03-08 19:36:56,484 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#13 [2025-03-08 19:36:56,484 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#14 [2025-03-08 19:36:56,484 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#15 [2025-03-08 19:36:56,484 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#16 [2025-03-08 19:36:56,484 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#17 [2025-03-08 19:36:56,484 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#18 [2025-03-08 19:36:56,484 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#19 [2025-03-08 19:36:56,484 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#20 [2025-03-08 19:36:56,484 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#21 [2025-03-08 19:36:56,484 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#22 [2025-03-08 19:36:56,484 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#23 [2025-03-08 19:36:56,484 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 19:36:56,484 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 19:36:56,484 INFO L130 BoogieDeclarations]: Found specification of procedure mpt_put_msg_frame [2025-03-08 19:36:56,484 INFO L138 BoogieDeclarations]: Found implementation of procedure mpt_put_msg_frame [2025-03-08 19:36:56,484 INFO L130 BoogieDeclarations]: Found specification of procedure pci_alloc_consistent [2025-03-08 19:36:56,484 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_alloc_consistent [2025-03-08 19:36:56,485 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock [2025-03-08 19:36:56,485 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock [2025-03-08 19:36:56,485 INFO L130 BoogieDeclarations]: Found specification of procedure spinlock_check [2025-03-08 19:36:56,485 INFO L138 BoogieDeclarations]: Found implementation of procedure spinlock_check [2025-03-08 19:36:56,485 INFO L130 BoogieDeclarations]: Found specification of procedure __mptctl_ioctl [2025-03-08 19:36:56,485 INFO L138 BoogieDeclarations]: Found implementation of procedure __mptctl_ioctl [2025-03-08 19:36:56,485 INFO L130 BoogieDeclarations]: Found specification of procedure mptctl_do_mpt_command [2025-03-08 19:36:56,485 INFO L138 BoogieDeclarations]: Found implementation of procedure mptctl_do_mpt_command [2025-03-08 19:36:56,485 INFO L130 BoogieDeclarations]: Found specification of procedure mptctl_do_fw_download [2025-03-08 19:36:56,485 INFO L138 BoogieDeclarations]: Found implementation of procedure mptctl_do_fw_download [2025-03-08 19:36:56,485 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-08 19:36:56,485 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-08 19:36:56,485 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-08 19:36:56,485 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-08 19:36:56,485 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-08 19:36:56,485 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-03-08 19:36:56,485 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-03-08 19:36:56,485 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-03-08 19:36:56,485 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-03-08 19:36:56,485 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-03-08 19:36:56,485 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-03-08 19:36:56,485 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-03-08 19:36:56,485 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-03-08 19:36:56,485 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-03-08 19:36:56,485 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-03-08 19:36:56,485 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2025-03-08 19:36:56,485 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#15 [2025-03-08 19:36:56,485 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#16 [2025-03-08 19:36:56,485 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#17 [2025-03-08 19:36:56,485 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#18 [2025-03-08 19:36:56,485 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#19 [2025-03-08 19:36:56,485 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#20 [2025-03-08 19:36:56,485 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#21 [2025-03-08 19:36:56,485 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#22 [2025-03-08 19:36:56,485 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#23 [2025-03-08 19:36:56,486 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_mutex_of__MPT_MGMT [2025-03-08 19:36:56,487 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_mutex_of__MPT_MGMT [2025-03-08 19:36:56,487 INFO L130 BoogieDeclarations]: Found specification of procedure mpt_put_msg_frame_hi_pri [2025-03-08 19:36:56,487 INFO L138 BoogieDeclarations]: Found implementation of procedure mpt_put_msg_frame_hi_pri [2025-03-08 19:36:56,487 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2025-03-08 19:36:56,487 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2025-03-08 19:36:56,487 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_irqrestore [2025-03-08 19:36:56,487 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_irqrestore [2025-03-08 19:36:56,487 INFO L130 BoogieDeclarations]: Found specification of procedure mpt_free_fw_memory [2025-03-08 19:36:56,487 INFO L138 BoogieDeclarations]: Found implementation of procedure mpt_free_fw_memory [2025-03-08 19:36:56,487 INFO L130 BoogieDeclarations]: Found specification of procedure mptctl_do_taskmgmt [2025-03-08 19:36:56,487 INFO L138 BoogieDeclarations]: Found implementation of procedure mptctl_do_taskmgmt [2025-03-08 19:36:56,487 INFO L130 BoogieDeclarations]: Found specification of procedure pci_unmap_single [2025-03-08 19:36:56,487 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_unmap_single [2025-03-08 19:36:56,487 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 19:36:56,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-08 19:36:56,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-08 19:36:56,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-08 19:36:56,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-03-08 19:36:56,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-03-08 19:36:56,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-03-08 19:36:56,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-03-08 19:36:56,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2025-03-08 19:36:56,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2025-03-08 19:36:56,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2025-03-08 19:36:56,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2025-03-08 19:36:56,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2025-03-08 19:36:56,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2025-03-08 19:36:56,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2025-03-08 19:36:56,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#14 [2025-03-08 19:36:56,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#15 [2025-03-08 19:36:56,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#16 [2025-03-08 19:36:56,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#17 [2025-03-08 19:36:56,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#18 [2025-03-08 19:36:56,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#19 [2025-03-08 19:36:56,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#20 [2025-03-08 19:36:56,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#21 [2025-03-08 19:36:56,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#22 [2025-03-08 19:36:56,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#23 [2025-03-08 19:36:56,488 INFO L130 BoogieDeclarations]: Found specification of procedure mpt_clear_taskmgmt_in_progress_flag [2025-03-08 19:36:56,488 INFO L138 BoogieDeclarations]: Found implementation of procedure mpt_clear_taskmgmt_in_progress_flag [2025-03-08 19:36:56,488 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2025-03-08 19:36:56,488 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2025-03-08 19:36:56,488 INFO L130 BoogieDeclarations]: Found specification of procedure mptctl_timeout_expired [2025-03-08 19:36:56,488 INFO L138 BoogieDeclarations]: Found implementation of procedure mptctl_timeout_expired [2025-03-08 19:36:56,488 INFO L130 BoogieDeclarations]: Found specification of procedure __might_fault [2025-03-08 19:36:56,488 INFO L138 BoogieDeclarations]: Found implementation of procedure __might_fault [2025-03-08 19:36:56,488 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2025-03-08 19:36:56,488 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2025-03-08 19:36:56,488 INFO L130 BoogieDeclarations]: Found specification of procedure _raw_spin_lock_irqsave [2025-03-08 19:36:56,488 INFO L138 BoogieDeclarations]: Found implementation of procedure _raw_spin_lock_irqsave [2025-03-08 19:36:56,488 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_mpctl_mutex [2025-03-08 19:36:56,488 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_mpctl_mutex [2025-03-08 19:36:56,488 INFO L130 BoogieDeclarations]: Found specification of procedure mptctl_fasync [2025-03-08 19:36:56,488 INFO L138 BoogieDeclarations]: Found implementation of procedure mptctl_fasync [2025-03-08 19:36:56,488 INFO L130 BoogieDeclarations]: Found specification of procedure get_dma_ops [2025-03-08 19:36:56,488 INFO L138 BoogieDeclarations]: Found implementation of procedure get_dma_ops [2025-03-08 19:36:56,488 INFO L130 BoogieDeclarations]: Found specification of procedure misc_deregister [2025-03-08 19:36:56,488 INFO L138 BoogieDeclarations]: Found implementation of procedure misc_deregister [2025-03-08 19:36:56,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-03-08 19:36:56,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-03-08 19:36:56,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-03-08 19:36:56,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-03-08 19:36:56,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-03-08 19:36:56,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-03-08 19:36:56,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2025-03-08 19:36:56,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2025-03-08 19:36:56,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#8 [2025-03-08 19:36:56,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#9 [2025-03-08 19:36:56,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#10 [2025-03-08 19:36:56,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#11 [2025-03-08 19:36:56,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#12 [2025-03-08 19:36:56,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#13 [2025-03-08 19:36:56,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#14 [2025-03-08 19:36:56,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#15 [2025-03-08 19:36:56,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#16 [2025-03-08 19:36:56,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#17 [2025-03-08 19:36:56,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#18 [2025-03-08 19:36:56,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#19 [2025-03-08 19:36:56,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#20 [2025-03-08 19:36:56,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#21 [2025-03-08 19:36:56,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#22 [2025-03-08 19:36:56,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#23 [2025-03-08 19:36:56,489 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 19:36:56,489 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 19:36:56,491 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-08 19:36:56,491 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-08 19:36:56,491 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-08 19:36:56,491 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-08 19:36:56,491 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-08 19:36:56,491 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-08 19:36:56,491 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-03-08 19:36:56,491 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-03-08 19:36:56,491 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-03-08 19:36:56,491 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-03-08 19:36:56,491 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-03-08 19:36:56,491 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-03-08 19:36:56,491 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-03-08 19:36:56,491 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2025-03-08 19:36:56,491 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2025-03-08 19:36:56,491 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#17 [2025-03-08 19:36:56,491 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#18 [2025-03-08 19:36:56,491 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#19 [2025-03-08 19:36:56,491 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#20 [2025-03-08 19:36:56,491 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#21 [2025-03-08 19:36:56,491 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#22 [2025-03-08 19:36:56,491 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#23 [2025-03-08 19:36:56,491 INFO L130 BoogieDeclarations]: Found specification of procedure mpt_set_taskmgmt_in_progress_flag [2025-03-08 19:36:56,491 INFO L138 BoogieDeclarations]: Found implementation of procedure mpt_set_taskmgmt_in_progress_flag [2025-03-08 19:36:56,491 INFO L130 BoogieDeclarations]: Found specification of procedure __phys_addr [2025-03-08 19:36:56,491 INFO L138 BoogieDeclarations]: Found implementation of procedure __phys_addr [2025-03-08 19:36:56,491 INFO L130 BoogieDeclarations]: Found specification of procedure mpt_verify_adapter [2025-03-08 19:36:56,491 INFO L138 BoogieDeclarations]: Found implementation of procedure mpt_verify_adapter [2025-03-08 19:36:56,491 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2025-03-08 19:36:56,491 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2025-03-08 19:36:56,491 INFO L130 BoogieDeclarations]: Found specification of procedure pci_free_consistent [2025-03-08 19:36:56,491 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_free_consistent [2025-03-08 19:36:56,491 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 19:36:56,491 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 19:36:56,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-08 19:36:56,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-08 19:36:56,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-08 19:36:56,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-08 19:36:56,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-08 19:36:56,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-08 19:36:56,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-03-08 19:36:56,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-03-08 19:36:56,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-03-08 19:36:56,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-03-08 19:36:56,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-03-08 19:36:56,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-03-08 19:36:56,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-03-08 19:36:56,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2025-03-08 19:36:56,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2025-03-08 19:36:56,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#17 [2025-03-08 19:36:56,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#18 [2025-03-08 19:36:56,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#19 [2025-03-08 19:36:56,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#20 [2025-03-08 19:36:56,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#21 [2025-03-08 19:36:56,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#22 [2025-03-08 19:36:56,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#23 [2025-03-08 19:36:56,492 INFO L130 BoogieDeclarations]: Found specification of procedure copy_to_user [2025-03-08 19:36:56,492 INFO L138 BoogieDeclarations]: Found implementation of procedure copy_to_user [2025-03-08 19:36:56,492 INFO L130 BoogieDeclarations]: Found specification of procedure mpt_deregister [2025-03-08 19:36:56,492 INFO L138 BoogieDeclarations]: Found implementation of procedure mpt_deregister [2025-03-08 19:36:56,492 INFO L130 BoogieDeclarations]: Found specification of procedure kfree_sgl [2025-03-08 19:36:56,492 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree_sgl [2025-03-08 19:36:56,492 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2025-03-08 19:36:56,492 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2025-03-08 19:36:56,492 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_zalloc [2025-03-08 19:36:56,492 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_zalloc [2025-03-08 19:36:56,492 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-08 19:36:56,492 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_memset [2025-03-08 19:36:56,492 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_memset [2025-03-08 19:36:56,492 INFO L130 BoogieDeclarations]: Found specification of procedure copy_from_user [2025-03-08 19:36:56,492 INFO L138 BoogieDeclarations]: Found implementation of procedure copy_from_user [2025-03-08 19:36:56,492 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 19:36:56,492 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2025-03-08 19:36:56,492 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2025-03-08 19:36:56,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-08 19:36:56,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-08 19:36:56,493 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-08 19:36:56,493 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-08 19:36:56,493 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-03-08 19:36:56,493 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-03-08 19:36:56,493 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-03-08 19:36:56,493 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-03-08 19:36:56,493 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-03-08 19:36:56,493 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-03-08 19:36:56,493 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-03-08 19:36:56,493 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-03-08 19:36:56,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-03-08 19:36:56,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-03-08 19:36:56,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2025-03-08 19:36:56,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#15 [2025-03-08 19:36:56,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#16 [2025-03-08 19:36:56,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#17 [2025-03-08 19:36:56,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#18 [2025-03-08 19:36:56,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#19 [2025-03-08 19:36:56,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#20 [2025-03-08 19:36:56,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#21 [2025-03-08 19:36:56,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#22 [2025-03-08 19:36:56,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#23 [2025-03-08 19:36:56,494 INFO L130 BoogieDeclarations]: Found specification of procedure mpt_get_msg_frame [2025-03-08 19:36:56,494 INFO L138 BoogieDeclarations]: Found implementation of procedure mpt_get_msg_frame [2025-03-08 19:36:56,494 INFO L130 BoogieDeclarations]: Found specification of procedure PTR_ERR [2025-03-08 19:36:56,494 INFO L138 BoogieDeclarations]: Found implementation of procedure PTR_ERR [2025-03-08 19:36:56,494 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_mutex_of__MPT_MGMT [2025-03-08 19:36:56,494 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_mutex_of__MPT_MGMT [2025-03-08 19:36:56,494 INFO L130 BoogieDeclarations]: Found specification of procedure mpt_send_handshake_request [2025-03-08 19:36:56,494 INFO L138 BoogieDeclarations]: Found implementation of procedure mpt_send_handshake_request [2025-03-08 19:36:56,494 INFO L130 BoogieDeclarations]: Found specification of procedure mpt_register [2025-03-08 19:36:56,494 INFO L138 BoogieDeclarations]: Found implementation of procedure mpt_register [2025-03-08 19:36:56,494 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_trylock_mutex_of__MPT_MGMT [2025-03-08 19:36:56,494 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_trylock_mutex_of__MPT_MGMT [2025-03-08 19:36:56,494 INFO L130 BoogieDeclarations]: Found specification of procedure shost_priv [2025-03-08 19:36:56,494 INFO L138 BoogieDeclarations]: Found implementation of procedure shost_priv [2025-03-08 19:36:56,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 19:36:56,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 19:36:56,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 19:36:56,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-08 19:36:56,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-08 19:36:56,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-08 19:36:56,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-08 19:36:56,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-08 19:36:56,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-08 19:36:56,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-08 19:36:56,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-08 19:36:56,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-08 19:36:56,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-08 19:36:56,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-03-08 19:36:56,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-03-08 19:36:56,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-03-08 19:36:56,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-03-08 19:36:56,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-03-08 19:36:56,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-03-08 19:36:56,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-03-08 19:36:56,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#20 [2025-03-08 19:36:56,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#21 [2025-03-08 19:36:56,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#22 [2025-03-08 19:36:56,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#23 [2025-03-08 19:36:56,494 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 19:36:56,494 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 19:36:56,495 INFO L130 BoogieDeclarations]: Found specification of procedure mpt_config [2025-03-08 19:36:56,495 INFO L138 BoogieDeclarations]: Found implementation of procedure mpt_config [2025-03-08 19:36:56,495 INFO L130 BoogieDeclarations]: Found specification of procedure mpt_free_msg_frame [2025-03-08 19:36:56,495 INFO L138 BoogieDeclarations]: Found implementation of procedure mpt_free_msg_frame [2025-03-08 19:36:56,495 INFO L130 BoogieDeclarations]: Found specification of procedure IS_ERR [2025-03-08 19:36:56,495 INFO L138 BoogieDeclarations]: Found implementation of procedure IS_ERR [2025-03-08 19:36:57,176 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 19:36:57,179 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 19:36:57,194 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2025-03-08 19:36:57,216 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L10076: havoc #t~nondet1581; [2025-03-08 19:36:57,255 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9973: havoc #t~nondet1564; [2025-03-08 19:36:57,259 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L10061: havoc #t~nondet1578; [2025-03-08 19:36:57,265 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9910: havoc #t~ret1553.base, #t~ret1553.offset; [2025-03-08 19:36:57,323 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8882-1: ldv_mutex_trylock_12_#res#1 := ldv_mutex_trylock_12_~ldv_func_res~1#1; [2025-03-08 19:36:57,323 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L10057: havoc mutex_lock_interruptible_#t~nondet1577#1; [2025-03-08 19:36:57,323 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8895-1: ldv_mutex_lock_interruptible_13_#res#1 := ldv_mutex_lock_interruptible_13_~ldv_func_res~2#1; [2025-03-08 19:36:57,357 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9937: havoc dma_alloc_attrs_#t~ret1557#1.base, dma_alloc_attrs_#t~ret1557#1.offset; [2025-03-08 19:37:00,219 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7369: call ULTIMATE.dealloc(mptctl_eventreport_~#karg~5#1.base, mptctl_eventreport_~#karg~5#1.offset);havoc mptctl_eventreport_~#karg~5#1.base, mptctl_eventreport_~#karg~5#1.offset;call ULTIMATE.dealloc(mptctl_eventreport_~#ioc~6#1.base, mptctl_eventreport_~#ioc~6#1.offset);havoc mptctl_eventreport_~#ioc~6#1.base, mptctl_eventreport_~#ioc~6#1.offset; [2025-03-08 19:37:00,220 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6977: call ULTIMATE.dealloc(mptctl_getiocinfo_~#ioc~1#1.base, mptctl_getiocinfo_~#ioc~1#1.offset);havoc mptctl_getiocinfo_~#ioc~1#1.base, mptctl_getiocinfo_~#ioc~1#1.offset; [2025-03-08 19:37:00,220 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6384: call ULTIMATE.dealloc(~#khdr~0#1.base, ~#khdr~0#1.offset);havoc ~#khdr~0#1.base, ~#khdr~0#1.offset;call ULTIMATE.dealloc(~#iocp~0#1.base, ~#iocp~0#1.offset);havoc ~#iocp~0#1.base, ~#iocp~0#1.offset; [2025-03-08 19:37:00,220 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9985: havoc mpt_alloc_fw_memory_#t~nondet1567#1; [2025-03-08 19:37:00,220 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8235: call ULTIMATE.dealloc(mptctl_hp_targetinfo_~#ioc~11#1.base, mptctl_hp_targetinfo_~#ioc~11#1.offset);havoc mptctl_hp_targetinfo_~#ioc~11#1.base, mptctl_hp_targetinfo_~#ioc~11#1.offset;call ULTIMATE.dealloc(mptctl_hp_targetinfo_~#karg~9#1.base, mptctl_hp_targetinfo_~#karg~9#1.offset);havoc mptctl_hp_targetinfo_~#karg~9#1.base, mptctl_hp_targetinfo_~#karg~9#1.offset;call ULTIMATE.dealloc(mptctl_hp_targetinfo_~#page_dma~0#1.base, mptctl_hp_targetinfo_~#page_dma~0#1.offset);havoc mptctl_hp_targetinfo_~#page_dma~0#1.base, mptctl_hp_targetinfo_~#page_dma~0#1.offset;call ULTIMATE.dealloc(mptctl_hp_targetinfo_~#cfg~1#1.base, mptctl_hp_targetinfo_~#cfg~1#1.offset);havoc mptctl_hp_targetinfo_~#cfg~1#1.base, mptctl_hp_targetinfo_~#cfg~1#1.offset;call ULTIMATE.dealloc(mptctl_hp_targetinfo_~#hdr~2#1.base, mptctl_hp_targetinfo_~#hdr~2#1.offset);havoc mptctl_hp_targetinfo_~#hdr~2#1.base, mptctl_hp_targetinfo_~#hdr~2#1.offset; [2025-03-08 19:37:00,220 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7477: call ULTIMATE.dealloc(mptctl_mpt_command_~#karg~7#1.base, mptctl_mpt_command_~#karg~7#1.offset);havoc mptctl_mpt_command_~#karg~7#1.base, mptctl_mpt_command_~#karg~7#1.offset;call ULTIMATE.dealloc(mptctl_mpt_command_~#ioc~8#1.base, mptctl_mpt_command_~#ioc~8#1.offset);havoc mptctl_mpt_command_~#ioc~8#1.base, mptctl_mpt_command_~#ioc~8#1.offset; [2025-03-08 19:37:00,220 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7279: call ULTIMATE.dealloc(mptctl_eventquery_~#karg~3#1.base, mptctl_eventquery_~#karg~3#1.offset);havoc mptctl_eventquery_~#karg~3#1.base, mptctl_eventquery_~#karg~3#1.offset;call ULTIMATE.dealloc(mptctl_eventquery_~#ioc~4#1.base, mptctl_eventquery_~#ioc~4#1.offset);havoc mptctl_eventquery_~#ioc~4#1.base, mptctl_eventquery_~#ioc~4#1.offset; [2025-03-08 19:37:00,220 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6491: call ULTIMATE.dealloc(mptctl_do_reset_~#krinfo~0#1.base, mptctl_do_reset_~#krinfo~0#1.offset);havoc mptctl_do_reset_~#krinfo~0#1.base, mptctl_do_reset_~#krinfo~0#1.offset;call ULTIMATE.dealloc(mptctl_do_reset_~#iocp~1#1.base, mptctl_do_reset_~#iocp~1#1.offset);havoc mptctl_do_reset_~#iocp~1#1.base, mptctl_do_reset_~#iocp~1#1.offset; [2025-03-08 19:37:00,221 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7119: call ULTIMATE.dealloc(mptctl_gettargetinfo_~#karg~1#1.base, mptctl_gettargetinfo_~#karg~1#1.offset);havoc mptctl_gettargetinfo_~#karg~1#1.base, mptctl_gettargetinfo_~#karg~1#1.offset;call ULTIMATE.dealloc(mptctl_gettargetinfo_~#ioc~2#1.base, mptctl_gettargetinfo_~#ioc~2#1.offset);havoc mptctl_gettargetinfo_~#ioc~2#1.base, mptctl_gettargetinfo_~#ioc~2#1.offset; [2025-03-08 19:37:00,221 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9961: havoc memdup_user_#t~ret1561#1.base, memdup_user_#t~ret1561#1.offset; [2025-03-08 19:37:00,221 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7321: call ULTIMATE.dealloc(mptctl_eventenable_~#karg~4#1.base, mptctl_eventenable_~#karg~4#1.offset);havoc mptctl_eventenable_~#karg~4#1.base, mptctl_eventenable_~#karg~4#1.offset;call ULTIMATE.dealloc(mptctl_eventenable_~#ioc~5#1.base, mptctl_eventenable_~#ioc~5#1.offset);havoc mptctl_eventenable_~#ioc~5#1.base, mptctl_eventenable_~#ioc~5#1.offset; [2025-03-08 19:37:00,221 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7422: call ULTIMATE.dealloc(mptctl_replace_fw_~#karg~6#1.base, mptctl_replace_fw_~#karg~6#1.offset);havoc mptctl_replace_fw_~#karg~6#1.base, mptctl_replace_fw_~#karg~6#1.offset;call ULTIMATE.dealloc(mptctl_replace_fw_~#ioc~7#1.base, mptctl_replace_fw_~#ioc~7#1.offset);havoc mptctl_replace_fw_~#ioc~7#1.base, mptctl_replace_fw_~#ioc~7#1.offset; [2025-03-08 19:37:00,221 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6531: call ULTIMATE.dealloc(mptctl_fw_download_~#kfwdl~0#1.base, mptctl_fw_download_~#kfwdl~0#1.offset);havoc mptctl_fw_download_~#kfwdl~0#1.base, mptctl_fw_download_~#kfwdl~0#1.offset; [2025-03-08 19:37:00,221 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5643: havoc pci_domain_nr_#t~mem54#1; [2025-03-08 19:37:00,221 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7993: call ULTIMATE.dealloc(mptctl_hp_hostinfo_~#ioc~10#1.base, mptctl_hp_hostinfo_~#ioc~10#1.offset);havoc mptctl_hp_hostinfo_~#ioc~10#1.base, mptctl_hp_hostinfo_~#ioc~10#1.offset;call ULTIMATE.dealloc(mptctl_hp_hostinfo_~#buf_dma~0#1.base, mptctl_hp_hostinfo_~#buf_dma~0#1.offset);havoc mptctl_hp_hostinfo_~#buf_dma~0#1.base, mptctl_hp_hostinfo_~#buf_dma~0#1.offset;call ULTIMATE.dealloc(mptctl_hp_hostinfo_~#karg~8#1.base, mptctl_hp_hostinfo_~#karg~8#1.offset);havoc mptctl_hp_hostinfo_~#karg~8#1.base, mptctl_hp_hostinfo_~#karg~8#1.offset;call ULTIMATE.dealloc(mptctl_hp_hostinfo_~#cfg~0#1.base, mptctl_hp_hostinfo_~#cfg~0#1.offset);havoc mptctl_hp_hostinfo_~#cfg~0#1.base, mptctl_hp_hostinfo_~#cfg~0#1.offset;call ULTIMATE.dealloc(mptctl_hp_hostinfo_~#hdr~1#1.base, mptctl_hp_hostinfo_~#hdr~1#1.offset);havoc mptctl_hp_hostinfo_~#hdr~1#1.base, mptctl_hp_hostinfo_~#hdr~1#1.offset; [2025-03-08 19:37:00,221 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7234: call ULTIMATE.dealloc(mptctl_readtest_~#karg~2#1.base, mptctl_readtest_~#karg~2#1.offset);havoc mptctl_readtest_~#karg~2#1.base, mptctl_readtest_~#karg~2#1.offset;call ULTIMATE.dealloc(mptctl_readtest_~#ioc~3#1.base, mptctl_readtest_~#ioc~3#1.offset);havoc mptctl_readtest_~#ioc~3#1.base, mptctl_readtest_~#ioc~3#1.offset; [2025-03-08 19:37:00,221 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9977: havoc mpt_HardResetHandler_#t~nondet1565#1; [2025-03-08 19:37:02,227 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7503: call ULTIMATE.dealloc(~#karg#1.base, ~#karg#1.offset);havoc ~#karg#1.base, ~#karg#1.offset;call ULTIMATE.dealloc(~#ioc~9#1.base, ~#ioc~9#1.offset);havoc ~#ioc~9#1.base, ~#ioc~9#1.offset;call ULTIMATE.dealloc(~#bufIn~0#1.base, ~#bufIn~0#1.offset);havoc ~#bufIn~0#1.base, ~#bufIn~0#1.offset;call ULTIMATE.dealloc(~#bufOut~0#1.base, ~#bufOut~0#1.offset);havoc ~#bufOut~0#1.base, ~#bufOut~0#1.offset;call ULTIMATE.dealloc(~#dma_addr_in~0#1.base, ~#dma_addr_in~0#1.offset);havoc ~#dma_addr_in~0#1.base, ~#dma_addr_in~0#1.offset;call ULTIMATE.dealloc(~#dma_addr_out~0#1.base, ~#dma_addr_out~0#1.offset);havoc ~#dma_addr_out~0#1.base, ~#dma_addr_out~0#1.offset; [2025-03-08 19:37:02,543 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6744: #res#1 := 0;call ULTIMATE.dealloc(~#iocp~2#1.base, ~#iocp~2#1.offset);havoc ~#iocp~2#1.base, ~#iocp~2#1.offset;call ULTIMATE.dealloc(~#buflist~0#1.base, ~#buflist~0#1.offset);havoc ~#buflist~0#1.base, ~#buflist~0#1.offset;call ULTIMATE.dealloc(~#sgl_dma~0#1.base, ~#sgl_dma~0#1.offset);havoc ~#sgl_dma~0#1.base, ~#sgl_dma~0#1.offset;call ULTIMATE.dealloc(~#numfrags~0#1.base, ~#numfrags~0#1.offset);havoc ~#numfrags~0#1.base, ~#numfrags~0#1.offset; [2025-03-08 19:37:02,543 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6766: call ULTIMATE.dealloc(kbuf_alloc_2_sgl_~#pa~0#1.base, kbuf_alloc_2_sgl_~#pa~0#1.offset);havoc kbuf_alloc_2_sgl_~#pa~0#1.base, kbuf_alloc_2_sgl_~#pa~0#1.offset; [2025-03-08 19:37:02,544 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6552: call ULTIMATE.dealloc(~#iocp~2#1.base, ~#iocp~2#1.offset);havoc ~#iocp~2#1.base, ~#iocp~2#1.offset;call ULTIMATE.dealloc(~#buflist~0#1.base, ~#buflist~0#1.offset);havoc ~#buflist~0#1.base, ~#buflist~0#1.offset;call ULTIMATE.dealloc(~#sgl_dma~0#1.base, ~#sgl_dma~0#1.offset);havoc ~#sgl_dma~0#1.base, ~#sgl_dma~0#1.offset;call ULTIMATE.dealloc(~#numfrags~0#1.base, ~#numfrags~0#1.offset);havoc ~#numfrags~0#1.base, ~#numfrags~0#1.offset; [2025-03-08 19:37:02,710 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L10072: havoc #t~nondet1580; [2025-03-08 19:37:02,796 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9981: havoc mpt_Soft_Hard_ResetHandler_#t~nondet1566#1; [2025-03-08 19:37:02,805 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5602: havoc __kmalloc_#t~ret48#1.base, __kmalloc_#t~ret48#1.offset; [2025-03-08 19:37:02,806 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9922: havoc #t~nondet1556; [2025-03-08 19:37:02,826 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9944: havoc fasync_helper_#t~nondet1558#1; [2025-03-08 19:37:02,831 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5672: havoc #t~mem70.base, #t~mem70.offset; [2025-03-08 19:37:02,855 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9965: havoc #t~nondet1562; [2025-03-08 19:37:02,859 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L10046: havoc #t~nondet1575; [2025-03-08 19:37:02,861 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9907: havoc #t~nondet1552; [2025-03-08 19:37:02,866 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L10050: havoc #t~nondet1576; [2025-03-08 19:37:02,891 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9918: havoc _copy_to_user_#t~nondet1555#1; [2025-03-08 19:37:03,036 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9914: havoc _copy_from_user_#t~nondet1554#1; [2025-03-08 19:37:03,040 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L10018: havoc #t~ret1571.base, #t~ret1571.offset; [2025-03-08 19:37:03,051 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L10042: havoc #t~nondet1574; [2025-03-08 19:37:03,053 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L10031: havoc #t~nondet1572; [2025-03-08 19:37:08,169 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8525: call ULTIMATE.dealloc(mptctl_probe_~#__key~1#1.base, mptctl_probe_~#__key~1#1.offset);havoc mptctl_probe_~#__key~1#1.base, mptctl_probe_~#__key~1#1.offset; [2025-03-08 19:37:08,170 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5635: havoc dev_get_drvdata_#t~mem52#1.base, dev_get_drvdata_#t~mem52#1.offset; [2025-03-08 19:37:08,170 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8625: call ULTIMATE.dealloc(main_~#ldvarg7~0#1.base, main_~#ldvarg7~0#1.offset);havoc main_~#ldvarg7~0#1.base, main_~#ldvarg7~0#1.offset;call ULTIMATE.dealloc(main_~#ldvarg3~0#1.base, main_~#ldvarg3~0#1.offset);havoc main_~#ldvarg3~0#1.base, main_~#ldvarg3~0#1.offset;call ULTIMATE.dealloc(main_~#ldvarg5~0#1.base, main_~#ldvarg5~0#1.offset);havoc main_~#ldvarg5~0#1.base, main_~#ldvarg5~0#1.offset;call ULTIMATE.dealloc(main_~#ldvarg6~0#1.base, main_~#ldvarg6~0#1.offset);havoc main_~#ldvarg6~0#1.base, main_~#ldvarg6~0#1.offset;call ULTIMATE.dealloc(main_~#ldvarg1~0#1.base, main_~#ldvarg1~0#1.offset);havoc main_~#ldvarg1~0#1.base, main_~#ldvarg1~0#1.offset;call ULTIMATE.dealloc(main_~#ldvarg8~0#1.base, main_~#ldvarg8~0#1.offset);havoc main_~#ldvarg8~0#1.base, main_~#ldvarg8~0#1.offset;call ULTIMATE.dealloc(main_~#ldvarg4~0#1.base, main_~#ldvarg4~0#1.offset);havoc main_~#ldvarg4~0#1.base, main_~#ldvarg4~0#1.offset;call ULTIMATE.dealloc(main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset);havoc main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset; [2025-03-08 19:37:08,170 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5588: call ULTIMATE.dealloc(init_completion_~#__key~0#1.base, init_completion_~#__key~0#1.offset);havoc init_completion_~#__key~0#1.base, init_completion_~#__key~0#1.offset; [2025-03-08 19:37:08,170 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8432: call ULTIMATE.dealloc(compat_mpt_command_~#karg32~0#1.base, compat_mpt_command_~#karg32~0#1.offset);havoc compat_mpt_command_~#karg32~0#1.base, compat_mpt_command_~#karg32~0#1.offset;call ULTIMATE.dealloc(compat_mpt_command_~#karg~10#1.base, compat_mpt_command_~#karg~10#1.offset);havoc compat_mpt_command_~#karg~10#1.base, compat_mpt_command_~#karg~10#1.offset;call ULTIMATE.dealloc(compat_mpt_command_~#iocp~4#1.base, compat_mpt_command_~#iocp~4#1.offset);havoc compat_mpt_command_~#iocp~4#1.base, compat_mpt_command_~#iocp~4#1.offset; [2025-03-08 19:37:08,170 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L10068: havoc no_llseek_#t~nondet1579#1; [2025-03-08 19:37:08,170 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L10002: havoc mpt_device_driver_register_#t~nondet1569#1; [2025-03-08 19:37:08,170 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9969: havoc misc_register_#t~nondet1563#1; [2025-03-08 19:37:08,170 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9954: havoc ldv_open_2_#t~nondet1559#1; [2025-03-08 19:37:08,170 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L10038: havoc mpt_reset_register_#t~nondet1573#1; [2025-03-08 19:37:08,170 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9958: havoc ldv_release_2_#t~nondet1560#1; [2025-03-08 19:37:08,170 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8390: call ULTIMATE.dealloc(compat_mptfwxfer_ioctl_~#kfw32~0#1.base, compat_mptfwxfer_ioctl_~#kfw32~0#1.offset);havoc compat_mptfwxfer_ioctl_~#kfw32~0#1.base, compat_mptfwxfer_ioctl_~#kfw32~0#1.offset;call ULTIMATE.dealloc(compat_mptfwxfer_ioctl_~#kfw~0#1.base, compat_mptfwxfer_ioctl_~#kfw~0#1.offset);havoc compat_mptfwxfer_ioctl_~#kfw~0#1.base, compat_mptfwxfer_ioctl_~#kfw~0#1.offset;call ULTIMATE.dealloc(compat_mptfwxfer_ioctl_~#iocp~3#1.base, compat_mptfwxfer_ioctl_~#iocp~3#1.offset);havoc compat_mptfwxfer_ioctl_~#iocp~3#1.base, compat_mptfwxfer_ioctl_~#iocp~3#1.offset; [2025-03-08 19:37:08,170 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L10009: havoc mpt_event_register_#t~nondet1570#1; [2025-03-08 19:37:08,173 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9992: havoc #t~nondet1568; [2025-03-08 19:37:08,789 INFO L? ?]: Removed 2189 outVars from TransFormulas that were not future-live. [2025-03-08 19:37:08,789 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 19:37:08,893 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 19:37:08,893 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 19:37:08,893 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 07:37:08 BoogieIcfgContainer [2025-03-08 19:37:08,893 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 19:37:08,895 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 19:37:08,895 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 19:37:08,898 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 19:37:08,898 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 07:36:53" (1/3) ... [2025-03-08 19:37:08,899 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4374f861 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 07:37:08, skipping insertion in model container [2025-03-08 19:37:08,899 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:36:55" (2/3) ... [2025-03-08 19:37:08,899 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4374f861 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 07:37:08, skipping insertion in model container [2025-03-08 19:37:08,899 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 07:37:08" (3/3) ... [2025-03-08 19:37:08,900 INFO L128 eAbstractionObserver]: Analyzing ICFG linux-4.2-rc1.tar.xz-32_7a-drivers--message--fusion--mptctl.ko-entry_point.cil.out.i [2025-03-08 19:37:08,910 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 19:37:08,913 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG linux-4.2-rc1.tar.xz-32_7a-drivers--message--fusion--mptctl.ko-entry_point.cil.out.i that has 88 procedures, 1894 locations, 1 initial locations, 24 loop locations, and 1 error locations. [2025-03-08 19:37:08,984 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 19:37:08,993 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@2e3b4576, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 19:37:08,993 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 19:37:09,001 INFO L276 IsEmpty]: Start isEmpty. Operand has 1805 states, 1352 states have (on average 1.4127218934911243) internal successors, (1910), 1372 states have internal predecessors, (1910), 387 states have call successors, (387), 65 states have call predecessors, (387), 64 states have return successors, (383), 382 states have call predecessors, (383), 383 states have call successors, (383) [2025-03-08 19:37:09,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-08 19:37:09,008 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:37:09,009 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 19:37:09,009 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:37:09,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:37:09,013 INFO L85 PathProgramCache]: Analyzing trace with hash 1683632838, now seen corresponding path program 1 times [2025-03-08 19:37:09,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:37:09,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440082609] [2025-03-08 19:37:09,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:37:09,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:37:09,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-08 19:37:09,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-08 19:37:09,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:37:09,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:37:09,849 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2025-03-08 19:37:09,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:37:09,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440082609] [2025-03-08 19:37:09,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440082609] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:37:09,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:37:09,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 19:37:09,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167193889] [2025-03-08 19:37:09,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:37:09,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 19:37:09,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:37:09,870 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 19:37:09,871 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 19:37:09,876 INFO L87 Difference]: Start difference. First operand has 1805 states, 1352 states have (on average 1.4127218934911243) internal successors, (1910), 1372 states have internal predecessors, (1910), 387 states have call successors, (387), 65 states have call predecessors, (387), 64 states have return successors, (383), 382 states have call predecessors, (383), 383 states have call successors, (383) Second operand has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 19:37:10,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:37:10,200 INFO L93 Difference]: Finished difference Result 3605 states and 5424 transitions. [2025-03-08 19:37:10,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 19:37:10,202 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 119 [2025-03-08 19:37:10,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:37:10,222 INFO L225 Difference]: With dead ends: 3605 [2025-03-08 19:37:10,223 INFO L226 Difference]: Without dead ends: 1792 [2025-03-08 19:37:10,237 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 19:37:10,240 INFO L435 NwaCegarLoop]: 2586 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2586 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 19:37:10,241 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2586 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 19:37:10,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1792 states. [2025-03-08 19:37:10,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1792 to 1792. [2025-03-08 19:37:10,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1792 states, 1345 states have (on average 1.4059479553903347) internal successors, (1891), 1359 states have internal predecessors, (1891), 383 states have call successors, (383), 64 states have call predecessors, (383), 63 states have return successors, (372), 371 states have call predecessors, (372), 372 states have call successors, (372) [2025-03-08 19:37:10,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1792 states to 1792 states and 2646 transitions. [2025-03-08 19:37:10,382 INFO L78 Accepts]: Start accepts. Automaton has 1792 states and 2646 transitions. Word has length 119 [2025-03-08 19:37:10,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:37:10,384 INFO L471 AbstractCegarLoop]: Abstraction has 1792 states and 2646 transitions. [2025-03-08 19:37:10,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 19:37:10,384 INFO L276 IsEmpty]: Start isEmpty. Operand 1792 states and 2646 transitions. [2025-03-08 19:37:10,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-08 19:37:10,387 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:37:10,387 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 19:37:10,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 19:37:10,387 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:37:10,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:37:10,387 INFO L85 PathProgramCache]: Analyzing trace with hash 697050149, now seen corresponding path program 1 times [2025-03-08 19:37:10,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:37:10,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436314062] [2025-03-08 19:37:10,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:37:10,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:37:10,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-08 19:37:10,784 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-08 19:37:10,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:37:10,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:37:10,968 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2025-03-08 19:37:10,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:37:10,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436314062] [2025-03-08 19:37:10,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436314062] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:37:10,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:37:10,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 19:37:10,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453248054] [2025-03-08 19:37:10,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:37:10,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 19:37:10,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:37:10,972 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 19:37:10,972 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:37:10,972 INFO L87 Difference]: Start difference. First operand 1792 states and 2646 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-08 19:37:11,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:37:11,251 INFO L93 Difference]: Finished difference Result 3656 states and 5376 transitions. [2025-03-08 19:37:11,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 19:37:11,251 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 119 [2025-03-08 19:37:11,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:37:11,265 INFO L225 Difference]: With dead ends: 3656 [2025-03-08 19:37:11,265 INFO L226 Difference]: Without dead ends: 1894 [2025-03-08 19:37:11,271 INFO L434 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 [2025-03-08 19:37:11,273 INFO L435 NwaCegarLoop]: 2598 mSDtfsCounter, 168 mSDsluCounter, 2488 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 5086 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 19:37:11,273 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 5086 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 19:37:11,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1894 states. [2025-03-08 19:37:11,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1894 to 1877. [2025-03-08 19:37:11,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1877 states, 1408 states have (on average 1.3998579545454546) internal successors, (1971), 1424 states have internal predecessors, (1971), 394 states have call successors, (394), 75 states have call predecessors, (394), 74 states have return successors, (383), 380 states have call predecessors, (383), 383 states have call successors, (383) [2025-03-08 19:37:11,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1877 states to 1877 states and 2748 transitions. [2025-03-08 19:37:11,402 INFO L78 Accepts]: Start accepts. Automaton has 1877 states and 2748 transitions. Word has length 119 [2025-03-08 19:37:11,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:37:11,404 INFO L471 AbstractCegarLoop]: Abstraction has 1877 states and 2748 transitions. [2025-03-08 19:37:11,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-08 19:37:11,404 INFO L276 IsEmpty]: Start isEmpty. Operand 1877 states and 2748 transitions. [2025-03-08 19:37:11,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-08 19:37:11,408 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:37:11,408 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 19:37:11,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 19:37:11,409 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:37:11,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:37:11,409 INFO L85 PathProgramCache]: Analyzing trace with hash -836895522, now seen corresponding path program 1 times [2025-03-08 19:37:11,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:37:11,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661968500] [2025-03-08 19:37:11,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:37:11,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:37:11,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-08 19:37:11,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-08 19:37:11,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:37:11,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:37:11,972 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2025-03-08 19:37:11,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:37:11,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661968500] [2025-03-08 19:37:11,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661968500] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:37:11,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:37:11,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 19:37:11,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664837226] [2025-03-08 19:37:11,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:37:11,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 19:37:11,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:37:11,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 19:37:11,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:37:11,975 INFO L87 Difference]: Start difference. First operand 1877 states and 2748 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 19:37:15,996 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 19:37:16,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:37:16,465 INFO L93 Difference]: Finished difference Result 5431 states and 7997 transitions. [2025-03-08 19:37:16,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 19:37:16,466 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 143 [2025-03-08 19:37:16,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:37:16,487 INFO L225 Difference]: With dead ends: 5431 [2025-03-08 19:37:16,488 INFO L226 Difference]: Without dead ends: 3594 [2025-03-08 19:37:16,496 INFO L434 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 [2025-03-08 19:37:16,498 INFO L435 NwaCegarLoop]: 2695 mSDtfsCounter, 2562 mSDsluCounter, 2498 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2562 SdHoareTripleChecker+Valid, 5193 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2025-03-08 19:37:16,500 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2562 Valid, 5193 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 169 Invalid, 1 Unknown, 0 Unchecked, 4.4s Time] [2025-03-08 19:37:16,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3594 states. [2025-03-08 19:37:16,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3594 to 3582. [2025-03-08 19:37:16,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3582 states, 2715 states have (on average 1.4084714548802946) internal successors, (3824), 2734 states have internal predecessors, (3824), 734 states have call successors, (734), 133 states have call predecessors, (734), 132 states have return successors, (723), 720 states have call predecessors, (723), 723 states have call successors, (723) [2025-03-08 19:37:16,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3582 states to 3582 states and 5281 transitions. [2025-03-08 19:37:16,632 INFO L78 Accepts]: Start accepts. Automaton has 3582 states and 5281 transitions. Word has length 143 [2025-03-08 19:37:16,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:37:16,633 INFO L471 AbstractCegarLoop]: Abstraction has 3582 states and 5281 transitions. [2025-03-08 19:37:16,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 19:37:16,633 INFO L276 IsEmpty]: Start isEmpty. Operand 3582 states and 5281 transitions. [2025-03-08 19:37:16,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-03-08 19:37:16,634 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:37:16,635 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 19:37:16,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 19:37:16,635 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:37:16,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:37:16,635 INFO L85 PathProgramCache]: Analyzing trace with hash 407855144, now seen corresponding path program 1 times [2025-03-08 19:37:16,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:37:16,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56569969] [2025-03-08 19:37:16,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:37:16,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:37:17,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-03-08 19:37:17,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-03-08 19:37:17,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:37:17,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:37:17,244 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 297 trivial. 0 not checked. [2025-03-08 19:37:17,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:37:17,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56569969] [2025-03-08 19:37:17,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56569969] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:37:17,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:37:17,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 19:37:17,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681472262] [2025-03-08 19:37:17,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:37:17,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 19:37:17,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:37:17,246 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 19:37:17,246 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:37:17,246 INFO L87 Difference]: Start difference. First operand 3582 states and 5281 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 3 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 19:37:17,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:37:17,466 INFO L93 Difference]: Finished difference Result 3584 states and 5282 transitions. [2025-03-08 19:37:17,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 19:37:17,467 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 3 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 173 [2025-03-08 19:37:17,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:37:17,483 INFO L225 Difference]: With dead ends: 3584 [2025-03-08 19:37:17,483 INFO L226 Difference]: Without dead ends: 3581 [2025-03-08 19:37:17,487 INFO L434 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 [2025-03-08 19:37:17,487 INFO L435 NwaCegarLoop]: 2566 mSDtfsCounter, 2597 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2597 SdHoareTripleChecker+Valid, 2566 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 19:37:17,487 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2597 Valid, 2566 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 19:37:17,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3581 states. [2025-03-08 19:37:17,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3581 to 3581. [2025-03-08 19:37:17,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3581 states, 2715 states have (on average 1.4081031307550644) internal successors, (3823), 2733 states have internal predecessors, (3823), 733 states have call successors, (733), 133 states have call predecessors, (733), 132 states have return successors, (723), 720 states have call predecessors, (723), 723 states have call successors, (723) [2025-03-08 19:37:17,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3581 states to 3581 states and 5279 transitions. [2025-03-08 19:37:17,641 INFO L78 Accepts]: Start accepts. Automaton has 3581 states and 5279 transitions. Word has length 173 [2025-03-08 19:37:17,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:37:17,642 INFO L471 AbstractCegarLoop]: Abstraction has 3581 states and 5279 transitions. [2025-03-08 19:37:17,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 3 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 19:37:17,642 INFO L276 IsEmpty]: Start isEmpty. Operand 3581 states and 5279 transitions. [2025-03-08 19:37:17,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-03-08 19:37:17,643 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:37:17,644 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 19:37:17,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 19:37:17,644 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:37:17,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:37:17,644 INFO L85 PathProgramCache]: Analyzing trace with hash -242303786, now seen corresponding path program 1 times [2025-03-08 19:37:17,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:37:17,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477949977] [2025-03-08 19:37:17,645 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:37:17,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:37:17,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-03-08 19:37:17,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-03-08 19:37:17,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:37:17,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:37:18,072 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 297 trivial. 0 not checked. [2025-03-08 19:37:18,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:37:18,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477949977] [2025-03-08 19:37:18,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477949977] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:37:18,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:37:18,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 19:37:18,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796097788] [2025-03-08 19:37:18,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:37:18,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 19:37:18,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:37:18,074 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 19:37:18,074 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:37:18,075 INFO L87 Difference]: Start difference. First operand 3581 states and 5279 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 3 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 19:37:18,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:37:18,299 INFO L93 Difference]: Finished difference Result 3583 states and 5280 transitions. [2025-03-08 19:37:18,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 19:37:18,300 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 3 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 174 [2025-03-08 19:37:18,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:37:18,321 INFO L225 Difference]: With dead ends: 3583 [2025-03-08 19:37:18,321 INFO L226 Difference]: Without dead ends: 3580 [2025-03-08 19:37:18,325 INFO L434 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 [2025-03-08 19:37:18,326 INFO L435 NwaCegarLoop]: 2564 mSDtfsCounter, 2594 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2594 SdHoareTripleChecker+Valid, 2564 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 19:37:18,327 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2594 Valid, 2564 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 19:37:18,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3580 states. [2025-03-08 19:37:18,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3580 to 3580. [2025-03-08 19:37:18,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3580 states, 2715 states have (on average 1.4077348066298343) internal successors, (3822), 2732 states have internal predecessors, (3822), 732 states have call successors, (732), 133 states have call predecessors, (732), 132 states have return successors, (723), 720 states have call predecessors, (723), 723 states have call successors, (723) [2025-03-08 19:37:18,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3580 states to 3580 states and 5277 transitions. [2025-03-08 19:37:18,493 INFO L78 Accepts]: Start accepts. Automaton has 3580 states and 5277 transitions. Word has length 174 [2025-03-08 19:37:18,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:37:18,494 INFO L471 AbstractCegarLoop]: Abstraction has 3580 states and 5277 transitions. [2025-03-08 19:37:18,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 3 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 19:37:18,494 INFO L276 IsEmpty]: Start isEmpty. Operand 3580 states and 5277 transitions. [2025-03-08 19:37:18,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-03-08 19:37:18,496 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:37:18,496 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 19:37:18,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 19:37:18,496 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:37:18,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:37:18,497 INFO L85 PathProgramCache]: Analyzing trace with hash 1077604841, now seen corresponding path program 1 times [2025-03-08 19:37:18,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:37:18,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718546473] [2025-03-08 19:37:18,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:37:18,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:37:18,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-08 19:37:18,796 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-08 19:37:18,796 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:37:18,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:37:18,923 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 297 trivial. 0 not checked. [2025-03-08 19:37:18,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:37:18,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718546473] [2025-03-08 19:37:18,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718546473] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:37:18,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:37:18,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 19:37:18,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268589842] [2025-03-08 19:37:18,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:37:18,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 19:37:18,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:37:18,924 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 19:37:18,924 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:37:18,924 INFO L87 Difference]: Start difference. First operand 3580 states and 5277 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 3 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 19:37:19,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:37:19,290 INFO L93 Difference]: Finished difference Result 3617 states and 5309 transitions. [2025-03-08 19:37:19,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 19:37:19,291 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 3 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 175 [2025-03-08 19:37:19,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:37:19,306 INFO L225 Difference]: With dead ends: 3617 [2025-03-08 19:37:19,307 INFO L226 Difference]: Without dead ends: 3613 [2025-03-08 19:37:19,309 INFO L434 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 [2025-03-08 19:37:19,310 INFO L435 NwaCegarLoop]: 2559 mSDtfsCounter, 233 mSDsluCounter, 2301 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 4860 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 19:37:19,310 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 4860 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 19:37:19,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3613 states. [2025-03-08 19:37:19,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3613 to 3611. [2025-03-08 19:37:19,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3611 states, 2736 states have (on average 1.4038742690058479) internal successors, (3841), 2751 states have internal predecessors, (3841), 734 states have call successors, (734), 141 states have call predecessors, (734), 140 states have return successors, (727), 724 states have call predecessors, (727), 727 states have call successors, (727) [2025-03-08 19:37:19,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3611 states to 3611 states and 5302 transitions. [2025-03-08 19:37:19,420 INFO L78 Accepts]: Start accepts. Automaton has 3611 states and 5302 transitions. Word has length 175 [2025-03-08 19:37:19,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:37:19,421 INFO L471 AbstractCegarLoop]: Abstraction has 3611 states and 5302 transitions. [2025-03-08 19:37:19,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 3 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 19:37:19,421 INFO L276 IsEmpty]: Start isEmpty. Operand 3611 states and 5302 transitions. [2025-03-08 19:37:19,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-03-08 19:37:19,422 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:37:19,422 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 19:37:19,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 19:37:19,422 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:37:19,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:37:19,423 INFO L85 PathProgramCache]: Analyzing trace with hash -954901705, now seen corresponding path program 1 times [2025-03-08 19:37:19,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:37:19,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877076246] [2025-03-08 19:37:19,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:37:19,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:37:19,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-08 19:37:19,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-08 19:37:19,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:37:19,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:37:19,844 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 297 trivial. 0 not checked. [2025-03-08 19:37:19,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:37:19,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877076246] [2025-03-08 19:37:19,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877076246] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:37:19,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:37:19,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 19:37:19,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470161242] [2025-03-08 19:37:19,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:37:19,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 19:37:19,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:37:19,845 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 19:37:19,846 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:37:19,846 INFO L87 Difference]: Start difference. First operand 3611 states and 5302 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 19:37:20,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:37:20,351 INFO L93 Difference]: Finished difference Result 10381 states and 15316 transitions. [2025-03-08 19:37:20,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 19:37:20,352 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 176 [2025-03-08 19:37:20,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:37:20,394 INFO L225 Difference]: With dead ends: 10381 [2025-03-08 19:37:20,394 INFO L226 Difference]: Without dead ends: 6810 [2025-03-08 19:37:20,413 INFO L434 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 [2025-03-08 19:37:20,414 INFO L435 NwaCegarLoop]: 3170 mSDtfsCounter, 2372 mSDsluCounter, 2453 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2372 SdHoareTripleChecker+Valid, 5623 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 19:37:20,414 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2372 Valid, 5623 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 19:37:20,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6810 states. [2025-03-08 19:37:20,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6810 to 6776. [2025-03-08 19:37:20,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6776 states, 5158 states have (on average 1.4055835595191934) internal successors, (7250), 5205 states have internal predecessors, (7250), 1359 states have call successors, (1359), 264 states have call predecessors, (1359), 258 states have return successors, (1388), 1314 states have call predecessors, (1388), 1346 states have call successors, (1388) [2025-03-08 19:37:20,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6776 states to 6776 states and 9997 transitions. [2025-03-08 19:37:20,713 INFO L78 Accepts]: Start accepts. Automaton has 6776 states and 9997 transitions. Word has length 176 [2025-03-08 19:37:20,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:37:20,715 INFO L471 AbstractCegarLoop]: Abstraction has 6776 states and 9997 transitions. [2025-03-08 19:37:20,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 19:37:20,716 INFO L276 IsEmpty]: Start isEmpty. Operand 6776 states and 9997 transitions. [2025-03-08 19:37:20,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-03-08 19:37:20,717 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:37:20,718 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 19:37:20,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 19:37:20,718 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:37:20,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:37:20,718 INFO L85 PathProgramCache]: Analyzing trace with hash 461903786, now seen corresponding path program 1 times [2025-03-08 19:37:20,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:37:20,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739922960] [2025-03-08 19:37:20,718 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:37:20,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:37:21,130 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-03-08 19:37:21,163 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-03-08 19:37:21,163 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:37:21,163 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:37:21,282 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 297 trivial. 0 not checked. [2025-03-08 19:37:21,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:37:21,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739922960] [2025-03-08 19:37:21,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739922960] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:37:21,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:37:21,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 19:37:21,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118488818] [2025-03-08 19:37:21,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:37:21,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 19:37:21,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:37:21,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 19:37:21,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:37:21,284 INFO L87 Difference]: Start difference. First operand 6776 states and 9997 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 3 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 19:37:21,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:37:21,550 INFO L93 Difference]: Finished difference Result 6778 states and 9998 transitions. [2025-03-08 19:37:21,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 19:37:21,551 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 3 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 177 [2025-03-08 19:37:21,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:37:21,585 INFO L225 Difference]: With dead ends: 6778 [2025-03-08 19:37:21,585 INFO L226 Difference]: Without dead ends: 6746 [2025-03-08 19:37:21,592 INFO L434 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 [2025-03-08 19:37:21,592 INFO L435 NwaCegarLoop]: 2559 mSDtfsCounter, 2585 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2585 SdHoareTripleChecker+Valid, 2559 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 19:37:21,592 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2585 Valid, 2559 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 19:37:21,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6746 states. [2025-03-08 19:37:21,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6746 to 6746. [2025-03-08 19:37:21,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6746 states, 5138 states have (on average 1.405799922148696) internal successors, (7223), 5184 states have internal predecessors, (7223), 1353 states have call successors, (1353), 260 states have call predecessors, (1353), 254 states have return successors, (1383), 1309 states have call predecessors, (1383), 1341 states have call successors, (1383) [2025-03-08 19:37:21,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6746 states to 6746 states and 9959 transitions. [2025-03-08 19:37:21,873 INFO L78 Accepts]: Start accepts. Automaton has 6746 states and 9959 transitions. Word has length 177 [2025-03-08 19:37:21,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:37:21,875 INFO L471 AbstractCegarLoop]: Abstraction has 6746 states and 9959 transitions. [2025-03-08 19:37:21,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 3 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 19:37:21,875 INFO L276 IsEmpty]: Start isEmpty. Operand 6746 states and 9959 transitions. [2025-03-08 19:37:21,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2025-03-08 19:37:21,879 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:37:21,880 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 19:37:21,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 19:37:21,880 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:37:21,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:37:21,880 INFO L85 PathProgramCache]: Analyzing trace with hash -1163744599, now seen corresponding path program 1 times [2025-03-08 19:37:21,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:37:21,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855755056] [2025-03-08 19:37:21,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:37:21,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:37:22,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-03-08 19:37:22,172 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-03-08 19:37:22,176 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:37:22,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:37:22,365 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 297 trivial. 0 not checked. [2025-03-08 19:37:22,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:37:22,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855755056] [2025-03-08 19:37:22,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855755056] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:37:22,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:37:22,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 19:37:22,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121953841] [2025-03-08 19:37:22,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:37:22,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 19:37:22,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:37:22,372 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 19:37:22,372 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:37:22,373 INFO L87 Difference]: Start difference. First operand 6746 states and 9959 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-08 19:37:26,415 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 19:37:26,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:37:26,785 INFO L93 Difference]: Finished difference Result 10304 states and 15153 transitions. [2025-03-08 19:37:26,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 19:37:26,786 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 198 [2025-03-08 19:37:26,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:37:26,811 INFO L225 Difference]: With dead ends: 10304 [2025-03-08 19:37:26,812 INFO L226 Difference]: Without dead ends: 3596 [2025-03-08 19:37:26,839 INFO L434 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 [2025-03-08 19:37:26,842 INFO L435 NwaCegarLoop]: 2564 mSDtfsCounter, 8 mSDsluCounter, 2552 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 5116 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2025-03-08 19:37:26,842 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 5116 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 158 Invalid, 1 Unknown, 0 Unchecked, 4.3s Time] [2025-03-08 19:37:26,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3596 states. [2025-03-08 19:37:26,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3596 to 3587. [2025-03-08 19:37:26,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3587 states, 2716 states have (on average 1.3917525773195876) internal successors, (3780), 2737 states have internal predecessors, (3780), 720 states have call successors, (720), 154 states have call predecessors, (720), 150 states have return successors, (729), 699 states have call predecessors, (729), 708 states have call successors, (729) [2025-03-08 19:37:26,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3587 states to 3587 states and 5229 transitions. [2025-03-08 19:37:26,978 INFO L78 Accepts]: Start accepts. Automaton has 3587 states and 5229 transitions. Word has length 198 [2025-03-08 19:37:26,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:37:26,978 INFO L471 AbstractCegarLoop]: Abstraction has 3587 states and 5229 transitions. [2025-03-08 19:37:26,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-08 19:37:26,979 INFO L276 IsEmpty]: Start isEmpty. Operand 3587 states and 5229 transitions. [2025-03-08 19:37:26,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-03-08 19:37:26,983 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:37:26,983 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 19:37:26,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 19:37:26,983 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:37:26,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:37:26,984 INFO L85 PathProgramCache]: Analyzing trace with hash -639382336, now seen corresponding path program 1 times [2025-03-08 19:37:26,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:37:26,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825259147] [2025-03-08 19:37:26,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:37:26,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:37:27,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-03-08 19:37:27,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-03-08 19:37:27,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:37:27,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:37:27,491 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2025-03-08 19:37:27,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:37:27,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825259147] [2025-03-08 19:37:27,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825259147] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:37:27,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:37:27,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 19:37:27,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277126615] [2025-03-08 19:37:27,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:37:27,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 19:37:27,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:37:27,492 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 19:37:27,493 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:37:27,493 INFO L87 Difference]: Start difference. First operand 3587 states and 5229 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 3 states have call successors, (23), 3 states have call predecessors, (23), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-08 19:37:31,510 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 19:37:31,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:37:31,694 INFO L93 Difference]: Finished difference Result 3591 states and 5231 transitions. [2025-03-08 19:37:31,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 19:37:31,695 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 3 states have call successors, (23), 3 states have call predecessors, (23), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 204 [2025-03-08 19:37:31,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:37:31,707 INFO L225 Difference]: With dead ends: 3591 [2025-03-08 19:37:31,707 INFO L226 Difference]: Without dead ends: 3588 [2025-03-08 19:37:31,708 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:37:31,709 INFO L435 NwaCegarLoop]: 2580 mSDtfsCounter, 2370 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2370 SdHoareTripleChecker+Valid, 2856 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-03-08 19:37:31,709 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2370 Valid, 2856 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 81 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-03-08 19:37:31,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3588 states. [2025-03-08 19:37:31,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3588 to 3586. [2025-03-08 19:37:31,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3586 states, 2716 states have (on average 1.3910162002945508) internal successors, (3778), 2736 states have internal predecessors, (3778), 719 states have call successors, (719), 154 states have call predecessors, (719), 150 states have return successors, (729), 699 states have call predecessors, (729), 708 states have call successors, (729) [2025-03-08 19:37:31,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3586 states to 3586 states and 5226 transitions. [2025-03-08 19:37:31,817 INFO L78 Accepts]: Start accepts. Automaton has 3586 states and 5226 transitions. Word has length 204 [2025-03-08 19:37:31,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:37:31,817 INFO L471 AbstractCegarLoop]: Abstraction has 3586 states and 5226 transitions. [2025-03-08 19:37:31,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 3 states have call successors, (23), 3 states have call predecessors, (23), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-08 19:37:31,818 INFO L276 IsEmpty]: Start isEmpty. Operand 3586 states and 5226 transitions. [2025-03-08 19:37:31,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2025-03-08 19:37:31,824 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:37:31,824 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 19:37:31,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 19:37:31,825 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:37:31,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:37:31,825 INFO L85 PathProgramCache]: Analyzing trace with hash -200076386, now seen corresponding path program 1 times [2025-03-08 19:37:31,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:37:31,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309064457] [2025-03-08 19:37:31,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:37:31,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:37:32,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 266 statements into 1 equivalence classes. [2025-03-08 19:37:32,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 266 of 266 statements. [2025-03-08 19:37:32,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:37:32,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:37:32,329 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 297 trivial. 0 not checked. [2025-03-08 19:37:32,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:37:32,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309064457] [2025-03-08 19:37:32,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309064457] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:37:32,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:37:32,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 19:37:32,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951431012] [2025-03-08 19:37:32,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:37:32,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 19:37:32,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:37:32,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 19:37:32,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:37:32,331 INFO L87 Difference]: Start difference. First operand 3586 states and 5226 transitions. Second operand has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 3 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) [2025-03-08 19:37:36,363 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 19:37:36,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:37:36,697 INFO L93 Difference]: Finished difference Result 7279 states and 10593 transitions. [2025-03-08 19:37:36,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 19:37:36,698 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 3 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) Word has length 266 [2025-03-08 19:37:36,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:37:36,711 INFO L225 Difference]: With dead ends: 7279 [2025-03-08 19:37:36,711 INFO L226 Difference]: Without dead ends: 3766 [2025-03-08 19:37:36,721 INFO L434 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 [2025-03-08 19:37:36,722 INFO L435 NwaCegarLoop]: 2627 mSDtfsCounter, 184 mSDsluCounter, 2477 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 11 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 5104 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2025-03-08 19:37:36,722 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 5104 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 186 Invalid, 1 Unknown, 0 Unchecked, 4.3s Time] [2025-03-08 19:37:36,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3766 states. [2025-03-08 19:37:36,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3766 to 3738. [2025-03-08 19:37:36,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3738 states, 2846 states have (on average 1.38756148981026) internal successors, (3949), 2866 states have internal predecessors, (3949), 729 states have call successors, (729), 166 states have call predecessors, (729), 162 states have return successors, (739), 709 states have call predecessors, (739), 718 states have call successors, (739) [2025-03-08 19:37:36,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3738 states to 3738 states and 5417 transitions. [2025-03-08 19:37:36,837 INFO L78 Accepts]: Start accepts. Automaton has 3738 states and 5417 transitions. Word has length 266 [2025-03-08 19:37:36,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:37:36,839 INFO L471 AbstractCegarLoop]: Abstraction has 3738 states and 5417 transitions. [2025-03-08 19:37:36,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 3 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) [2025-03-08 19:37:36,840 INFO L276 IsEmpty]: Start isEmpty. Operand 3738 states and 5417 transitions. [2025-03-08 19:37:36,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2025-03-08 19:37:36,844 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:37:36,844 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 19:37:36,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 19:37:36,845 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:37:36,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:37:36,845 INFO L85 PathProgramCache]: Analyzing trace with hash 1614973269, now seen corresponding path program 1 times [2025-03-08 19:37:36,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:37:36,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609715109] [2025-03-08 19:37:36,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:37:36,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:37:37,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 279 statements into 1 equivalence classes. [2025-03-08 19:37:37,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 279 of 279 statements. [2025-03-08 19:37:37,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:37:37,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:37:37,445 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-08 19:37:37,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:37:37,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609715109] [2025-03-08 19:37:37,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609715109] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:37:37,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:37:37,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 19:37:37,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753573256] [2025-03-08 19:37:37,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:37:37,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 19:37:37,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:37:37,448 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 19:37:37,449 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 19:37:37,449 INFO L87 Difference]: Start difference. First operand 3738 states and 5417 transitions. Second operand has 5 states, 5 states have (on average 26.0) internal successors, (130), 5 states have internal predecessors, (130), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (26), 2 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-08 19:37:37,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:37:37,835 INFO L93 Difference]: Finished difference Result 7403 states and 10755 transitions. [2025-03-08 19:37:37,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 19:37:37,836 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.0) internal successors, (130), 5 states have internal predecessors, (130), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (26), 2 states have call predecessors, (26), 1 states have call successors, (26) Word has length 279 [2025-03-08 19:37:37,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:37:37,849 INFO L225 Difference]: With dead ends: 7403 [2025-03-08 19:37:37,849 INFO L226 Difference]: Without dead ends: 3738 [2025-03-08 19:37:37,859 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 19:37:37,859 INFO L435 NwaCegarLoop]: 2553 mSDtfsCounter, 0 mSDsluCounter, 7653 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 10206 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 19:37:37,860 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 10206 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 325 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 19:37:37,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3738 states. [2025-03-08 19:37:38,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3738 to 3738. [2025-03-08 19:37:38,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3738 states, 2846 states have (on average 1.387210119465917) internal successors, (3948), 2866 states have internal predecessors, (3948), 729 states have call successors, (729), 166 states have call predecessors, (729), 162 states have return successors, (739), 709 states have call predecessors, (739), 718 states have call successors, (739) [2025-03-08 19:37:38,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3738 states to 3738 states and 5416 transitions. [2025-03-08 19:37:38,030 INFO L78 Accepts]: Start accepts. Automaton has 3738 states and 5416 transitions. Word has length 279 [2025-03-08 19:37:38,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:37:38,031 INFO L471 AbstractCegarLoop]: Abstraction has 3738 states and 5416 transitions. [2025-03-08 19:37:38,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.0) internal successors, (130), 5 states have internal predecessors, (130), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (26), 2 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-08 19:37:38,031 INFO L276 IsEmpty]: Start isEmpty. Operand 3738 states and 5416 transitions. [2025-03-08 19:37:38,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2025-03-08 19:37:38,036 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:37:38,036 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 19:37:38,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 19:37:38,036 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:37:38,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:37:38,037 INFO L85 PathProgramCache]: Analyzing trace with hash -1719408159, now seen corresponding path program 1 times [2025-03-08 19:37:38,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:37:38,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047117134] [2025-03-08 19:37:38,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:37:38,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:37:38,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 297 statements into 1 equivalence classes. [2025-03-08 19:37:38,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 297 of 297 statements. [2025-03-08 19:37:38,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:37:38,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:37:38,637 INFO L134 CoverageAnalysis]: Checked inductivity of 309 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 309 trivial. 0 not checked. [2025-03-08 19:37:38,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:37:38,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047117134] [2025-03-08 19:37:38,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047117134] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:37:38,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:37:38,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 19:37:38,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021618535] [2025-03-08 19:37:38,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:37:38,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 19:37:38,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:37:38,638 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 19:37:38,638 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:37:38,639 INFO L87 Difference]: Start difference. First operand 3738 states and 5416 transitions. Second operand has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 3 states have call successors, (29), 3 states have call predecessors, (29), 2 states have return successors, (26), 2 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-08 19:37:42,660 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 19:37:43,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:37:43,127 INFO L93 Difference]: Finished difference Result 7405 states and 10750 transitions. [2025-03-08 19:37:43,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 19:37:43,128 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 3 states have call successors, (29), 3 states have call predecessors, (29), 2 states have return successors, (26), 2 states have call predecessors, (26), 1 states have call successors, (26) Word has length 297 [2025-03-08 19:37:43,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:37:43,145 INFO L225 Difference]: With dead ends: 7405 [2025-03-08 19:37:43,145 INFO L226 Difference]: Without dead ends: 3740 [2025-03-08 19:37:43,156 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:37:43,157 INFO L435 NwaCegarLoop]: 3755 mSDtfsCounter, 2513 mSDsluCounter, 2311 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2513 SdHoareTripleChecker+Valid, 6066 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2025-03-08 19:37:43,157 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2513 Valid, 6066 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 178 Invalid, 1 Unknown, 0 Unchecked, 4.3s Time] [2025-03-08 19:37:43,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3740 states. [2025-03-08 19:37:43,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3740 to 3738. [2025-03-08 19:37:43,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3738 states, 2846 states have (on average 1.3858046380885454) internal successors, (3944), 2866 states have internal predecessors, (3944), 729 states have call successors, (729), 166 states have call predecessors, (729), 162 states have return successors, (719), 709 states have call predecessors, (719), 709 states have call successors, (719) [2025-03-08 19:37:43,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3738 states to 3738 states and 5392 transitions. [2025-03-08 19:37:43,314 INFO L78 Accepts]: Start accepts. Automaton has 3738 states and 5392 transitions. Word has length 297 [2025-03-08 19:37:43,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:37:43,315 INFO L471 AbstractCegarLoop]: Abstraction has 3738 states and 5392 transitions. [2025-03-08 19:37:43,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 3 states have call successors, (29), 3 states have call predecessors, (29), 2 states have return successors, (26), 2 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-08 19:37:43,315 INFO L276 IsEmpty]: Start isEmpty. Operand 3738 states and 5392 transitions. [2025-03-08 19:37:43,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2025-03-08 19:37:43,320 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:37:43,321 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 19:37:43,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 19:37:43,321 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:37:43,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:37:43,321 INFO L85 PathProgramCache]: Analyzing trace with hash -299633980, now seen corresponding path program 1 times [2025-03-08 19:37:43,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:37:43,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546175665] [2025-03-08 19:37:43,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:37:43,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:37:43,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 297 statements into 1 equivalence classes. [2025-03-08 19:37:43,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 297 of 297 statements. [2025-03-08 19:37:43,667 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:37:43,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:37:43,977 INFO L134 CoverageAnalysis]: Checked inductivity of 309 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 309 trivial. 0 not checked. [2025-03-08 19:37:43,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:37:43,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546175665] [2025-03-08 19:37:43,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546175665] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:37:43,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:37:43,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 19:37:43,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269079217] [2025-03-08 19:37:43,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:37:43,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 19:37:43,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:37:43,979 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 19:37:43,979 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:37:43,980 INFO L87 Difference]: Start difference. First operand 3738 states and 5392 transitions. Second operand has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-08 19:37:44,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:37:44,346 INFO L93 Difference]: Finished difference Result 7441 states and 10749 transitions. [2025-03-08 19:37:44,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 19:37:44,347 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 297 [2025-03-08 19:37:44,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:37:44,364 INFO L225 Difference]: With dead ends: 7441 [2025-03-08 19:37:44,364 INFO L226 Difference]: Without dead ends: 3776 [2025-03-08 19:37:44,374 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:37:44,375 INFO L435 NwaCegarLoop]: 2533 mSDtfsCounter, 8 mSDsluCounter, 2514 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 5047 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 19:37:44,375 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 5047 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 19:37:44,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3776 states. [2025-03-08 19:37:44,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3776 to 3776. [2025-03-08 19:37:44,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3776 states, 2884 states have (on average 1.3800277392510403) internal successors, (3980), 2904 states have internal predecessors, (3980), 729 states have call successors, (729), 166 states have call predecessors, (729), 162 states have return successors, (719), 709 states have call predecessors, (719), 709 states have call successors, (719) [2025-03-08 19:37:44,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3776 states to 3776 states and 5428 transitions. [2025-03-08 19:37:44,518 INFO L78 Accepts]: Start accepts. Automaton has 3776 states and 5428 transitions. Word has length 297 [2025-03-08 19:37:44,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:37:44,518 INFO L471 AbstractCegarLoop]: Abstraction has 3776 states and 5428 transitions. [2025-03-08 19:37:44,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-08 19:37:44,519 INFO L276 IsEmpty]: Start isEmpty. Operand 3776 states and 5428 transitions. [2025-03-08 19:37:44,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2025-03-08 19:37:44,523 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:37:44,523 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 19:37:44,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 19:37:44,524 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:37:44,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:37:44,524 INFO L85 PathProgramCache]: Analyzing trace with hash 2037675095, now seen corresponding path program 1 times [2025-03-08 19:37:44,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:37:44,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417606849] [2025-03-08 19:37:44,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:37:44,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:37:44,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 279 statements into 1 equivalence classes. [2025-03-08 19:37:44,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 279 of 279 statements. [2025-03-08 19:37:44,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:37:44,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:37:45,120 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 306 trivial. 0 not checked. [2025-03-08 19:37:45,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:37:45,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417606849] [2025-03-08 19:37:45,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417606849] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:37:45,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:37:45,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 19:37:45,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549586766] [2025-03-08 19:37:45,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:37:45,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 19:37:45,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:37:45,122 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 19:37:45,122 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 19:37:45,122 INFO L87 Difference]: Start difference. First operand 3776 states and 5428 transitions. Second operand has 5 states, 5 states have (on average 26.4) internal successors, (132), 5 states have internal predecessors, (132), 3 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) [2025-03-08 19:37:49,139 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 19:37:49,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:37:49,564 INFO L93 Difference]: Finished difference Result 7448 states and 10726 transitions. [2025-03-08 19:37:49,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 19:37:49,565 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.4) internal successors, (132), 5 states have internal predecessors, (132), 3 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) Word has length 279 [2025-03-08 19:37:49,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:37:49,586 INFO L225 Difference]: With dead ends: 7448 [2025-03-08 19:37:49,586 INFO L226 Difference]: Without dead ends: 3711 [2025-03-08 19:37:49,595 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 19:37:49,596 INFO L435 NwaCegarLoop]: 2557 mSDtfsCounter, 9 mSDsluCounter, 7650 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 10207 SdHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 330 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2025-03-08 19:37:49,596 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 10207 Invalid, 333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 330 Invalid, 1 Unknown, 0 Unchecked, 4.3s Time] [2025-03-08 19:37:49,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3711 states. [2025-03-08 19:37:49,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3711 to 3695. [2025-03-08 19:37:49,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3695 states, 2834 states have (on average 1.3842625264643613) internal successors, (3923), 2854 states have internal predecessors, (3923), 710 states have call successors, (710), 154 states have call predecessors, (710), 150 states have return successors, (700), 690 states have call predecessors, (700), 690 states have call successors, (700) [2025-03-08 19:37:49,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3695 states to 3695 states and 5333 transitions. [2025-03-08 19:37:49,757 INFO L78 Accepts]: Start accepts. Automaton has 3695 states and 5333 transitions. Word has length 279 [2025-03-08 19:37:49,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:37:49,758 INFO L471 AbstractCegarLoop]: Abstraction has 3695 states and 5333 transitions. [2025-03-08 19:37:49,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.4) internal successors, (132), 5 states have internal predecessors, (132), 3 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) [2025-03-08 19:37:49,758 INFO L276 IsEmpty]: Start isEmpty. Operand 3695 states and 5333 transitions. [2025-03-08 19:37:49,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2025-03-08 19:37:49,765 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:37:49,765 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 19:37:49,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 19:37:49,766 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:37:49,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:37:49,766 INFO L85 PathProgramCache]: Analyzing trace with hash -2033126557, now seen corresponding path program 1 times [2025-03-08 19:37:49,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:37:49,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909415755] [2025-03-08 19:37:49,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:37:49,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:37:50,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 311 statements into 1 equivalence classes. [2025-03-08 19:37:50,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 311 of 311 statements. [2025-03-08 19:37:50,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:37:50,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:37:50,382 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 318 trivial. 0 not checked. [2025-03-08 19:37:50,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:37:50,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909415755] [2025-03-08 19:37:50,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909415755] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:37:50,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:37:50,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 19:37:50,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94034093] [2025-03-08 19:37:50,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:37:50,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 19:37:50,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:37:50,384 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 19:37:50,385 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 19:37:50,386 INFO L87 Difference]: Start difference. First operand 3695 states and 5333 transitions. Second operand has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (28), 2 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-08 19:37:50,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:37:50,922 INFO L93 Difference]: Finished difference Result 7318 states and 10580 transitions. [2025-03-08 19:37:50,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 19:37:50,922 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (28), 2 states have call predecessors, (28), 1 states have call successors, (28) Word has length 311 [2025-03-08 19:37:50,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:37:50,939 INFO L225 Difference]: With dead ends: 7318 [2025-03-08 19:37:50,940 INFO L226 Difference]: Without dead ends: 3700 [2025-03-08 19:37:50,951 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 19:37:50,952 INFO L435 NwaCegarLoop]: 2558 mSDtfsCounter, 0 mSDsluCounter, 10213 mSDsCounter, 0 mSdLazyCounter, 414 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 12771 SdHoareTripleChecker+Invalid, 414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 19:37:50,952 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 12771 Invalid, 414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 414 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 19:37:50,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3700 states. [2025-03-08 19:37:51,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3700 to 3700. [2025-03-08 19:37:51,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3700 states, 2838 states have (on average 1.3837209302325582) internal successors, (3927), 2858 states have internal predecessors, (3927), 710 states have call successors, (710), 154 states have call predecessors, (710), 151 states have return successors, (703), 691 states have call predecessors, (703), 690 states have call successors, (703) [2025-03-08 19:37:51,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3700 states to 3700 states and 5340 transitions. [2025-03-08 19:37:51,147 INFO L78 Accepts]: Start accepts. Automaton has 3700 states and 5340 transitions. Word has length 311 [2025-03-08 19:37:51,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:37:51,149 INFO L471 AbstractCegarLoop]: Abstraction has 3700 states and 5340 transitions. [2025-03-08 19:37:51,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (28), 2 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-08 19:37:51,149 INFO L276 IsEmpty]: Start isEmpty. Operand 3700 states and 5340 transitions. [2025-03-08 19:37:51,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2025-03-08 19:37:51,153 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:37:51,154 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 19:37:51,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 19:37:51,154 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:37:51,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:37:51,155 INFO L85 PathProgramCache]: Analyzing trace with hash -528439308, now seen corresponding path program 1 times [2025-03-08 19:37:51,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:37:51,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796476734] [2025-03-08 19:37:51,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:37:51,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:37:51,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 293 statements into 1 equivalence classes. [2025-03-08 19:37:51,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 293 of 293 statements. [2025-03-08 19:37:51,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:37:51,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:37:51,870 INFO L134 CoverageAnalysis]: Checked inductivity of 321 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 321 trivial. 0 not checked. [2025-03-08 19:37:51,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:37:51,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796476734] [2025-03-08 19:37:51,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796476734] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:37:51,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:37:51,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 19:37:51,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584386879] [2025-03-08 19:37:51,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:37:51,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 19:37:51,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:37:51,872 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 19:37:51,872 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 19:37:51,872 INFO L87 Difference]: Start difference. First operand 3700 states and 5340 transitions. Second operand has 5 states, 5 states have (on average 27.2) internal successors, (136), 5 states have internal predecessors, (136), 2 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (28), 2 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-08 19:37:52,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:37:52,275 INFO L93 Difference]: Finished difference Result 7323 states and 10589 transitions. [2025-03-08 19:37:52,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 19:37:52,275 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.2) internal successors, (136), 5 states have internal predecessors, (136), 2 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (28), 2 states have call predecessors, (28), 1 states have call successors, (28) Word has length 293 [2025-03-08 19:37:52,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:37:52,294 INFO L225 Difference]: With dead ends: 7323 [2025-03-08 19:37:52,294 INFO L226 Difference]: Without dead ends: 3700 [2025-03-08 19:37:52,303 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 19:37:52,305 INFO L435 NwaCegarLoop]: 2553 mSDtfsCounter, 0 mSDsluCounter, 7649 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 10202 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 19:37:52,305 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 10202 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 19:37:52,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3700 states. [2025-03-08 19:37:52,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3700 to 3700. [2025-03-08 19:37:52,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3700 states, 2838 states have (on average 1.383368569415081) internal successors, (3926), 2858 states have internal predecessors, (3926), 710 states have call successors, (710), 154 states have call predecessors, (710), 151 states have return successors, (703), 691 states have call predecessors, (703), 690 states have call successors, (703) [2025-03-08 19:37:52,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3700 states to 3700 states and 5339 transitions. [2025-03-08 19:37:52,426 INFO L78 Accepts]: Start accepts. Automaton has 3700 states and 5339 transitions. Word has length 293 [2025-03-08 19:37:52,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:37:52,427 INFO L471 AbstractCegarLoop]: Abstraction has 3700 states and 5339 transitions. [2025-03-08 19:37:52,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.2) internal successors, (136), 5 states have internal predecessors, (136), 2 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (28), 2 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-08 19:37:52,428 INFO L276 IsEmpty]: Start isEmpty. Operand 3700 states and 5339 transitions. [2025-03-08 19:37:52,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2025-03-08 19:37:52,432 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:37:52,433 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 19:37:52,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 19:37:52,433 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:37:52,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:37:52,433 INFO L85 PathProgramCache]: Analyzing trace with hash 1911670546, now seen corresponding path program 1 times [2025-03-08 19:37:52,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:37:52,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777238745] [2025-03-08 19:37:52,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:37:52,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:37:52,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 319 statements into 1 equivalence classes. [2025-03-08 19:37:52,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 319 of 319 statements. [2025-03-08 19:37:52,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:37:52,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:37:53,014 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 318 trivial. 0 not checked. [2025-03-08 19:37:53,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:37:53,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777238745] [2025-03-08 19:37:53,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777238745] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:37:53,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:37:53,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 19:37:53,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125804718] [2025-03-08 19:37:53,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:37:53,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 19:37:53,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:37:53,016 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 19:37:53,016 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 19:37:53,016 INFO L87 Difference]: Start difference. First operand 3700 states and 5339 transitions. Second operand has 6 states, 6 states have (on average 26.833333333333332) internal successors, (161), 6 states have internal predecessors, (161), 4 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (30), 4 states have call predecessors, (30), 3 states have call successors, (30) [2025-03-08 19:37:53,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:37:53,526 INFO L93 Difference]: Finished difference Result 8166 states and 11937 transitions. [2025-03-08 19:37:53,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 19:37:53,526 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.833333333333332) internal successors, (161), 6 states have internal predecessors, (161), 4 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (30), 4 states have call predecessors, (30), 3 states have call successors, (30) Word has length 319 [2025-03-08 19:37:53,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:37:53,548 INFO L225 Difference]: With dead ends: 8166 [2025-03-08 19:37:53,548 INFO L226 Difference]: Without dead ends: 4543 [2025-03-08 19:37:53,558 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 19:37:53,559 INFO L435 NwaCegarLoop]: 2553 mSDtfsCounter, 588 mSDsluCounter, 10189 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 720 SdHoareTripleChecker+Valid, 12742 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 19:37:53,559 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [720 Valid, 12742 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 425 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 19:37:53,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4543 states. [2025-03-08 19:37:53,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4543 to 3723. [2025-03-08 19:37:53,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3723 states, 2857 states have (on average 1.3853692684634231) internal successors, (3958), 2879 states have internal predecessors, (3958), 713 states have call successors, (713), 154 states have call predecessors, (713), 152 states have return successors, (710), 693 states have call predecessors, (710), 693 states have call successors, (710) [2025-03-08 19:37:53,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3723 states to 3723 states and 5381 transitions. [2025-03-08 19:37:53,704 INFO L78 Accepts]: Start accepts. Automaton has 3723 states and 5381 transitions. Word has length 319 [2025-03-08 19:37:53,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:37:53,705 INFO L471 AbstractCegarLoop]: Abstraction has 3723 states and 5381 transitions. [2025-03-08 19:37:53,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.833333333333332) internal successors, (161), 6 states have internal predecessors, (161), 4 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (30), 4 states have call predecessors, (30), 3 states have call successors, (30) [2025-03-08 19:37:53,705 INFO L276 IsEmpty]: Start isEmpty. Operand 3723 states and 5381 transitions. [2025-03-08 19:37:53,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2025-03-08 19:37:53,709 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:37:53,709 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 19:37:53,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 19:37:53,710 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:37:53,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:37:53,711 INFO L85 PathProgramCache]: Analyzing trace with hash -1296563441, now seen corresponding path program 1 times [2025-03-08 19:37:53,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:37:53,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776086645] [2025-03-08 19:37:53,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:37:53,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:37:54,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 302 statements into 1 equivalence classes. [2025-03-08 19:37:54,078 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 302 of 302 statements. [2025-03-08 19:37:54,078 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:37:54,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:37:54,296 INFO L134 CoverageAnalysis]: Checked inductivity of 321 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 321 trivial. 0 not checked. [2025-03-08 19:37:54,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:37:54,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776086645] [2025-03-08 19:37:54,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776086645] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:37:54,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:37:54,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 19:37:54,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467237885] [2025-03-08 19:37:54,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:37:54,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 19:37:54,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:37:54,299 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 19:37:54,299 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 19:37:54,299 INFO L87 Difference]: Start difference. First operand 3723 states and 5381 transitions. Second operand has 6 states, 6 states have (on average 23.5) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (30), 2 states have call predecessors, (30), 1 states have call successors, (30) [2025-03-08 19:37:54,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:37:54,749 INFO L93 Difference]: Finished difference Result 7385 states and 10692 transitions. [2025-03-08 19:37:54,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 19:37:54,749 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 23.5) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (30), 2 states have call predecessors, (30), 1 states have call successors, (30) Word has length 302 [2025-03-08 19:37:54,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:37:54,768 INFO L225 Difference]: With dead ends: 7385 [2025-03-08 19:37:54,768 INFO L226 Difference]: Without dead ends: 3739 [2025-03-08 19:37:54,778 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 19:37:54,778 INFO L435 NwaCegarLoop]: 2559 mSDtfsCounter, 1 mSDsluCounter, 10216 mSDsCounter, 0 mSdLazyCounter, 417 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 12775 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 19:37:54,778 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 12775 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 417 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 19:37:54,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3739 states. [2025-03-08 19:37:54,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3739 to 3731. [2025-03-08 19:37:54,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3731 states, 2863 states have (on average 1.3845616486203283) internal successors, (3964), 2886 states have internal predecessors, (3964), 713 states have call successors, (713), 154 states have call predecessors, (713), 154 states have return successors, (716), 694 states have call predecessors, (716), 693 states have call successors, (716) [2025-03-08 19:37:54,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3731 states to 3731 states and 5393 transitions. [2025-03-08 19:37:54,901 INFO L78 Accepts]: Start accepts. Automaton has 3731 states and 5393 transitions. Word has length 302 [2025-03-08 19:37:54,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:37:54,902 INFO L471 AbstractCegarLoop]: Abstraction has 3731 states and 5393 transitions. [2025-03-08 19:37:54,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.5) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (30), 2 states have call predecessors, (30), 1 states have call successors, (30) [2025-03-08 19:37:54,902 INFO L276 IsEmpty]: Start isEmpty. Operand 3731 states and 5393 transitions. [2025-03-08 19:37:54,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2025-03-08 19:37:54,907 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:37:54,907 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 19:37:54,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 19:37:54,908 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:37:54,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:37:54,909 INFO L85 PathProgramCache]: Analyzing trace with hash -1807280288, now seen corresponding path program 1 times [2025-03-08 19:37:54,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:37:54,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806193981] [2025-03-08 19:37:54,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:37:54,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:37:55,277 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 320 statements into 1 equivalence classes. [2025-03-08 19:37:55,316 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 320 of 320 statements. [2025-03-08 19:37:55,317 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:37:55,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:37:55,657 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 318 trivial. 0 not checked. [2025-03-08 19:37:55,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:37:55,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806193981] [2025-03-08 19:37:55,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806193981] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:37:55,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:37:55,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 19:37:55,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667837587] [2025-03-08 19:37:55,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:37:55,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 19:37:55,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:37:55,659 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 19:37:55,659 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 19:37:55,659 INFO L87 Difference]: Start difference. First operand 3731 states and 5393 transitions. Second operand has 6 states, 6 states have (on average 27.0) internal successors, (162), 5 states have internal predecessors, (162), 2 states have call successors, (33), 2 states have call predecessors, (33), 3 states have return successors, (30), 3 states have call predecessors, (30), 1 states have call successors, (30) [2025-03-08 19:37:56,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:37:56,121 INFO L93 Difference]: Finished difference Result 7122 states and 10280 transitions. [2025-03-08 19:37:56,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 19:37:56,121 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 27.0) internal successors, (162), 5 states have internal predecessors, (162), 2 states have call successors, (33), 2 states have call predecessors, (33), 3 states have return successors, (30), 3 states have call predecessors, (30), 1 states have call successors, (30) Word has length 320 [2025-03-08 19:37:56,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:37:56,143 INFO L225 Difference]: With dead ends: 7122 [2025-03-08 19:37:56,143 INFO L226 Difference]: Without dead ends: 3468 [2025-03-08 19:37:56,154 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 19:37:56,157 INFO L435 NwaCegarLoop]: 2551 mSDtfsCounter, 0 mSDsluCounter, 10198 mSDsCounter, 0 mSdLazyCounter, 405 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 12749 SdHoareTripleChecker+Invalid, 405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 19:37:56,158 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 12749 Invalid, 405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 405 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 19:37:56,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3468 states. [2025-03-08 19:37:56,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3468 to 3468. [2025-03-08 19:37:56,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3468 states, 2659 states have (on average 1.3772094772470853) internal successors, (3662), 2681 states have internal predecessors, (3662), 658 states have call successors, (658), 151 states have call predecessors, (658), 150 states have return successors, (657), 639 states have call predecessors, (657), 638 states have call successors, (657) [2025-03-08 19:37:56,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3468 states to 3468 states and 4977 transitions. [2025-03-08 19:37:56,275 INFO L78 Accepts]: Start accepts. Automaton has 3468 states and 4977 transitions. Word has length 320 [2025-03-08 19:37:56,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:37:56,276 INFO L471 AbstractCegarLoop]: Abstraction has 3468 states and 4977 transitions. [2025-03-08 19:37:56,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.0) internal successors, (162), 5 states have internal predecessors, (162), 2 states have call successors, (33), 2 states have call predecessors, (33), 3 states have return successors, (30), 3 states have call predecessors, (30), 1 states have call successors, (30) [2025-03-08 19:37:56,276 INFO L276 IsEmpty]: Start isEmpty. Operand 3468 states and 4977 transitions. [2025-03-08 19:37:56,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2025-03-08 19:37:56,280 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:37:56,281 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 19:37:56,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 19:37:56,281 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:37:56,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:37:56,282 INFO L85 PathProgramCache]: Analyzing trace with hash -398842583, now seen corresponding path program 1 times [2025-03-08 19:37:56,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:37:56,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517145905] [2025-03-08 19:37:56,282 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:37:56,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:37:56,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 314 statements into 1 equivalence classes. [2025-03-08 19:37:56,636 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 314 of 314 statements. [2025-03-08 19:37:56,636 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:37:56,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:37:56,867 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2025-03-08 19:37:56,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:37:56,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517145905] [2025-03-08 19:37:56,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517145905] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:37:56,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:37:56,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 19:37:56,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252718902] [2025-03-08 19:37:56,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:37:56,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 19:37:56,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:37:56,870 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 19:37:56,870 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 19:37:56,870 INFO L87 Difference]: Start difference. First operand 3468 states and 4977 transitions. Second operand has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (31), 3 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-08 19:37:57,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:37:57,276 INFO L93 Difference]: Finished difference Result 6861 states and 9861 transitions. [2025-03-08 19:37:57,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 19:37:57,276 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (31), 3 states have call predecessors, (31), 2 states have call successors, (31) Word has length 314 [2025-03-08 19:37:57,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:37:57,296 INFO L225 Difference]: With dead ends: 6861 [2025-03-08 19:37:57,296 INFO L226 Difference]: Without dead ends: 3470 [2025-03-08 19:37:57,305 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 19:37:57,306 INFO L435 NwaCegarLoop]: 2558 mSDtfsCounter, 0 mSDsluCounter, 10215 mSDsCounter, 0 mSdLazyCounter, 412 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 12773 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 19:37:57,306 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 12773 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 412 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 19:37:57,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3470 states. [2025-03-08 19:37:57,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3470 to 3470. [2025-03-08 19:37:57,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3470 states, 2661 states have (on average 1.3769259676813228) internal successors, (3664), 2682 states have internal predecessors, (3664), 658 states have call successors, (658), 151 states have call predecessors, (658), 150 states have return successors, (657), 640 states have call predecessors, (657), 638 states have call successors, (657) [2025-03-08 19:37:57,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3470 states to 3470 states and 4979 transitions. [2025-03-08 19:37:57,432 INFO L78 Accepts]: Start accepts. Automaton has 3470 states and 4979 transitions. Word has length 314 [2025-03-08 19:37:57,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:37:57,432 INFO L471 AbstractCegarLoop]: Abstraction has 3470 states and 4979 transitions. [2025-03-08 19:37:57,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (31), 3 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-08 19:37:57,433 INFO L276 IsEmpty]: Start isEmpty. Operand 3470 states and 4979 transitions. [2025-03-08 19:37:57,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2025-03-08 19:37:57,438 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:37:57,438 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 19:37:57,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-08 19:37:57,438 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:37:57,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:37:57,439 INFO L85 PathProgramCache]: Analyzing trace with hash 640807135, now seen corresponding path program 1 times [2025-03-08 19:37:57,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:37:57,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885003099] [2025-03-08 19:37:57,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:37:57,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:37:57,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 315 statements into 1 equivalence classes. [2025-03-08 19:37:57,757 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 315 of 315 statements. [2025-03-08 19:37:57,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:37:57,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:37:58,020 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2025-03-08 19:37:58,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:37:58,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885003099] [2025-03-08 19:37:58,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885003099] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:37:58,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:37:58,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 19:37:58,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947545170] [2025-03-08 19:37:58,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:37:58,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 19:37:58,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:37:58,022 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 19:37:58,022 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 19:37:58,022 INFO L87 Difference]: Start difference. First operand 3470 states and 4979 transitions. Second operand has 6 states, 6 states have (on average 25.333333333333332) internal successors, (152), 5 states have internal predecessors, (152), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (31), 3 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-08 19:37:58,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:37:58,401 INFO L93 Difference]: Finished difference Result 4083 states and 5804 transitions. [2025-03-08 19:37:58,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 19:37:58,403 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.333333333333332) internal successors, (152), 5 states have internal predecessors, (152), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (31), 3 states have call predecessors, (31), 2 states have call successors, (31) Word has length 315 [2025-03-08 19:37:58,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:37:58,420 INFO L225 Difference]: With dead ends: 4083 [2025-03-08 19:37:58,421 INFO L226 Difference]: Without dead ends: 3472 [2025-03-08 19:37:58,424 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 19:37:58,426 INFO L435 NwaCegarLoop]: 2558 mSDtfsCounter, 0 mSDsluCounter, 10215 mSDsCounter, 0 mSdLazyCounter, 412 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 12773 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 19:37:58,429 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 12773 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 412 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 19:37:58,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3472 states. [2025-03-08 19:37:58,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3472 to 3472. [2025-03-08 19:37:58,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3472 states, 2663 states have (on average 1.3766428839654525) internal successors, (3666), 2683 states have internal predecessors, (3666), 658 states have call successors, (658), 151 states have call predecessors, (658), 150 states have return successors, (657), 641 states have call predecessors, (657), 638 states have call successors, (657) [2025-03-08 19:37:58,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3472 states to 3472 states and 4981 transitions. [2025-03-08 19:37:58,544 INFO L78 Accepts]: Start accepts. Automaton has 3472 states and 4981 transitions. Word has length 315 [2025-03-08 19:37:58,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:37:58,545 INFO L471 AbstractCegarLoop]: Abstraction has 3472 states and 4981 transitions. [2025-03-08 19:37:58,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.333333333333332) internal successors, (152), 5 states have internal predecessors, (152), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (31), 3 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-08 19:37:58,545 INFO L276 IsEmpty]: Start isEmpty. Operand 3472 states and 4981 transitions. [2025-03-08 19:37:58,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2025-03-08 19:37:58,549 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:37:58,550 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 19:37:58,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-08 19:37:58,550 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:37:58,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:37:58,550 INFO L85 PathProgramCache]: Analyzing trace with hash 2058272986, now seen corresponding path program 1 times [2025-03-08 19:37:58,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:37:58,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22696227] [2025-03-08 19:37:58,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:37:58,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:37:58,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 322 statements into 1 equivalence classes. [2025-03-08 19:37:58,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 322 of 322 statements. [2025-03-08 19:37:58,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:37:58,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:37:59,143 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2025-03-08 19:37:59,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:37:59,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22696227] [2025-03-08 19:37:59,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22696227] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:37:59,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:37:59,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 19:37:59,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883451740] [2025-03-08 19:37:59,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:37:59,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 19:37:59,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:37:59,145 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 19:37:59,145 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 19:37:59,146 INFO L87 Difference]: Start difference. First operand 3472 states and 4981 transitions. Second operand has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 6 states have internal predecessors, (155), 4 states have call successors, (35), 2 states have call predecessors, (35), 2 states have return successors, (33), 4 states have call predecessors, (33), 4 states have call successors, (33) [2025-03-08 19:37:59,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:37:59,704 INFO L93 Difference]: Finished difference Result 6909 states and 9934 transitions. [2025-03-08 19:37:59,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 19:37:59,705 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 6 states have internal predecessors, (155), 4 states have call successors, (35), 2 states have call predecessors, (35), 2 states have return successors, (33), 4 states have call predecessors, (33), 4 states have call successors, (33) Word has length 322 [2025-03-08 19:37:59,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:37:59,722 INFO L225 Difference]: With dead ends: 6909 [2025-03-08 19:37:59,723 INFO L226 Difference]: Without dead ends: 3514 [2025-03-08 19:37:59,731 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 19:37:59,731 INFO L435 NwaCegarLoop]: 2553 mSDtfsCounter, 19 mSDsluCounter, 10186 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 12739 SdHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 19:37:59,732 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 12739 Invalid, 428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 428 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 19:37:59,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3514 states. [2025-03-08 19:37:59,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3514 to 3481. [2025-03-08 19:37:59,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3481 states, 2669 states have (on average 1.3769201948295242) internal successors, (3675), 2690 states have internal predecessors, (3675), 661 states have call successors, (661), 151 states have call predecessors, (661), 150 states have return successors, (661), 643 states have call predecessors, (661), 641 states have call successors, (661) [2025-03-08 19:37:59,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3481 states to 3481 states and 4997 transitions. [2025-03-08 19:37:59,845 INFO L78 Accepts]: Start accepts. Automaton has 3481 states and 4997 transitions. Word has length 322 [2025-03-08 19:37:59,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:37:59,846 INFO L471 AbstractCegarLoop]: Abstraction has 3481 states and 4997 transitions. [2025-03-08 19:37:59,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 6 states have internal predecessors, (155), 4 states have call successors, (35), 2 states have call predecessors, (35), 2 states have return successors, (33), 4 states have call predecessors, (33), 4 states have call successors, (33) [2025-03-08 19:37:59,846 INFO L276 IsEmpty]: Start isEmpty. Operand 3481 states and 4997 transitions. [2025-03-08 19:37:59,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2025-03-08 19:37:59,851 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:37:59,851 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 19:37:59,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-08 19:37:59,852 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:37:59,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:37:59,852 INFO L85 PathProgramCache]: Analyzing trace with hash -1567769810, now seen corresponding path program 1 times [2025-03-08 19:37:59,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:37:59,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442666701] [2025-03-08 19:37:59,852 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:37:59,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:38:00,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 323 statements into 1 equivalence classes. [2025-03-08 19:38:00,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 323 of 323 statements. [2025-03-08 19:38:00,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:38:00,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:38:00,435 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2025-03-08 19:38:00,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:38:00,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442666701] [2025-03-08 19:38:00,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442666701] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:38:00,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:38:00,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 19:38:00,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712390421] [2025-03-08 19:38:00,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:38:00,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 19:38:00,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:38:00,436 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 19:38:00,436 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 19:38:00,436 INFO L87 Difference]: Start difference. First operand 3481 states and 4997 transitions. Second operand has 6 states, 6 states have (on average 26.0) internal successors, (156), 5 states have internal predecessors, (156), 2 states have call successors, (35), 2 states have call predecessors, (35), 2 states have return successors, (33), 3 states have call predecessors, (33), 2 states have call successors, (33) [2025-03-08 19:38:00,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:38:00,779 INFO L93 Difference]: Finished difference Result 6622 states and 9478 transitions. [2025-03-08 19:38:00,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 19:38:00,780 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.0) internal successors, (156), 5 states have internal predecessors, (156), 2 states have call successors, (35), 2 states have call predecessors, (35), 2 states have return successors, (33), 3 states have call predecessors, (33), 2 states have call successors, (33) Word has length 323 [2025-03-08 19:38:00,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:38:00,835 INFO L225 Difference]: With dead ends: 6622 [2025-03-08 19:38:00,835 INFO L226 Difference]: Without dead ends: 3218 [2025-03-08 19:38:00,840 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 19:38:00,841 INFO L435 NwaCegarLoop]: 2514 mSDtfsCounter, 0 mSDsluCounter, 10039 mSDsCounter, 0 mSdLazyCounter, 406 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 12553 SdHoareTripleChecker+Invalid, 407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 19:38:00,841 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 12553 Invalid, 407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 406 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 19:38:00,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3218 states. [2025-03-08 19:38:00,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3218 to 3216. [2025-03-08 19:38:00,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3216 states, 2455 states have (on average 1.364969450101833) internal successors, (3351), 2473 states have internal predecessors, (3351), 610 states have call successors, (610), 150 states have call predecessors, (610), 150 states have return successors, (612), 596 states have call predecessors, (612), 593 states have call successors, (612) [2025-03-08 19:38:00,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3216 states to 3216 states and 4573 transitions. [2025-03-08 19:38:01,008 INFO L78 Accepts]: Start accepts. Automaton has 3216 states and 4573 transitions. Word has length 323 [2025-03-08 19:38:01,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:38:01,009 INFO L471 AbstractCegarLoop]: Abstraction has 3216 states and 4573 transitions. [2025-03-08 19:38:01,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.0) internal successors, (156), 5 states have internal predecessors, (156), 2 states have call successors, (35), 2 states have call predecessors, (35), 2 states have return successors, (33), 3 states have call predecessors, (33), 2 states have call successors, (33) [2025-03-08 19:38:01,010 INFO L276 IsEmpty]: Start isEmpty. Operand 3216 states and 4573 transitions. [2025-03-08 19:38:01,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2025-03-08 19:38:01,015 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:38:01,015 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 19:38:01,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-08 19:38:01,016 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:38:01,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:38:01,016 INFO L85 PathProgramCache]: Analyzing trace with hash -1179694960, now seen corresponding path program 1 times [2025-03-08 19:38:01,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:38:01,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328242895] [2025-03-08 19:38:01,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:38:01,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:38:01,383 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 323 statements into 1 equivalence classes. [2025-03-08 19:38:01,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 323 of 323 statements. [2025-03-08 19:38:01,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:38:01,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:38:01,613 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2025-03-08 19:38:01,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:38:01,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328242895] [2025-03-08 19:38:01,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328242895] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:38:01,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:38:01,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 19:38:01,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618743197] [2025-03-08 19:38:01,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:38:01,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 19:38:01,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:38:01,615 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 19:38:01,615 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 19:38:01,615 INFO L87 Difference]: Start difference. First operand 3216 states and 4573 transitions. Second operand has 6 states, 6 states have (on average 26.0) internal successors, (156), 6 states have internal predecessors, (156), 4 states have call successors, (35), 2 states have call predecessors, (35), 2 states have return successors, (33), 4 states have call predecessors, (33), 4 states have call successors, (33) [2025-03-08 19:38:01,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:38:01,998 INFO L93 Difference]: Finished difference Result 6396 states and 9116 transitions. [2025-03-08 19:38:01,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 19:38:01,999 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.0) internal successors, (156), 6 states have internal predecessors, (156), 4 states have call successors, (35), 2 states have call predecessors, (35), 2 states have return successors, (33), 4 states have call predecessors, (33), 4 states have call successors, (33) Word has length 323 [2025-03-08 19:38:01,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:38:02,019 INFO L225 Difference]: With dead ends: 6396 [2025-03-08 19:38:02,019 INFO L226 Difference]: Without dead ends: 3257 [2025-03-08 19:38:02,027 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 19:38:02,027 INFO L435 NwaCegarLoop]: 2509 mSDtfsCounter, 20 mSDsluCounter, 10010 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 12519 SdHoareTripleChecker+Invalid, 423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 19:38:02,028 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 12519 Invalid, 423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 423 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 19:38:02,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3257 states. [2025-03-08 19:38:02,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3257 to 3225. [2025-03-08 19:38:02,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3225 states, 2461 states have (on average 1.365298659081674) internal successors, (3360), 2480 states have internal predecessors, (3360), 613 states have call successors, (613), 150 states have call predecessors, (613), 150 states have return successors, (616), 598 states have call predecessors, (616), 596 states have call successors, (616) [2025-03-08 19:38:02,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3225 states to 3225 states and 4589 transitions. [2025-03-08 19:38:02,133 INFO L78 Accepts]: Start accepts. Automaton has 3225 states and 4589 transitions. Word has length 323 [2025-03-08 19:38:02,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:38:02,133 INFO L471 AbstractCegarLoop]: Abstraction has 3225 states and 4589 transitions. [2025-03-08 19:38:02,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.0) internal successors, (156), 6 states have internal predecessors, (156), 4 states have call successors, (35), 2 states have call predecessors, (35), 2 states have return successors, (33), 4 states have call predecessors, (33), 4 states have call successors, (33) [2025-03-08 19:38:02,134 INFO L276 IsEmpty]: Start isEmpty. Operand 3225 states and 4589 transitions. [2025-03-08 19:38:02,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2025-03-08 19:38:02,138 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:38:02,138 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 19:38:02,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-08 19:38:02,138 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:38:02,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:38:02,138 INFO L85 PathProgramCache]: Analyzing trace with hash 1524041539, now seen corresponding path program 1 times [2025-03-08 19:38:02,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:38:02,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077955447] [2025-03-08 19:38:02,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:38:02,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:38:02,444 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 324 statements into 1 equivalence classes. [2025-03-08 19:38:02,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 324 of 324 statements. [2025-03-08 19:38:02,481 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:38:02,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:38:02,694 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2025-03-08 19:38:02,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:38:02,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077955447] [2025-03-08 19:38:02,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077955447] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:38:02,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:38:02,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 19:38:02,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662712509] [2025-03-08 19:38:02,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:38:02,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 19:38:02,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:38:02,697 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 19:38:02,697 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 19:38:02,697 INFO L87 Difference]: Start difference. First operand 3225 states and 4589 transitions. Second operand has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (35), 2 states have call predecessors, (35), 2 states have return successors, (33), 3 states have call predecessors, (33), 2 states have call successors, (33) [2025-03-08 19:38:03,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:38:03,060 INFO L93 Difference]: Finished difference Result 6072 states and 8651 transitions. [2025-03-08 19:38:03,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 19:38:03,061 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (35), 2 states have call predecessors, (35), 2 states have return successors, (33), 3 states have call predecessors, (33), 2 states have call successors, (33) Word has length 324 [2025-03-08 19:38:03,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:38:03,076 INFO L225 Difference]: With dead ends: 6072 [2025-03-08 19:38:03,077 INFO L226 Difference]: Without dead ends: 2924 [2025-03-08 19:38:03,084 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 19:38:03,085 INFO L435 NwaCegarLoop]: 2514 mSDtfsCounter, 0 mSDsluCounter, 10039 mSDsCounter, 0 mSdLazyCounter, 406 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 12553 SdHoareTripleChecker+Invalid, 407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 19:38:03,085 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 12553 Invalid, 407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 406 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 19:38:03,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2924 states. [2025-03-08 19:38:03,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2924 to 2922. [2025-03-08 19:38:03,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2922 states, 2234 states have (on average 1.3661593554162936) internal successors, (3052), 2252 states have internal predecessors, (3052), 549 states have call successors, (549), 138 states have call predecessors, (549), 138 states have return successors, (553), 535 states have call predecessors, (553), 533 states have call successors, (553) [2025-03-08 19:38:03,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2922 states to 2922 states and 4154 transitions. [2025-03-08 19:38:03,180 INFO L78 Accepts]: Start accepts. Automaton has 2922 states and 4154 transitions. Word has length 324 [2025-03-08 19:38:03,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:38:03,180 INFO L471 AbstractCegarLoop]: Abstraction has 2922 states and 4154 transitions. [2025-03-08 19:38:03,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (35), 2 states have call predecessors, (35), 2 states have return successors, (33), 3 states have call predecessors, (33), 2 states have call successors, (33) [2025-03-08 19:38:03,181 INFO L276 IsEmpty]: Start isEmpty. Operand 2922 states and 4154 transitions. [2025-03-08 19:38:03,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2025-03-08 19:38:03,186 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:38:03,186 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 19:38:03,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-08 19:38:03,186 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:38:03,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:38:03,187 INFO L85 PathProgramCache]: Analyzing trace with hash -1415380910, now seen corresponding path program 1 times [2025-03-08 19:38:03,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:38:03,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734735860] [2025-03-08 19:38:03,187 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:38:03,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:38:03,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 335 statements into 1 equivalence classes. [2025-03-08 19:38:03,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 335 of 335 statements. [2025-03-08 19:38:03,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:38:03,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:38:03,664 INFO L134 CoverageAnalysis]: Checked inductivity of 344 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 333 trivial. 0 not checked. [2025-03-08 19:38:03,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:38:03,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734735860] [2025-03-08 19:38:03,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734735860] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:38:03,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:38:03,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 19:38:03,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985035468] [2025-03-08 19:38:03,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:38:03,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 19:38:03,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:38:03,666 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 19:38:03,666 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 19:38:03,666 INFO L87 Difference]: Start difference. First operand 2922 states and 4154 transitions. Second operand has 6 states, 6 states have (on average 26.666666666666668) internal successors, (160), 5 states have internal predecessors, (160), 3 states have call successors, (37), 2 states have call predecessors, (37), 3 states have return successors, (36), 4 states have call predecessors, (36), 3 states have call successors, (36) [2025-03-08 19:38:03,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:38:03,992 INFO L93 Difference]: Finished difference Result 3725 states and 5251 transitions. [2025-03-08 19:38:03,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 19:38:03,993 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.666666666666668) internal successors, (160), 5 states have internal predecessors, (160), 3 states have call successors, (37), 2 states have call predecessors, (37), 3 states have return successors, (36), 4 states have call predecessors, (36), 3 states have call successors, (36) Word has length 335 [2025-03-08 19:38:03,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:38:04,007 INFO L225 Difference]: With dead ends: 3725 [2025-03-08 19:38:04,007 INFO L226 Difference]: Without dead ends: 2922 [2025-03-08 19:38:04,009 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 19:38:04,009 INFO L435 NwaCegarLoop]: 2507 mSDtfsCounter, 7 mSDsluCounter, 9998 mSDsCounter, 0 mSdLazyCounter, 406 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 12505 SdHoareTripleChecker+Invalid, 406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 19:38:04,010 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 12505 Invalid, 406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 406 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 19:38:04,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2922 states. [2025-03-08 19:38:04,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2922 to 2922. [2025-03-08 19:38:04,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2922 states, 2234 states have (on average 1.365711727842435) internal successors, (3051), 2252 states have internal predecessors, (3051), 549 states have call successors, (549), 138 states have call predecessors, (549), 138 states have return successors, (553), 535 states have call predecessors, (553), 533 states have call successors, (553) [2025-03-08 19:38:04,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2922 states to 2922 states and 4153 transitions. [2025-03-08 19:38:04,129 INFO L78 Accepts]: Start accepts. Automaton has 2922 states and 4153 transitions. Word has length 335 [2025-03-08 19:38:04,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:38:04,129 INFO L471 AbstractCegarLoop]: Abstraction has 2922 states and 4153 transitions. [2025-03-08 19:38:04,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.666666666666668) internal successors, (160), 5 states have internal predecessors, (160), 3 states have call successors, (37), 2 states have call predecessors, (37), 3 states have return successors, (36), 4 states have call predecessors, (36), 3 states have call successors, (36) [2025-03-08 19:38:04,129 INFO L276 IsEmpty]: Start isEmpty. Operand 2922 states and 4153 transitions. [2025-03-08 19:38:04,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2025-03-08 19:38:04,133 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:38:04,133 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 19:38:04,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-08 19:38:04,133 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:38:04,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:38:04,134 INFO L85 PathProgramCache]: Analyzing trace with hash 676078766, now seen corresponding path program 1 times [2025-03-08 19:38:04,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:38:04,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954168633] [2025-03-08 19:38:04,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:38:04,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:38:04,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 342 statements into 1 equivalence classes. [2025-03-08 19:38:04,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 342 of 342 statements. [2025-03-08 19:38:04,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:38:04,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:38:04,603 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2025-03-08 19:38:04,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:38:04,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954168633] [2025-03-08 19:38:04,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954168633] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:38:04,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:38:04,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 19:38:04,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895079779] [2025-03-08 19:38:04,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:38:04,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 19:38:04,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:38:04,605 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 19:38:04,605 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 19:38:04,605 INFO L87 Difference]: Start difference. First operand 2922 states and 4153 transitions. Second operand has 6 states, 6 states have (on average 28.666666666666668) internal successors, (172), 5 states have internal predecessors, (172), 3 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (35), 4 states have call predecessors, (35), 3 states have call successors, (35) [2025-03-08 19:38:04,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:38:04,878 INFO L93 Difference]: Finished difference Result 3725 states and 5248 transitions. [2025-03-08 19:38:04,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 19:38:04,879 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 28.666666666666668) internal successors, (172), 5 states have internal predecessors, (172), 3 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (35), 4 states have call predecessors, (35), 3 states have call successors, (35) Word has length 342 [2025-03-08 19:38:04,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:38:04,893 INFO L225 Difference]: With dead ends: 3725 [2025-03-08 19:38:04,893 INFO L226 Difference]: Without dead ends: 2922 [2025-03-08 19:38:04,895 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 19:38:04,895 INFO L435 NwaCegarLoop]: 2507 mSDtfsCounter, 7 mSDsluCounter, 10000 mSDsCounter, 0 mSdLazyCounter, 404 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 12507 SdHoareTripleChecker+Invalid, 404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 19:38:04,896 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 12507 Invalid, 404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 404 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 19:38:04,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2922 states. [2025-03-08 19:38:04,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2922 to 2922. [2025-03-08 19:38:04,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2922 states, 2234 states have (on average 1.3652641002685766) internal successors, (3050), 2252 states have internal predecessors, (3050), 549 states have call successors, (549), 138 states have call predecessors, (549), 138 states have return successors, (553), 535 states have call predecessors, (553), 533 states have call successors, (553) [2025-03-08 19:38:04,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2922 states to 2922 states and 4152 transitions. [2025-03-08 19:38:04,975 INFO L78 Accepts]: Start accepts. Automaton has 2922 states and 4152 transitions. Word has length 342 [2025-03-08 19:38:04,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:38:04,975 INFO L471 AbstractCegarLoop]: Abstraction has 2922 states and 4152 transitions. [2025-03-08 19:38:04,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.666666666666668) internal successors, (172), 5 states have internal predecessors, (172), 3 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (35), 4 states have call predecessors, (35), 3 states have call successors, (35) [2025-03-08 19:38:04,975 INFO L276 IsEmpty]: Start isEmpty. Operand 2922 states and 4152 transitions. [2025-03-08 19:38:04,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 344 [2025-03-08 19:38:04,979 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:38:04,979 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 19:38:04,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-08 19:38:04,980 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:38:04,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:38:04,980 INFO L85 PathProgramCache]: Analyzing trace with hash -623186905, now seen corresponding path program 1 times [2025-03-08 19:38:04,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:38:04,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156576422] [2025-03-08 19:38:04,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:38:04,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:38:05,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 343 statements into 1 equivalence classes. [2025-03-08 19:38:05,321 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 343 of 343 statements. [2025-03-08 19:38:05,321 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:38:05,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:38:05,494 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2025-03-08 19:38:05,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:38:05,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156576422] [2025-03-08 19:38:05,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156576422] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:38:05,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:38:05,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 19:38:05,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772332578] [2025-03-08 19:38:05,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:38:05,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 19:38:05,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:38:05,495 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 19:38:05,495 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 19:38:05,496 INFO L87 Difference]: Start difference. First operand 2922 states and 4152 transitions. Second operand has 6 states, 6 states have (on average 28.833333333333332) internal successors, (173), 5 states have internal predecessors, (173), 3 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (35), 4 states have call predecessors, (35), 3 states have call successors, (35) [2025-03-08 19:38:05,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:38:05,789 INFO L93 Difference]: Finished difference Result 3725 states and 5247 transitions. [2025-03-08 19:38:05,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 19:38:05,790 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 28.833333333333332) internal successors, (173), 5 states have internal predecessors, (173), 3 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (35), 4 states have call predecessors, (35), 3 states have call successors, (35) Word has length 343 [2025-03-08 19:38:05,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:38:05,802 INFO L225 Difference]: With dead ends: 3725 [2025-03-08 19:38:05,802 INFO L226 Difference]: Without dead ends: 2922 [2025-03-08 19:38:05,804 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 19:38:05,805 INFO L435 NwaCegarLoop]: 2507 mSDtfsCounter, 7 mSDsluCounter, 10000 mSDsCounter, 0 mSdLazyCounter, 404 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 12507 SdHoareTripleChecker+Invalid, 404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 19:38:05,805 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 12507 Invalid, 404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 404 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 19:38:05,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2922 states. [2025-03-08 19:38:05,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2922 to 2922. [2025-03-08 19:38:05,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2922 states, 2234 states have (on average 1.364816472694718) internal successors, (3049), 2252 states have internal predecessors, (3049), 549 states have call successors, (549), 138 states have call predecessors, (549), 138 states have return successors, (553), 535 states have call predecessors, (553), 533 states have call successors, (553) [2025-03-08 19:38:05,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2922 states to 2922 states and 4151 transitions. [2025-03-08 19:38:05,887 INFO L78 Accepts]: Start accepts. Automaton has 2922 states and 4151 transitions. Word has length 343 [2025-03-08 19:38:05,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:38:05,887 INFO L471 AbstractCegarLoop]: Abstraction has 2922 states and 4151 transitions. [2025-03-08 19:38:05,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.833333333333332) internal successors, (173), 5 states have internal predecessors, (173), 3 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (35), 4 states have call predecessors, (35), 3 states have call successors, (35) [2025-03-08 19:38:05,887 INFO L276 IsEmpty]: Start isEmpty. Operand 2922 states and 4151 transitions. [2025-03-08 19:38:05,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2025-03-08 19:38:05,891 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:38:05,891 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 19:38:05,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-08 19:38:05,891 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:38:05,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:38:05,892 INFO L85 PathProgramCache]: Analyzing trace with hash -318743833, now seen corresponding path program 1 times [2025-03-08 19:38:05,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:38:05,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34158126] [2025-03-08 19:38:05,892 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:38:05,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:38:06,146 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 352 statements into 1 equivalence classes. [2025-03-08 19:38:06,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 352 of 352 statements. [2025-03-08 19:38:06,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:38:06,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:38:06,392 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2025-03-08 19:38:06,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:38:06,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34158126] [2025-03-08 19:38:06,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34158126] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:38:06,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:38:06,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 19:38:06,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801790313] [2025-03-08 19:38:06,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:38:06,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 19:38:06,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:38:06,393 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 19:38:06,393 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 19:38:06,393 INFO L87 Difference]: Start difference. First operand 2922 states and 4151 transitions. Second operand has 6 states, 6 states have (on average 29.666666666666668) internal successors, (178), 5 states have internal predecessors, (178), 2 states have call successors, (38), 2 states have call predecessors, (38), 3 states have return successors, (37), 3 states have call predecessors, (37), 2 states have call successors, (37) [2025-03-08 19:38:06,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:38:06,632 INFO L93 Difference]: Finished difference Result 2998 states and 4226 transitions. [2025-03-08 19:38:06,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 19:38:06,632 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 29.666666666666668) internal successors, (178), 5 states have internal predecessors, (178), 2 states have call successors, (38), 2 states have call predecessors, (38), 3 states have return successors, (37), 3 states have call predecessors, (37), 2 states have call successors, (37) Word has length 352 [2025-03-08 19:38:06,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:38:06,642 INFO L225 Difference]: With dead ends: 2998 [2025-03-08 19:38:06,642 INFO L226 Difference]: Without dead ends: 2186 [2025-03-08 19:38:06,643 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 19:38:06,644 INFO L435 NwaCegarLoop]: 2450 mSDtfsCounter, 0 mSDsluCounter, 9787 mSDsCounter, 0 mSdLazyCounter, 403 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 12237 SdHoareTripleChecker+Invalid, 403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 19:38:06,644 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 12237 Invalid, 403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 403 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 19:38:06,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2186 states. [2025-03-08 19:38:06,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2186 to 2186. [2025-03-08 19:38:06,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2186 states, 1672 states have (on average 1.3714114832535884) internal successors, (2293), 1686 states have internal predecessors, (2293), 409 states have call successors, (409), 103 states have call predecessors, (409), 104 states have return successors, (415), 400 states have call predecessors, (415), 400 states have call successors, (415) [2025-03-08 19:38:06,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2186 states to 2186 states and 3117 transitions. [2025-03-08 19:38:06,700 INFO L78 Accepts]: Start accepts. Automaton has 2186 states and 3117 transitions. Word has length 352 [2025-03-08 19:38:06,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:38:06,700 INFO L471 AbstractCegarLoop]: Abstraction has 2186 states and 3117 transitions. [2025-03-08 19:38:06,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 29.666666666666668) internal successors, (178), 5 states have internal predecessors, (178), 2 states have call successors, (38), 2 states have call predecessors, (38), 3 states have return successors, (37), 3 states have call predecessors, (37), 2 states have call successors, (37) [2025-03-08 19:38:06,701 INFO L276 IsEmpty]: Start isEmpty. Operand 2186 states and 3117 transitions. [2025-03-08 19:38:06,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 375 [2025-03-08 19:38:06,704 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:38:06,704 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 19:38:06,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-08 19:38:06,705 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:38:06,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:38:06,705 INFO L85 PathProgramCache]: Analyzing trace with hash -209915782, now seen corresponding path program 1 times [2025-03-08 19:38:06,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:38:06,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485353363] [2025-03-08 19:38:06,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:38:06,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms