./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--input--serio--serio_raw.ko-entry_point.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 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--input--serio--serio_raw.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 93c428ff6f0565c9de954639ae23000ff5693477bac9f291339fc811e0689668 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 08:43:03,420 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 08:43:03,475 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-17 08:43:03,478 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 08:43:03,479 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 08:43:03,501 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 08:43:03,502 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 08:43:03,502 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 08:43:03,502 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 08:43:03,503 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 08:43:03,503 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 08:43:03,503 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 08:43:03,503 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 08:43:03,503 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 08:43:03,503 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 08:43:03,503 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 08:43:03,503 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 08:43:03,503 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 08:43:03,504 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 08:43:03,504 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 08:43:03,504 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 08:43:03,504 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 08:43:03,504 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 08:43:03,504 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 08:43:03,504 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 08:43:03,504 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 08:43:03,504 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 08:43:03,504 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 08:43:03,504 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 08:43:03,504 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 08:43:03,505 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 08:43:03,505 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 08:43:03,505 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 08:43:03,505 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 08:43:03,505 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 08:43:03,505 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 08:43:03,505 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 08:43:03,505 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 08:43:03,505 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 08:43:03,505 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 08:43:03,505 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 -> 93c428ff6f0565c9de954639ae23000ff5693477bac9f291339fc811e0689668 [2025-03-17 08:43:03,718 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 08:43:03,726 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 08:43:03,727 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 08:43:03,729 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 08:43:03,729 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 08:43:03,731 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--input--serio--serio_raw.ko-entry_point.cil.out.i [2025-03-17 08:43:04,880 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a46603e5/fe5e47aaf9264992baa4d1c50a7c7612/FLAGda713af74 [2025-03-17 08:43:05,406 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 08:43:05,408 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--input--serio--serio_raw.ko-entry_point.cil.out.i [2025-03-17 08:43:05,440 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a46603e5/fe5e47aaf9264992baa4d1c50a7c7612/FLAGda713af74 [2025-03-17 08:43:05,457 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a46603e5/fe5e47aaf9264992baa4d1c50a7c7612 [2025-03-17 08:43:05,459 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 08:43:05,460 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 08:43:05,462 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 08:43:05,462 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 08:43:05,465 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 08:43:05,467 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 08:43:05" (1/1) ... [2025-03-17 08:43:05,469 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50171432 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:43:05, skipping insertion in model container [2025-03-17 08:43:05,469 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 08:43:05" (1/1) ... [2025-03-17 08:43:05,538 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 08:43:06,202 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--input--serio--serio_raw.ko-entry_point.cil.out.i[129978,129991] [2025-03-17 08:43:06,351 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 08:43:06,369 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 08:43:06,435 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile (".pushsection .smp_locks,\"a\"\n.balign 4\n.long 671f - .\n.popsection\n671:\n\tlock; subl %2, %0; sete %1": "+m" (v->counter), "=qm" (c): "er" (i): "memory"); [3226-3227] [2025-03-17 08:43:06,439 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile (".pushsection .smp_locks,\"a\"\n.balign 4\n.long 671f - .\n.popsection\n671:\n\tlock; xaddb %b0, %1\n": "+q" (__ret), "+m" (v->counter): : "memory", "cc"); [3238-3239] [2025-03-17 08:43:06,440 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile (".pushsection .smp_locks,\"a\"\n.balign 4\n.long 671f - .\n.popsection\n671:\n\tlock; xaddw %w0, %1\n": "+r" (__ret), "+m" (v->counter): : "memory", "cc"); [3242-3243] [2025-03-17 08:43:06,440 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile (".pushsection .smp_locks,\"a\"\n.balign 4\n.long 671f - .\n.popsection\n671:\n\tlock; xaddl %0, %1\n": "+r" (__ret), "+m" (v->counter): : "memory", "cc"); [3246-3247] [2025-03-17 08:43:06,441 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile (".pushsection .smp_locks,\"a\"\n.balign 4\n.long 671f - .\n.popsection\n671:\n\tlock; xaddq %q0, %1\n": "+r" (__ret), "+m" (v->counter): : "memory", "cc"); [3250-3251] [2025-03-17 08:43:06,516 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_1": "=a" (__ret_pu): "0" (__pu_val), "c" (tmp): "ebx"); [3767] [2025-03-17 08:43:06,517 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_2": "=a" (__ret_pu): "0" (__pu_val), "c" (tmp___0): "ebx"); [3772] [2025-03-17 08:43:06,517 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_4": "=a" (__ret_pu): "0" (__pu_val), "c" (tmp___1): "ebx"); [3777] [2025-03-17 08:43:06,517 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_8": "=a" (__ret_pu): "0" (__pu_val), "c" (tmp___2): "ebx"); [3782] [2025-03-17 08:43:06,517 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_X": "=a" (__ret_pu): "0" (__pu_val), "c" (tmp___3): "ebx"); [3787] [2025-03-17 08:43:06,521 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __get_user_%P3": "=a" (__ret_gu), "=r" (__val_gu): "0" (tmp), "i" (1UL)); [3886-3887] [2025-03-17 08:43:06,555 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--input--serio--serio_raw.ko-entry_point.cil.out.i[129978,129991] [2025-03-17 08:43:06,582 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 08:43:06,631 INFO L204 MainTranslator]: Completed translation [2025-03-17 08:43:06,631 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:43:06 WrapperNode [2025-03-17 08:43:06,632 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 08:43:06,634 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 08:43:06,634 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 08:43:06,634 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 08:43:06,640 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:43:06" (1/1) ... [2025-03-17 08:43:06,673 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:43:06" (1/1) ... [2025-03-17 08:43:06,733 INFO L138 Inliner]: procedures = 190, calls = 552, calls flagged for inlining = 74, calls inlined = 69, statements flattened = 1678 [2025-03-17 08:43:06,733 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 08:43:06,734 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 08:43:06,734 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 08:43:06,734 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 08:43:06,743 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:43:06" (1/1) ... [2025-03-17 08:43:06,743 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:43:06" (1/1) ... [2025-03-17 08:43:06,751 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:43:06" (1/1) ... [2025-03-17 08:43:06,873 INFO L175 MemorySlicer]: Split 205 memory accesses to 7 slices as follows [2, 122, 14, 4, 23, 13, 27]. 60 percent of accesses are in the largest equivalence class. The 4 initializations are split as follows [2, 2, 0, 0, 0, 0, 0]. The 128 writes are split as follows [0, 62, 12, 2, 23, 2, 27]. [2025-03-17 08:43:06,873 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:43:06" (1/1) ... [2025-03-17 08:43:06,873 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:43:06" (1/1) ... [2025-03-17 08:43:06,912 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:43:06" (1/1) ... [2025-03-17 08:43:06,915 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:43:06" (1/1) ... [2025-03-17 08:43:06,923 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:43:06" (1/1) ... [2025-03-17 08:43:06,928 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:43:06" (1/1) ... [2025-03-17 08:43:06,941 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 08:43:06,943 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 08:43:06,943 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 08:43:06,943 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 08:43:06,944 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:43:06" (1/1) ... [2025-03-17 08:43:06,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 08:43:06,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 08:43:06,969 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-17 08:43:06,975 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-17 08:43:06,989 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_serio_raw_mutex [2025-03-17 08:43:06,989 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_serio_raw_mutex [2025-03-17 08:43:06,989 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-03-17 08:43:06,989 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-03-17 08:43:06,989 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-03-17 08:43:06,989 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-03-17 08:43:06,989 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-03-17 08:43:06,989 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-03-17 08:43:06,989 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2025-03-17 08:43:06,989 INFO L130 BoogieDeclarations]: Found specification of procedure kref_sub [2025-03-17 08:43:06,989 INFO L138 BoogieDeclarations]: Found implementation of procedure kref_sub [2025-03-17 08:43:06,989 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-03-17 08:43:06,989 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-03-17 08:43:06,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-03-17 08:43:06,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-03-17 08:43:06,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-03-17 08:43:06,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2025-03-17 08:43:06,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2025-03-17 08:43:06,990 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2025-03-17 08:43:06,990 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2025-03-17 08:43:06,990 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 08:43:06,990 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 08:43:06,990 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-17 08:43:06,990 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-17 08:43:06,990 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-17 08:43:06,990 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-17 08:43:06,990 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-17 08:43:06,990 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2025-03-17 08:43:06,990 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2025-03-17 08:43:06,990 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2025-03-17 08:43:06,990 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2025-03-17 08:43:06,990 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2025-03-17 08:43:06,990 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2025-03-17 08:43:06,990 INFO L130 BoogieDeclarations]: Found specification of procedure kill_fasync [2025-03-17 08:43:06,990 INFO L138 BoogieDeclarations]: Found implementation of procedure kill_fasync [2025-03-17 08:43:06,990 INFO L130 BoogieDeclarations]: Found specification of procedure list_del_init [2025-03-17 08:43:06,990 INFO L138 BoogieDeclarations]: Found implementation of procedure list_del_init [2025-03-17 08:43:06,990 INFO L130 BoogieDeclarations]: Found specification of procedure list_add_tail [2025-03-17 08:43:06,990 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add_tail [2025-03-17 08:43:06,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 08:43:06,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 08:43:06,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-17 08:43:06,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-17 08:43:06,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-17 08:43:06,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-17 08:43:06,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-17 08:43:06,991 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2025-03-17 08:43:06,991 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2025-03-17 08:43:06,991 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2025-03-17 08:43:06,991 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2025-03-17 08:43:06,991 INFO L130 BoogieDeclarations]: Found specification of procedure __dynamic_dev_dbg [2025-03-17 08:43:06,991 INFO L138 BoogieDeclarations]: Found implementation of procedure __dynamic_dev_dbg [2025-03-17 08:43:06,991 INFO L130 BoogieDeclarations]: Found specification of procedure kref_put [2025-03-17 08:43:06,991 INFO L138 BoogieDeclarations]: Found implementation of procedure kref_put [2025-03-17 08:43:06,991 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2025-03-17 08:43:06,991 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2025-03-17 08:43:06,991 INFO L130 BoogieDeclarations]: Found specification of procedure serio_raw_disconnect [2025-03-17 08:43:06,991 INFO L138 BoogieDeclarations]: Found implementation of procedure serio_raw_disconnect [2025-03-17 08:43:06,991 INFO L130 BoogieDeclarations]: Found specification of procedure serio_continue_rx [2025-03-17 08:43:06,991 INFO L138 BoogieDeclarations]: Found implementation of procedure serio_continue_rx [2025-03-17 08:43:06,991 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_zalloc [2025-03-17 08:43:06,991 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_zalloc [2025-03-17 08:43:06,991 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 08:43:06,991 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 08:43:06,991 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 08:43:06,991 INFO L130 BoogieDeclarations]: Found specification of procedure serio_raw_poll [2025-03-17 08:43:06,991 INFO L138 BoogieDeclarations]: Found implementation of procedure serio_raw_poll [2025-03-17 08:43:06,991 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock [2025-03-17 08:43:06,991 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock [2025-03-17 08:43:06,991 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_memset [2025-03-17 08:43:06,991 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_memset [2025-03-17 08:43:06,991 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 08:43:06,991 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2025-03-17 08:43:06,991 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2025-03-17 08:43:06,993 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-17 08:43:06,993 INFO L130 BoogieDeclarations]: Found specification of procedure serio_set_drvdata [2025-03-17 08:43:06,994 INFO L138 BoogieDeclarations]: Found implementation of procedure serio_set_drvdata [2025-03-17 08:43:06,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-17 08:43:06,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-17 08:43:06,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-17 08:43:06,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-17 08:43:06,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-03-17 08:43:06,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-03-17 08:43:06,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-03-17 08:43:06,995 INFO L130 BoogieDeclarations]: Found specification of procedure INIT_LIST_HEAD [2025-03-17 08:43:06,995 INFO L138 BoogieDeclarations]: Found implementation of procedure INIT_LIST_HEAD [2025-03-17 08:43:06,996 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2025-03-17 08:43:06,996 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2025-03-17 08:43:06,996 INFO L130 BoogieDeclarations]: Found specification of procedure misc_register [2025-03-17 08:43:06,996 INFO L138 BoogieDeclarations]: Found implementation of procedure misc_register [2025-03-17 08:43:06,996 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-17 08:43:06,996 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-17 08:43:06,996 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-17 08:43:06,996 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-17 08:43:06,996 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-03-17 08:43:06,997 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-03-17 08:43:06,997 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-03-17 08:43:06,997 INFO L130 BoogieDeclarations]: Found specification of procedure __wake_up [2025-03-17 08:43:06,997 INFO L138 BoogieDeclarations]: Found implementation of procedure __wake_up [2025-03-17 08:43:06,997 INFO L130 BoogieDeclarations]: Found specification of procedure serio_pause_rx [2025-03-17 08:43:06,997 INFO L138 BoogieDeclarations]: Found implementation of procedure serio_pause_rx [2025-03-17 08:43:06,997 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock_interruptible [2025-03-17 08:43:06,998 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock_interruptible [2025-03-17 08:43:06,998 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_add_return [2025-03-17 08:43:06,998 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_add_return [2025-03-17 08:43:06,998 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 08:43:06,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-17 08:43:06,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-17 08:43:06,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-17 08:43:06,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-03-17 08:43:06,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-03-17 08:43:06,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-03-17 08:43:06,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-03-17 08:43:06,998 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_file_operations_2 [2025-03-17 08:43:06,998 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_file_operations_2 [2025-03-17 08:43:06,998 INFO L130 BoogieDeclarations]: Found specification of procedure serio_get_drvdata [2025-03-17 08:43:06,998 INFO L138 BoogieDeclarations]: Found implementation of procedure serio_get_drvdata [2025-03-17 08:43:06,998 INFO L130 BoogieDeclarations]: Found specification of procedure warn_slowpath_null [2025-03-17 08:43:06,998 INFO L138 BoogieDeclarations]: Found implementation of procedure warn_slowpath_null [2025-03-17 08:43:06,998 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_interruptible_serio_raw_mutex [2025-03-17 08:43:06,998 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_interruptible_serio_raw_mutex [2025-03-17 08:43:06,998 INFO L130 BoogieDeclarations]: Found specification of procedure __might_fault [2025-03-17 08:43:06,998 INFO L138 BoogieDeclarations]: Found implementation of procedure __might_fault [2025-03-17 08:43:06,998 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2025-03-17 08:43:06,998 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2025-03-17 08:43:06,998 INFO L130 BoogieDeclarations]: Found specification of procedure serio_close [2025-03-17 08:43:06,998 INFO L138 BoogieDeclarations]: Found implementation of procedure serio_close [2025-03-17 08:43:06,998 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_serio_raw_mutex [2025-03-17 08:43:06,998 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_serio_raw_mutex [2025-03-17 08:43:06,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 08:43:06,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 08:43:06,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-17 08:43:06,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-17 08:43:06,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-17 08:43:06,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-17 08:43:06,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-17 08:43:06,998 INFO L130 BoogieDeclarations]: Found specification of procedure serio_raw_write [2025-03-17 08:43:06,998 INFO L138 BoogieDeclarations]: Found implementation of procedure serio_raw_write [2025-03-17 08:43:06,998 INFO L130 BoogieDeclarations]: Found specification of procedure serio_raw_fasync [2025-03-17 08:43:06,998 INFO L138 BoogieDeclarations]: Found implementation of procedure serio_raw_fasync [2025-03-17 08:43:06,998 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 08:43:06,998 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 08:43:07,338 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 08:43:07,341 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 08:43:07,414 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2025-03-17 08:43:07,509 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5308: havoc misc_deregister_#t~nondet302#1; [2025-03-17 08:43:07,618 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5312: havoc #t~nondet303; [2025-03-17 08:43:07,626 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5319: havoc #t~nondet304; [2025-03-17 08:43:07,655 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3529: havoc dev_get_drvdata_#t~mem88#1.base, dev_get_drvdata_#t~mem88#1.offset; [2025-03-17 08:43:07,688 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3406: havoc __kmalloc_#t~ret56#1.base, __kmalloc_#t~ret56#1.offset; [2025-03-17 08:43:07,747 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4488-1: ldv_mutex_lock_interruptible_14_#res#1 := ldv_mutex_lock_interruptible_14_~ldv_func_res~2#1; [2025-03-17 08:43:07,789 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5289: havoc fasync_helper_#t~nondet300#1; [2025-03-17 08:43:12,540 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5338: havoc prepare_to_wait_event_#t~nondet308#1; [2025-03-17 08:43:12,540 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5323: havoc mutex_lock_killable_#t~nondet305#1; [2025-03-17 08:43:12,540 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3507: havoc iminor_#t~mem70#1; [2025-03-17 08:43:12,541 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4467-1: ldv_mutex_lock_interruptible_12_#res#1 := ldv_mutex_lock_interruptible_12_~ldv_func_res~1#1; [2025-03-17 08:43:12,541 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3724: call ULTIMATE.dealloc(serio_raw_read_~#c~1#1.base, serio_raw_read_~#c~1#1.offset);havoc serio_raw_read_~#c~1#1.base, serio_raw_read_~#c~1#1.offset;call ULTIMATE.dealloc(serio_raw_read_~#__wait~0#1.base, serio_raw_read_~#__wait~0#1.offset);havoc serio_raw_read_~#__wait~0#1.base, serio_raw_read_~#__wait~0#1.offset; [2025-03-17 08:43:12,541 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5295: havoc get_device_#t~ret301#1.base, get_device_#t~ret301#1.offset; [2025-03-17 08:43:12,541 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4057: call ULTIMATE.dealloc(serio_raw_reconnect_~#descriptor~1#1.base, serio_raw_reconnect_~#descriptor~1#1.offset);havoc serio_raw_reconnect_~#descriptor~1#1.base, serio_raw_reconnect_~#descriptor~1#1.offset; [2025-03-17 08:43:12,541 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3976: call ULTIMATE.dealloc(serio_raw_connect_~#serio_raw_no~0#1.base, serio_raw_connect_~#serio_raw_no~0#1.offset);havoc serio_raw_connect_~#serio_raw_no~0#1.base, serio_raw_connect_~#serio_raw_no~0#1.offset;call ULTIMATE.dealloc(serio_raw_connect_~#descriptor~0#1.base, serio_raw_connect_~#descriptor~0#1.offset);havoc serio_raw_connect_~#descriptor~0#1.base, serio_raw_connect_~#descriptor~0#1.offset;call ULTIMATE.dealloc(serio_raw_connect_~#__key~0#1.base, serio_raw_connect_~#__key~0#1.offset);havoc serio_raw_connect_~#__key~0#1.base, serio_raw_connect_~#__key~0#1.offset; [2025-03-17 08:43:12,541 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4175: 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_~#ldvarg0~0#1.base, main_~#ldvarg0~0#1.offset);havoc main_~#ldvarg0~0#1.base, main_~#ldvarg0~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_~#ldvarg12~0#1.base, main_~#ldvarg12~0#1.offset);havoc main_~#ldvarg12~0#1.base, main_~#ldvarg12~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_~#ldvarg4~0#1.base, main_~#ldvarg4~0#1.offset);havoc main_~#ldvarg4~0#1.base, main_~#ldvarg4~0#1.offset;call ULTIMATE.dealloc(main_~#ldvarg9~0#1.base, main_~#ldvarg9~0#1.offset);havoc main_~#ldvarg9~0#1.base, main_~#ldvarg9~0#1.offset; [2025-03-17 08:43:12,541 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5334: havoc noop_llseek_#t~nondet307#1; [2025-03-17 08:43:12,541 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5351: havoc serio_open_#t~nondet309#1; [2025-03-17 08:43:12,541 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4509-1: ldv_mutex_lock_killable_16_#res#1 := ldv_mutex_lock_killable_16_~ldv_func_res~3#1; [2025-03-17 08:43:12,541 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5270: havoc __serio_register_driver_#t~nondet299#1; [2025-03-17 08:43:12,713 INFO L? ?]: Removed 590 outVars from TransFormulas that were not future-live. [2025-03-17 08:43:12,713 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 08:43:12,747 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 08:43:12,748 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 08:43:12,748 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 08:43:12 BoogieIcfgContainer [2025-03-17 08:43:12,748 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 08:43:12,751 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 08:43:12,751 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 08:43:12,755 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 08:43:12,755 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 08:43:05" (1/3) ... [2025-03-17 08:43:12,755 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a48b16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 08:43:12, skipping insertion in model container [2025-03-17 08:43:12,756 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:43:06" (2/3) ... [2025-03-17 08:43:12,756 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a48b16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 08:43:12, skipping insertion in model container [2025-03-17 08:43:12,756 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 08:43:12" (3/3) ... [2025-03-17 08:43:12,757 INFO L128 eAbstractionObserver]: Analyzing ICFG linux-4.2-rc1.tar.xz-32_7a-drivers--input--serio--serio_raw.ko-entry_point.cil.out.i [2025-03-17 08:43:12,769 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 08:43:12,770 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG linux-4.2-rc1.tar.xz-32_7a-drivers--input--serio--serio_raw.ko-entry_point.cil.out.i that has 41 procedures, 505 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-03-17 08:43:12,830 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 08:43:12,839 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;@7a93155b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 08:43:12,839 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 08:43:12,843 INFO L276 IsEmpty]: Start isEmpty. Operand has 504 states, 348 states have (on average 1.3649425287356323) internal successors, (475), 369 states have internal predecessors, (475), 115 states have call successors, (115), 40 states have call predecessors, (115), 39 states have return successors, (111), 111 states have call predecessors, (111), 111 states have call successors, (111) [2025-03-17 08:43:12,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-03-17 08:43:12,852 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 08:43:12,852 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 08:43:12,853 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 08:43:12,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 08:43:12,860 INFO L85 PathProgramCache]: Analyzing trace with hash 1646069590, now seen corresponding path program 1 times [2025-03-17 08:43:12,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 08:43:12,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137823217] [2025-03-17 08:43:12,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 08:43:12,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 08:43:13,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-17 08:43:13,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-17 08:43:13,785 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 08:43:13,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 08:43:14,357 INFO L134 CoverageAnalysis]: Checked inductivity of 322 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 322 trivial. 0 not checked. [2025-03-17 08:43:14,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 08:43:14,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137823217] [2025-03-17 08:43:14,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137823217] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 08:43:14,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 08:43:14,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 08:43:14,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313104592] [2025-03-17 08:43:14,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 08:43:14,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 08:43:14,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 08:43:14,384 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 08:43:14,385 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 08:43:14,388 INFO L87 Difference]: Start difference. First operand has 504 states, 348 states have (on average 1.3649425287356323) internal successors, (475), 369 states have internal predecessors, (475), 115 states have call successors, (115), 40 states have call predecessors, (115), 39 states have return successors, (111), 111 states have call predecessors, (111), 111 states have call successors, (111) Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 08:43:18,426 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-17 08:43:18,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 08:43:18,644 INFO L93 Difference]: Finished difference Result 1454 states and 2085 transitions. [2025-03-17 08:43:18,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 08:43:18,647 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 155 [2025-03-17 08:43:18,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 08:43:18,665 INFO L225 Difference]: With dead ends: 1454 [2025-03-17 08:43:18,666 INFO L226 Difference]: Without dead ends: 938 [2025-03-17 08:43:18,673 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-17 08:43:18,677 INFO L435 NwaCegarLoop]: 697 mSDtfsCounter, 615 mSDsluCounter, 666 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 615 SdHoareTripleChecker+Valid, 1363 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-03-17 08:43:18,678 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [615 Valid, 1363 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-03-17 08:43:18,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 938 states. [2025-03-17 08:43:18,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 938 to 932. [2025-03-17 08:43:18,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 932 states, 657 states have (on average 1.3455098934550989) internal successors, (884), 680 states have internal predecessors, (884), 199 states have call successors, (199), 76 states have call predecessors, (199), 75 states have return successors, (191), 191 states have call predecessors, (191), 191 states have call successors, (191) [2025-03-17 08:43:18,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 932 states to 932 states and 1274 transitions. [2025-03-17 08:43:18,798 INFO L78 Accepts]: Start accepts. Automaton has 932 states and 1274 transitions. Word has length 155 [2025-03-17 08:43:18,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 08:43:18,802 INFO L471 AbstractCegarLoop]: Abstraction has 932 states and 1274 transitions. [2025-03-17 08:43:18,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 08:43:18,802 INFO L276 IsEmpty]: Start isEmpty. Operand 932 states and 1274 transitions. [2025-03-17 08:43:18,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-03-17 08:43:18,810 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 08:43:18,810 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 08:43:18,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 08:43:18,811 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 08:43:18,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 08:43:18,811 INFO L85 PathProgramCache]: Analyzing trace with hash -1632319771, now seen corresponding path program 1 times [2025-03-17 08:43:18,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 08:43:18,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651012651] [2025-03-17 08:43:18,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 08:43:18,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 08:43:19,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-17 08:43:19,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-17 08:43:19,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 08:43:19,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 08:43:19,493 INFO L134 CoverageAnalysis]: Checked inductivity of 322 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 322 trivial. 0 not checked. [2025-03-17 08:43:19,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 08:43:19,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651012651] [2025-03-17 08:43:19,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651012651] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 08:43:19,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 08:43:19,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 08:43:19,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948168273] [2025-03-17 08:43:19,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 08:43:19,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 08:43:19,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 08:43:19,496 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 08:43:19,496 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 08:43:19,496 INFO L87 Difference]: Start difference. First operand 932 states and 1274 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 08:43:19,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 08:43:19,582 INFO L93 Difference]: Finished difference Result 954 states and 1300 transitions. [2025-03-17 08:43:19,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 08:43:19,582 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 161 [2025-03-17 08:43:19,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 08:43:19,588 INFO L225 Difference]: With dead ends: 954 [2025-03-17 08:43:19,588 INFO L226 Difference]: Without dead ends: 943 [2025-03-17 08:43:19,588 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-17 08:43:19,589 INFO L435 NwaCegarLoop]: 683 mSDtfsCounter, 670 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 670 SdHoareTripleChecker+Valid, 696 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 08:43:19,589 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [670 Valid, 696 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 08:43:19,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 943 states. [2025-03-17 08:43:19,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 943 to 932. [2025-03-17 08:43:19,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 932 states, 657 states have (on average 1.3439878234398783) internal successors, (883), 680 states have internal predecessors, (883), 199 states have call successors, (199), 76 states have call predecessors, (199), 75 states have return successors, (191), 191 states have call predecessors, (191), 191 states have call successors, (191) [2025-03-17 08:43:19,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 932 states to 932 states and 1273 transitions. [2025-03-17 08:43:19,650 INFO L78 Accepts]: Start accepts. Automaton has 932 states and 1273 transitions. Word has length 161 [2025-03-17 08:43:19,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 08:43:19,652 INFO L471 AbstractCegarLoop]: Abstraction has 932 states and 1273 transitions. [2025-03-17 08:43:19,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 08:43:19,652 INFO L276 IsEmpty]: Start isEmpty. Operand 932 states and 1273 transitions. [2025-03-17 08:43:19,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-03-17 08:43:19,654 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 08:43:19,654 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 08:43:19,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 08:43:19,659 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 08:43:19,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 08:43:19,660 INFO L85 PathProgramCache]: Analyzing trace with hash -1603690620, now seen corresponding path program 1 times [2025-03-17 08:43:19,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 08:43:19,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636795144] [2025-03-17 08:43:19,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 08:43:19,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 08:43:20,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-17 08:43:20,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-17 08:43:20,216 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 08:43:20,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 08:43:20,376 INFO L134 CoverageAnalysis]: Checked inductivity of 322 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 322 trivial. 0 not checked. [2025-03-17 08:43:20,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 08:43:20,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636795144] [2025-03-17 08:43:20,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636795144] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 08:43:20,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 08:43:20,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 08:43:20,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132755960] [2025-03-17 08:43:20,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 08:43:20,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 08:43:20,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 08:43:20,379 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 08:43:20,379 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 08:43:20,379 INFO L87 Difference]: Start difference. First operand 932 states and 1273 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 3 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-17 08:43:20,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 08:43:20,433 INFO L93 Difference]: Finished difference Result 934 states and 1274 transitions. [2025-03-17 08:43:20,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 08:43:20,434 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 3 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 161 [2025-03-17 08:43:20,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 08:43:20,441 INFO L225 Difference]: With dead ends: 934 [2025-03-17 08:43:20,441 INFO L226 Difference]: Without dead ends: 931 [2025-03-17 08:43:20,441 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-17 08:43:20,442 INFO L435 NwaCegarLoop]: 668 mSDtfsCounter, 631 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 631 SdHoareTripleChecker+Valid, 668 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 08:43:20,442 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [631 Valid, 668 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 08:43:20,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 931 states. [2025-03-17 08:43:20,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 931 to 931. [2025-03-17 08:43:20,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 931 states, 657 states have (on average 1.3424657534246576) internal successors, (882), 679 states have internal predecessors, (882), 198 states have call successors, (198), 76 states have call predecessors, (198), 75 states have return successors, (191), 191 states have call predecessors, (191), 191 states have call successors, (191) [2025-03-17 08:43:20,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 931 states to 931 states and 1271 transitions. [2025-03-17 08:43:20,498 INFO L78 Accepts]: Start accepts. Automaton has 931 states and 1271 transitions. Word has length 161 [2025-03-17 08:43:20,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 08:43:20,500 INFO L471 AbstractCegarLoop]: Abstraction has 931 states and 1271 transitions. [2025-03-17 08:43:20,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 3 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-17 08:43:20,500 INFO L276 IsEmpty]: Start isEmpty. Operand 931 states and 1271 transitions. [2025-03-17 08:43:20,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-17 08:43:20,503 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 08:43:20,503 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 08:43:20,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 08:43:20,503 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 08:43:20,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 08:43:20,504 INFO L85 PathProgramCache]: Analyzing trace with hash 1953924381, now seen corresponding path program 1 times [2025-03-17 08:43:20,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 08:43:20,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617610700] [2025-03-17 08:43:20,504 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 08:43:20,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 08:43:20,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-17 08:43:20,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-17 08:43:20,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 08:43:20,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 08:43:21,095 INFO L134 CoverageAnalysis]: Checked inductivity of 322 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 322 trivial. 0 not checked. [2025-03-17 08:43:21,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 08:43:21,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617610700] [2025-03-17 08:43:21,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617610700] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 08:43:21,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 08:43:21,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 08:43:21,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796884258] [2025-03-17 08:43:21,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 08:43:21,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 08:43:21,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 08:43:21,097 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 08:43:21,097 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 08:43:21,098 INFO L87 Difference]: Start difference. First operand 931 states and 1271 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-17 08:43:21,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 08:43:21,297 INFO L93 Difference]: Finished difference Result 2275 states and 3051 transitions. [2025-03-17 08:43:21,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 08:43:21,298 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 165 [2025-03-17 08:43:21,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 08:43:21,310 INFO L225 Difference]: With dead ends: 2275 [2025-03-17 08:43:21,310 INFO L226 Difference]: Without dead ends: 1377 [2025-03-17 08:43:21,312 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-17 08:43:21,313 INFO L435 NwaCegarLoop]: 676 mSDtfsCounter, 374 mSDsluCounter, 541 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 374 SdHoareTripleChecker+Valid, 1217 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 08:43:21,313 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [374 Valid, 1217 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 08:43:21,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1377 states. [2025-03-17 08:43:21,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1377 to 1357. [2025-03-17 08:43:21,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1357 states, 956 states have (on average 1.3190376569037656) internal successors, (1261), 994 states have internal predecessors, (1261), 271 states have call successors, (271), 132 states have call predecessors, (271), 129 states have return successors, (272), 256 states have call predecessors, (272), 264 states have call successors, (272) [2025-03-17 08:43:21,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1357 states to 1357 states and 1804 transitions. [2025-03-17 08:43:21,374 INFO L78 Accepts]: Start accepts. Automaton has 1357 states and 1804 transitions. Word has length 165 [2025-03-17 08:43:21,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 08:43:21,375 INFO L471 AbstractCegarLoop]: Abstraction has 1357 states and 1804 transitions. [2025-03-17 08:43:21,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-17 08:43:21,375 INFO L276 IsEmpty]: Start isEmpty. Operand 1357 states and 1804 transitions. [2025-03-17 08:43:21,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-17 08:43:21,377 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 08:43:21,377 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 08:43:21,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 08:43:21,377 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 08:43:21,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 08:43:21,378 INFO L85 PathProgramCache]: Analyzing trace with hash 1824688581, now seen corresponding path program 1 times [2025-03-17 08:43:21,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 08:43:21,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882668306] [2025-03-17 08:43:21,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 08:43:21,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 08:43:21,906 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-17 08:43:21,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-17 08:43:21,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 08:43:21,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 08:43:22,140 INFO L134 CoverageAnalysis]: Checked inductivity of 322 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 322 trivial. 0 not checked. [2025-03-17 08:43:22,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 08:43:22,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882668306] [2025-03-17 08:43:22,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882668306] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 08:43:22,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 08:43:22,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 08:43:22,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578373536] [2025-03-17 08:43:22,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 08:43:22,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 08:43:22,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 08:43:22,142 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 08:43:22,142 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 08:43:22,143 INFO L87 Difference]: Start difference. First operand 1357 states and 1804 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 3 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-17 08:43:22,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 08:43:22,247 INFO L93 Difference]: Finished difference Result 1359 states and 1805 transitions. [2025-03-17 08:43:22,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 08:43:22,248 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 3 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 162 [2025-03-17 08:43:22,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 08:43:22,260 INFO L225 Difference]: With dead ends: 1359 [2025-03-17 08:43:22,260 INFO L226 Difference]: Without dead ends: 1356 [2025-03-17 08:43:22,261 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-17 08:43:22,263 INFO L435 NwaCegarLoop]: 666 mSDtfsCounter, 628 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 628 SdHoareTripleChecker+Valid, 666 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 08:43:22,263 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [628 Valid, 666 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 08:43:22,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1356 states. [2025-03-17 08:43:22,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1356 to 1356. [2025-03-17 08:43:22,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1356 states, 956 states have (on average 1.3179916317991631) internal successors, (1260), 993 states have internal predecessors, (1260), 270 states have call successors, (270), 132 states have call predecessors, (270), 129 states have return successors, (272), 256 states have call predecessors, (272), 264 states have call successors, (272) [2025-03-17 08:43:22,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1356 states to 1356 states and 1802 transitions. [2025-03-17 08:43:22,361 INFO L78 Accepts]: Start accepts. Automaton has 1356 states and 1802 transitions. Word has length 162 [2025-03-17 08:43:22,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 08:43:22,361 INFO L471 AbstractCegarLoop]: Abstraction has 1356 states and 1802 transitions. [2025-03-17 08:43:22,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 3 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-17 08:43:22,362 INFO L276 IsEmpty]: Start isEmpty. Operand 1356 states and 1802 transitions. [2025-03-17 08:43:22,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-03-17 08:43:22,364 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 08:43:22,364 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 08:43:22,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 08:43:22,364 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 08:43:22,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 08:43:22,366 INFO L85 PathProgramCache]: Analyzing trace with hash 730260389, now seen corresponding path program 1 times [2025-03-17 08:43:22,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 08:43:22,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251360141] [2025-03-17 08:43:22,366 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 08:43:22,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 08:43:22,859 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-03-17 08:43:22,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-03-17 08:43:22,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 08:43:22,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 08:43:23,049 INFO L134 CoverageAnalysis]: Checked inductivity of 322 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 322 trivial. 0 not checked. [2025-03-17 08:43:23,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 08:43:23,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251360141] [2025-03-17 08:43:23,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251360141] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 08:43:23,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 08:43:23,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 08:43:23,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067701463] [2025-03-17 08:43:23,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 08:43:23,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 08:43:23,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 08:43:23,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 08:43:23,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 08:43:23,051 INFO L87 Difference]: Start difference. First operand 1356 states and 1802 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-17 08:43:23,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 08:43:23,113 INFO L93 Difference]: Finished difference Result 1358 states and 1803 transitions. [2025-03-17 08:43:23,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 08:43:23,114 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 163 [2025-03-17 08:43:23,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 08:43:23,121 INFO L225 Difference]: With dead ends: 1358 [2025-03-17 08:43:23,121 INFO L226 Difference]: Without dead ends: 1355 [2025-03-17 08:43:23,122 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-17 08:43:23,123 INFO L435 NwaCegarLoop]: 664 mSDtfsCounter, 625 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 625 SdHoareTripleChecker+Valid, 664 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 08:43:23,123 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [625 Valid, 664 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 08:43:23,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1355 states. [2025-03-17 08:43:23,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1355 to 1355. [2025-03-17 08:43:23,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1355 states, 956 states have (on average 1.3169456066945606) internal successors, (1259), 992 states have internal predecessors, (1259), 269 states have call successors, (269), 132 states have call predecessors, (269), 129 states have return successors, (272), 256 states have call predecessors, (272), 264 states have call successors, (272) [2025-03-17 08:43:23,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1355 states to 1355 states and 1800 transitions. [2025-03-17 08:43:23,191 INFO L78 Accepts]: Start accepts. Automaton has 1355 states and 1800 transitions. Word has length 163 [2025-03-17 08:43:23,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 08:43:23,191 INFO L471 AbstractCegarLoop]: Abstraction has 1355 states and 1800 transitions. [2025-03-17 08:43:23,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-17 08:43:23,192 INFO L276 IsEmpty]: Start isEmpty. Operand 1355 states and 1800 transitions. [2025-03-17 08:43:23,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-17 08:43:23,193 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 08:43:23,193 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 08:43:23,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 08:43:23,193 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 08:43:23,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 08:43:23,194 INFO L85 PathProgramCache]: Analyzing trace with hash 1559499737, now seen corresponding path program 1 times [2025-03-17 08:43:23,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 08:43:23,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087462043] [2025-03-17 08:43:23,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 08:43:23,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 08:43:23,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-17 08:43:23,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-17 08:43:23,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 08:43:23,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 08:43:23,751 INFO L134 CoverageAnalysis]: Checked inductivity of 322 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 322 trivial. 0 not checked. [2025-03-17 08:43:23,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 08:43:23,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087462043] [2025-03-17 08:43:23,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087462043] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 08:43:23,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 08:43:23,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 08:43:23,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377141692] [2025-03-17 08:43:23,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 08:43:23,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 08:43:23,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 08:43:23,752 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 08:43:23,753 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 08:43:23,753 INFO L87 Difference]: Start difference. First operand 1355 states and 1800 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-17 08:43:23,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 08:43:23,954 INFO L93 Difference]: Finished difference Result 3504 states and 4630 transitions. [2025-03-17 08:43:23,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 08:43:23,954 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 167 [2025-03-17 08:43:23,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 08:43:23,967 INFO L225 Difference]: With dead ends: 3504 [2025-03-17 08:43:23,967 INFO L226 Difference]: Without dead ends: 2192 [2025-03-17 08:43:23,973 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-17 08:43:23,974 INFO L435 NwaCegarLoop]: 1010 mSDtfsCounter, 516 mSDsluCounter, 602 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 516 SdHoareTripleChecker+Valid, 1612 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 08:43:23,974 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [516 Valid, 1612 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 08:43:23,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2192 states. [2025-03-17 08:43:24,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2192 to 2167. [2025-03-17 08:43:24,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2167 states, 1555 states have (on average 1.3234726688102894) internal successors, (2058), 1599 states have internal predecessors, (2058), 395 states have call successors, (395), 219 states have call predecessors, (395), 216 states have return successors, (404), 382 states have call predecessors, (404), 390 states have call successors, (404) [2025-03-17 08:43:24,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2167 states to 2167 states and 2857 transitions. [2025-03-17 08:43:24,081 INFO L78 Accepts]: Start accepts. Automaton has 2167 states and 2857 transitions. Word has length 167 [2025-03-17 08:43:24,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 08:43:24,082 INFO L471 AbstractCegarLoop]: Abstraction has 2167 states and 2857 transitions. [2025-03-17 08:43:24,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-17 08:43:24,082 INFO L276 IsEmpty]: Start isEmpty. Operand 2167 states and 2857 transitions. [2025-03-17 08:43:24,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-17 08:43:24,084 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 08:43:24,084 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 08:43:24,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 08:43:24,084 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 08:43:24,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 08:43:24,085 INFO L85 PathProgramCache]: Analyzing trace with hash 1162723782, now seen corresponding path program 1 times [2025-03-17 08:43:24,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 08:43:24,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796982435] [2025-03-17 08:43:24,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 08:43:24,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 08:43:24,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-17 08:43:24,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-17 08:43:24,635 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 08:43:24,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 08:43:24,838 INFO L134 CoverageAnalysis]: Checked inductivity of 322 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 322 trivial. 0 not checked. [2025-03-17 08:43:24,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 08:43:24,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796982435] [2025-03-17 08:43:24,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796982435] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 08:43:24,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 08:43:24,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 08:43:24,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741945089] [2025-03-17 08:43:24,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 08:43:24,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 08:43:24,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 08:43:24,839 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 08:43:24,839 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 08:43:24,839 INFO L87 Difference]: Start difference. First operand 2167 states and 2857 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-17 08:43:25,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 08:43:25,144 INFO L93 Difference]: Finished difference Result 5969 states and 8021 transitions. [2025-03-17 08:43:25,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 08:43:25,144 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 164 [2025-03-17 08:43:25,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 08:43:25,172 INFO L225 Difference]: With dead ends: 5969 [2025-03-17 08:43:25,173 INFO L226 Difference]: Without dead ends: 3844 [2025-03-17 08:43:25,182 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-17 08:43:25,183 INFO L435 NwaCegarLoop]: 813 mSDtfsCounter, 610 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 610 SdHoareTripleChecker+Valid, 1336 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 08:43:25,184 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [610 Valid, 1336 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 08:43:25,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3844 states. [2025-03-17 08:43:25,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3844 to 3803. [2025-03-17 08:43:25,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3803 states, 2794 states have (on average 1.3407301360057267) internal successors, (3746), 2877 states have internal predecessors, (3746), 659 states have call successors, (659), 363 states have call predecessors, (659), 349 states have return successors, (717), 622 states have call predecessors, (717), 651 states have call successors, (717) [2025-03-17 08:43:25,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3803 states to 3803 states and 5122 transitions. [2025-03-17 08:43:25,461 INFO L78 Accepts]: Start accepts. Automaton has 3803 states and 5122 transitions. Word has length 164 [2025-03-17 08:43:25,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 08:43:25,462 INFO L471 AbstractCegarLoop]: Abstraction has 3803 states and 5122 transitions. [2025-03-17 08:43:25,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-17 08:43:25,462 INFO L276 IsEmpty]: Start isEmpty. Operand 3803 states and 5122 transitions. [2025-03-17 08:43:25,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2025-03-17 08:43:25,467 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 08:43:25,467 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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] [2025-03-17 08:43:25,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 08:43:25,468 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 08:43:25,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 08:43:25,468 INFO L85 PathProgramCache]: Analyzing trace with hash -1232342432, now seen corresponding path program 1 times [2025-03-17 08:43:25,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 08:43:25,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273012365] [2025-03-17 08:43:25,468 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 08:43:25,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 08:43:25,984 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-03-17 08:43:26,080 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-03-17 08:43:26,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 08:43:26,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 08:43:26,333 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2025-03-17 08:43:26,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 08:43:26,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273012365] [2025-03-17 08:43:26,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273012365] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 08:43:26,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 08:43:26,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 08:43:26,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279809758] [2025-03-17 08:43:26,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 08:43:26,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 08:43:26,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 08:43:26,334 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 08:43:26,334 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 08:43:26,334 INFO L87 Difference]: Start difference. First operand 3803 states and 5122 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) [2025-03-17 08:43:30,357 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-17 08:43:30,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 08:43:30,753 INFO L93 Difference]: Finished difference Result 9096 states and 12267 transitions. [2025-03-17 08:43:30,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 08:43:30,754 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) Word has length 215 [2025-03-17 08:43:30,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 08:43:30,790 INFO L225 Difference]: With dead ends: 9096 [2025-03-17 08:43:30,790 INFO L226 Difference]: Without dead ends: 5340 [2025-03-17 08:43:30,805 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-17 08:43:30,807 INFO L435 NwaCegarLoop]: 1040 mSDtfsCounter, 569 mSDsluCounter, 555 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 6 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 569 SdHoareTripleChecker+Valid, 1595 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2025-03-17 08:43:30,807 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [569 Valid, 1595 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 31 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2025-03-17 08:43:30,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5340 states. [2025-03-17 08:43:31,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5340 to 5293. [2025-03-17 08:43:31,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5293 states, 3942 states have (on average 1.3450025367833587) internal successors, (5302), 4037 states have internal predecessors, (5302), 863 states have call successors, (863), 505 states have call predecessors, (863), 487 states have return successors, (949), 822 states have call predecessors, (949), 855 states have call successors, (949) [2025-03-17 08:43:31,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5293 states to 5293 states and 7114 transitions. [2025-03-17 08:43:31,119 INFO L78 Accepts]: Start accepts. Automaton has 5293 states and 7114 transitions. Word has length 215 [2025-03-17 08:43:31,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 08:43:31,119 INFO L471 AbstractCegarLoop]: Abstraction has 5293 states and 7114 transitions. [2025-03-17 08:43:31,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) [2025-03-17 08:43:31,120 INFO L276 IsEmpty]: Start isEmpty. Operand 5293 states and 7114 transitions. [2025-03-17 08:43:31,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2025-03-17 08:43:31,123 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 08:43:31,127 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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] [2025-03-17 08:43:31,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 08:43:31,128 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 08:43:31,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 08:43:31,129 INFO L85 PathProgramCache]: Analyzing trace with hash -1162412019, now seen corresponding path program 1 times [2025-03-17 08:43:31,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 08:43:31,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615071139] [2025-03-17 08:43:31,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 08:43:31,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 08:43:31,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 241 statements into 1 equivalence classes. [2025-03-17 08:43:31,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 241 of 241 statements. [2025-03-17 08:43:31,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 08:43:31,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 08:43:31,906 INFO L134 CoverageAnalysis]: Checked inductivity of 412 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 412 trivial. 0 not checked. [2025-03-17 08:43:31,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 08:43:31,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615071139] [2025-03-17 08:43:31,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615071139] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 08:43:31,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 08:43:31,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 08:43:31,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431755996] [2025-03-17 08:43:31,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 08:43:31,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 08:43:31,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 08:43:31,907 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 08:43:31,907 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 08:43:31,908 INFO L87 Difference]: Start difference. First operand 5293 states and 7114 transitions. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-17 08:43:32,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 08:43:32,127 INFO L93 Difference]: Finished difference Result 10539 states and 14188 transitions. [2025-03-17 08:43:32,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 08:43:32,128 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 241 [2025-03-17 08:43:32,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 08:43:32,153 INFO L225 Difference]: With dead ends: 10539 [2025-03-17 08:43:32,153 INFO L226 Difference]: Without dead ends: 5293 [2025-03-17 08:43:32,164 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-17 08:43:32,165 INFO L435 NwaCegarLoop]: 659 mSDtfsCounter, 0 mSDsluCounter, 653 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1312 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 08:43:32,166 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1312 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 08:43:32,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5293 states. [2025-03-17 08:43:32,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5293 to 5293. [2025-03-17 08:43:32,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5293 states, 3942 states have (on average 1.332825976661593) internal successors, (5254), 4037 states have internal predecessors, (5254), 863 states have call successors, (863), 505 states have call predecessors, (863), 487 states have return successors, (949), 822 states have call predecessors, (949), 855 states have call successors, (949) [2025-03-17 08:43:32,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5293 states to 5293 states and 7066 transitions. [2025-03-17 08:43:32,376 INFO L78 Accepts]: Start accepts. Automaton has 5293 states and 7066 transitions. Word has length 241 [2025-03-17 08:43:32,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 08:43:32,378 INFO L471 AbstractCegarLoop]: Abstraction has 5293 states and 7066 transitions. [2025-03-17 08:43:32,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-17 08:43:32,378 INFO L276 IsEmpty]: Start isEmpty. Operand 5293 states and 7066 transitions. [2025-03-17 08:43:32,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2025-03-17 08:43:32,381 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 08:43:32,381 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 08:43:32,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 08:43:32,381 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 08:43:32,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 08:43:32,382 INFO L85 PathProgramCache]: Analyzing trace with hash 1541682203, now seen corresponding path program 1 times [2025-03-17 08:43:32,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 08:43:32,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646042834] [2025-03-17 08:43:32,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 08:43:32,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 08:43:32,859 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 244 statements into 1 equivalence classes. [2025-03-17 08:43:32,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 244 of 244 statements. [2025-03-17 08:43:32,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 08:43:32,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 08:43:33,140 INFO L134 CoverageAnalysis]: Checked inductivity of 414 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 408 trivial. 0 not checked. [2025-03-17 08:43:33,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 08:43:33,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646042834] [2025-03-17 08:43:33,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646042834] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 08:43:33,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 08:43:33,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 08:43:33,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454570542] [2025-03-17 08:43:33,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 08:43:33,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 08:43:33,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 08:43:33,143 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 08:43:33,143 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 08:43:33,143 INFO L87 Difference]: Start difference. First operand 5293 states and 7066 transitions. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-17 08:43:37,159 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-17 08:43:37,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 08:43:37,668 INFO L93 Difference]: Finished difference Result 12703 states and 16908 transitions. [2025-03-17 08:43:37,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 08:43:37,669 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 244 [2025-03-17 08:43:37,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 08:43:37,713 INFO L225 Difference]: With dead ends: 12703 [2025-03-17 08:43:37,713 INFO L226 Difference]: Without dead ends: 7457 [2025-03-17 08:43:37,728 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 08:43:37,729 INFO L435 NwaCegarLoop]: 1234 mSDtfsCounter, 579 mSDsluCounter, 1884 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 579 SdHoareTripleChecker+Valid, 3118 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2025-03-17 08:43:37,729 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [579 Valid, 3118 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2025-03-17 08:43:37,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7457 states. [2025-03-17 08:43:37,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7457 to 5309. [2025-03-17 08:43:37,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5309 states, 3958 states have (on average 1.3314805457301668) internal successors, (5270), 4053 states have internal predecessors, (5270), 863 states have call successors, (863), 505 states have call predecessors, (863), 487 states have return successors, (949), 822 states have call predecessors, (949), 855 states have call successors, (949) [2025-03-17 08:43:37,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5309 states to 5309 states and 7082 transitions. [2025-03-17 08:43:37,949 INFO L78 Accepts]: Start accepts. Automaton has 5309 states and 7082 transitions. Word has length 244 [2025-03-17 08:43:37,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 08:43:37,950 INFO L471 AbstractCegarLoop]: Abstraction has 5309 states and 7082 transitions. [2025-03-17 08:43:37,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-17 08:43:37,951 INFO L276 IsEmpty]: Start isEmpty. Operand 5309 states and 7082 transitions. [2025-03-17 08:43:37,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2025-03-17 08:43:37,954 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 08:43:37,954 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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] [2025-03-17 08:43:37,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 08:43:37,954 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 08:43:37,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 08:43:37,955 INFO L85 PathProgramCache]: Analyzing trace with hash 1197154194, now seen corresponding path program 1 times [2025-03-17 08:43:37,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 08:43:37,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769891923] [2025-03-17 08:43:37,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 08:43:37,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 08:43:38,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 243 statements into 1 equivalence classes. [2025-03-17 08:43:38,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 243 of 243 statements. [2025-03-17 08:43:38,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 08:43:38,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 08:43:38,649 INFO L134 CoverageAnalysis]: Checked inductivity of 412 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 412 trivial. 0 not checked. [2025-03-17 08:43:38,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 08:43:38,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769891923] [2025-03-17 08:43:38,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769891923] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 08:43:38,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 08:43:38,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 08:43:38,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140180563] [2025-03-17 08:43:38,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 08:43:38,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 08:43:38,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 08:43:38,652 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 08:43:38,652 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 08:43:38,652 INFO L87 Difference]: Start difference. First operand 5309 states and 7082 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 3 states have call successors, (27), 3 states have call predecessors, (27), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-17 08:43:42,721 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 08:43:42,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 08:43:42,996 INFO L93 Difference]: Finished difference Result 10573 states and 14105 transitions. [2025-03-17 08:43:42,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 08:43:42,996 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 3 states have call successors, (27), 3 states have call predecessors, (27), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 243 [2025-03-17 08:43:42,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 08:43:43,026 INFO L225 Difference]: With dead ends: 10573 [2025-03-17 08:43:43,026 INFO L226 Difference]: Without dead ends: 5311 [2025-03-17 08:43:43,042 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-17 08:43:43,043 INFO L435 NwaCegarLoop]: 960 mSDtfsCounter, 521 mSDsluCounter, 627 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 521 SdHoareTripleChecker+Valid, 1587 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2025-03-17 08:43:43,043 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [521 Valid, 1587 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 22 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2025-03-17 08:43:43,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5311 states. [2025-03-17 08:43:43,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5311 to 5187. [2025-03-17 08:43:43,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5187 states, 3885 states have (on average 1.3305019305019306) internal successors, (5169), 3972 states have internal predecessors, (5169), 822 states have call successors, (822), 479 states have call predecessors, (822), 479 states have return successors, (846), 807 states have call predecessors, (846), 802 states have call successors, (846) [2025-03-17 08:43:43,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5187 states to 5187 states and 6837 transitions. [2025-03-17 08:43:43,308 INFO L78 Accepts]: Start accepts. Automaton has 5187 states and 6837 transitions. Word has length 243 [2025-03-17 08:43:43,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 08:43:43,309 INFO L471 AbstractCegarLoop]: Abstraction has 5187 states and 6837 transitions. [2025-03-17 08:43:43,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 3 states have call successors, (27), 3 states have call predecessors, (27), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-17 08:43:43,309 INFO L276 IsEmpty]: Start isEmpty. Operand 5187 states and 6837 transitions. [2025-03-17 08:43:43,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2025-03-17 08:43:43,312 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 08:43:43,312 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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] [2025-03-17 08:43:43,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 08:43:43,313 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 08:43:43,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 08:43:43,313 INFO L85 PathProgramCache]: Analyzing trace with hash 186036944, now seen corresponding path program 1 times [2025-03-17 08:43:43,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 08:43:43,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130912754] [2025-03-17 08:43:43,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 08:43:43,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 08:43:43,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 243 statements into 1 equivalence classes. [2025-03-17 08:43:43,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 243 of 243 statements. [2025-03-17 08:43:43,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 08:43:43,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 08:43:44,052 INFO L134 CoverageAnalysis]: Checked inductivity of 412 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 412 trivial. 0 not checked. [2025-03-17 08:43:44,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 08:43:44,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130912754] [2025-03-17 08:43:44,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130912754] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 08:43:44,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 08:43:44,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 08:43:44,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25650520] [2025-03-17 08:43:44,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 08:43:44,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 08:43:44,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 08:43:44,054 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 08:43:44,055 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 08:43:44,055 INFO L87 Difference]: Start difference. First operand 5187 states and 6837 transitions. Second operand has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 2 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-17 08:43:44,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 08:43:44,336 INFO L93 Difference]: Finished difference Result 5212 states and 6871 transitions. [2025-03-17 08:43:44,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 08:43:44,337 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 2 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 243 [2025-03-17 08:43:44,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 08:43:44,359 INFO L225 Difference]: With dead ends: 5212 [2025-03-17 08:43:44,360 INFO L226 Difference]: Without dead ends: 5193 [2025-03-17 08:43:44,364 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-17 08:43:44,364 INFO L435 NwaCegarLoop]: 668 mSDtfsCounter, 1 mSDsluCounter, 1979 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2647 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 08:43:44,364 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2647 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 08:43:44,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5193 states. [2025-03-17 08:43:44,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5193 to 5179. [2025-03-17 08:43:44,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5179 states, 3882 states have (on average 1.3297269448737763) internal successors, (5162), 3966 states have internal predecessors, (5162), 818 states have call successors, (818), 478 states have call predecessors, (818), 478 states have return successors, (843), 806 states have call predecessors, (843), 799 states have call successors, (843) [2025-03-17 08:43:44,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5179 states to 5179 states and 6823 transitions. [2025-03-17 08:43:44,560 INFO L78 Accepts]: Start accepts. Automaton has 5179 states and 6823 transitions. Word has length 243 [2025-03-17 08:43:44,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 08:43:44,561 INFO L471 AbstractCegarLoop]: Abstraction has 5179 states and 6823 transitions. [2025-03-17 08:43:44,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 2 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-17 08:43:44,562 INFO L276 IsEmpty]: Start isEmpty. Operand 5179 states and 6823 transitions. [2025-03-17 08:43:44,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2025-03-17 08:43:44,565 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 08:43:44,565 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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] [2025-03-17 08:43:44,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 08:43:44,566 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 08:43:44,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 08:43:44,566 INFO L85 PathProgramCache]: Analyzing trace with hash 17781739, now seen corresponding path program 1 times [2025-03-17 08:43:44,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 08:43:44,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683200997] [2025-03-17 08:43:44,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 08:43:44,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 08:43:45,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 274 statements into 1 equivalence classes. [2025-03-17 08:43:45,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 274 of 274 statements. [2025-03-17 08:43:45,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 08:43:45,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 08:43:45,356 INFO L134 CoverageAnalysis]: Checked inductivity of 418 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 418 trivial. 0 not checked. [2025-03-17 08:43:45,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 08:43:45,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683200997] [2025-03-17 08:43:45,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683200997] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 08:43:45,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 08:43:45,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 08:43:45,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457282931] [2025-03-17 08:43:45,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 08:43:45,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 08:43:45,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 08:43:45,358 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 08:43:45,359 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 08:43:45,359 INFO L87 Difference]: Start difference. First operand 5179 states and 6823 transitions. Second operand has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 2 states have call successors, (35), 2 states have call predecessors, (35), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2025-03-17 08:43:45,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 08:43:45,613 INFO L93 Difference]: Finished difference Result 10297 states and 13574 transitions. [2025-03-17 08:43:45,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 08:43:45,614 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 2 states have call successors, (35), 2 states have call predecessors, (35), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 274 [2025-03-17 08:43:45,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 08:43:45,636 INFO L225 Difference]: With dead ends: 10297 [2025-03-17 08:43:45,636 INFO L226 Difference]: Without dead ends: 5165 [2025-03-17 08:43:45,647 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-17 08:43:45,648 INFO L435 NwaCegarLoop]: 658 mSDtfsCounter, 0 mSDsluCounter, 1958 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2616 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 08:43:45,648 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2616 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 08:43:45,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5165 states. [2025-03-17 08:43:45,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5165 to 5165. [2025-03-17 08:43:45,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5165 states, 3876 states have (on average 1.329205366357069) internal successors, (5152), 3956 states have internal predecessors, (5152), 814 states have call successors, (814), 474 states have call predecessors, (814), 474 states have return successors, (839), 802 states have call predecessors, (839), 795 states have call successors, (839) [2025-03-17 08:43:45,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5165 states to 5165 states and 6805 transitions. [2025-03-17 08:43:45,836 INFO L78 Accepts]: Start accepts. Automaton has 5165 states and 6805 transitions. Word has length 274 [2025-03-17 08:43:45,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 08:43:45,838 INFO L471 AbstractCegarLoop]: Abstraction has 5165 states and 6805 transitions. [2025-03-17 08:43:45,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 2 states have call successors, (35), 2 states have call predecessors, (35), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2025-03-17 08:43:45,838 INFO L276 IsEmpty]: Start isEmpty. Operand 5165 states and 6805 transitions. [2025-03-17 08:43:45,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2025-03-17 08:43:45,847 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 08:43:45,847 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 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] [2025-03-17 08:43:45,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 08:43:45,847 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 08:43:45,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 08:43:45,848 INFO L85 PathProgramCache]: Analyzing trace with hash 1063987662, now seen corresponding path program 1 times [2025-03-17 08:43:45,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 08:43:45,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780177486] [2025-03-17 08:43:45,848 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 08:43:45,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 08:43:46,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 330 statements into 1 equivalence classes. [2025-03-17 08:43:46,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 330 of 330 statements. [2025-03-17 08:43:46,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 08:43:46,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 08:43:46,895 INFO L134 CoverageAnalysis]: Checked inductivity of 632 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2025-03-17 08:43:46,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 08:43:46,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780177486] [2025-03-17 08:43:46,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780177486] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 08:43:46,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 08:43:46,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 08:43:46,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584736739] [2025-03-17 08:43:46,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 08:43:46,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 08:43:46,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 08:43:46,897 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 08:43:46,898 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 08:43:46,898 INFO L87 Difference]: Start difference. First operand 5165 states and 6805 transitions. Second operand has 6 states, 6 states have (on average 21.0) internal successors, (126), 5 states have internal predecessors, (126), 2 states have call successors, (37), 2 states have call predecessors, (37), 2 states have return successors, (34), 2 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-17 08:43:47,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 08:43:47,176 INFO L93 Difference]: Finished difference Result 5212 states and 6857 transitions. [2025-03-17 08:43:47,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 08:43:47,178 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 21.0) internal successors, (126), 5 states have internal predecessors, (126), 2 states have call successors, (37), 2 states have call predecessors, (37), 2 states have return successors, (34), 2 states have call predecessors, (34), 1 states have call successors, (34) Word has length 330 [2025-03-17 08:43:47,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 08:43:47,199 INFO L225 Difference]: With dead ends: 5212 [2025-03-17 08:43:47,199 INFO L226 Difference]: Without dead ends: 5126 [2025-03-17 08:43:47,204 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-17 08:43:47,204 INFO L435 NwaCegarLoop]: 664 mSDtfsCounter, 1 mSDsluCounter, 2638 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 3302 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 08:43:47,205 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 3302 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 08:43:47,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5126 states. [2025-03-17 08:43:47,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5126 to 5102. [2025-03-17 08:43:47,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5102 states, 3820 states have (on average 1.3227748691099477) internal successors, (5053), 3899 states have internal predecessors, (5053), 807 states have call successors, (807), 474 states have call predecessors, (807), 474 states have return successors, (833), 796 states have call predecessors, (833), 789 states have call successors, (833) [2025-03-17 08:43:47,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5102 states to 5102 states and 6693 transitions. [2025-03-17 08:43:47,538 INFO L78 Accepts]: Start accepts. Automaton has 5102 states and 6693 transitions. Word has length 330 [2025-03-17 08:43:47,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 08:43:47,539 INFO L471 AbstractCegarLoop]: Abstraction has 5102 states and 6693 transitions. [2025-03-17 08:43:47,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.0) internal successors, (126), 5 states have internal predecessors, (126), 2 states have call successors, (37), 2 states have call predecessors, (37), 2 states have return successors, (34), 2 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-17 08:43:47,539 INFO L276 IsEmpty]: Start isEmpty. Operand 5102 states and 6693 transitions. [2025-03-17 08:43:47,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2025-03-17 08:43:47,553 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 08:43:47,553 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 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] [2025-03-17 08:43:47,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 08:43:47,553 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 08:43:47,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 08:43:47,554 INFO L85 PathProgramCache]: Analyzing trace with hash -473693917, now seen corresponding path program 1 times [2025-03-17 08:43:47,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 08:43:47,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475140303] [2025-03-17 08:43:47,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 08:43:47,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 08:43:48,285 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 337 statements into 1 equivalence classes. [2025-03-17 08:43:48,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 337 of 337 statements. [2025-03-17 08:43:48,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 08:43:48,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 08:43:49,083 INFO L134 CoverageAnalysis]: Checked inductivity of 632 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2025-03-17 08:43:49,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 08:43:49,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475140303] [2025-03-17 08:43:49,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475140303] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 08:43:49,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 08:43:49,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 08:43:49,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784636230] [2025-03-17 08:43:49,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 08:43:49,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 08:43:49,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 08:43:49,089 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 08:43:49,089 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 08:43:49,089 INFO L87 Difference]: Start difference. First operand 5102 states and 6693 transitions. Second operand has 6 states, 6 states have (on average 22.333333333333332) internal successors, (134), 5 states have internal predecessors, (134), 2 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (34), 2 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-17 08:43:49,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 08:43:49,445 INFO L93 Difference]: Finished difference Result 5260 states and 6842 transitions. [2025-03-17 08:43:49,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 08:43:49,445 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.333333333333332) internal successors, (134), 5 states have internal predecessors, (134), 2 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (34), 2 states have call predecessors, (34), 1 states have call successors, (34) Word has length 337 [2025-03-17 08:43:49,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 08:43:49,464 INFO L225 Difference]: With dead ends: 5260 [2025-03-17 08:43:49,464 INFO L226 Difference]: Without dead ends: 4808 [2025-03-17 08:43:49,466 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 08:43:49,467 INFO L435 NwaCegarLoop]: 662 mSDtfsCounter, 1 mSDsluCounter, 2630 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 3292 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 08:43:49,467 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 3292 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 08:43:49,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4808 states. [2025-03-17 08:43:49,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4808 to 4784. [2025-03-17 08:43:49,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4784 states, 3594 states have (on average 1.323594880356149) internal successors, (4757), 3661 states have internal predecessors, (4757), 737 states have call successors, (737), 451 states have call predecessors, (737), 452 states have return successors, (765), 733 states have call predecessors, (765), 721 states have call successors, (765) [2025-03-17 08:43:49,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4784 states to 4784 states and 6259 transitions. [2025-03-17 08:43:49,725 INFO L78 Accepts]: Start accepts. Automaton has 4784 states and 6259 transitions. Word has length 337 [2025-03-17 08:43:49,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 08:43:49,726 INFO L471 AbstractCegarLoop]: Abstraction has 4784 states and 6259 transitions. [2025-03-17 08:43:49,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.333333333333332) internal successors, (134), 5 states have internal predecessors, (134), 2 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (34), 2 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-17 08:43:49,726 INFO L276 IsEmpty]: Start isEmpty. Operand 4784 states and 6259 transitions. [2025-03-17 08:43:49,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2025-03-17 08:43:49,738 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 08:43:49,739 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 3, 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] [2025-03-17 08:43:49,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 08:43:49,739 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 08:43:49,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 08:43:49,740 INFO L85 PathProgramCache]: Analyzing trace with hash 2049935945, now seen corresponding path program 1 times [2025-03-17 08:43:49,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 08:43:49,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638801870] [2025-03-17 08:43:49,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 08:43:49,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 08:43:50,350 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 339 statements into 1 equivalence classes. [2025-03-17 08:43:50,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 339 of 339 statements. [2025-03-17 08:43:50,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 08:43:50,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 08:43:50,734 INFO L134 CoverageAnalysis]: Checked inductivity of 639 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 633 trivial. 0 not checked. [2025-03-17 08:43:50,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 08:43:50,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638801870] [2025-03-17 08:43:50,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638801870] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 08:43:50,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 08:43:50,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 08:43:50,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731235056] [2025-03-17 08:43:50,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 08:43:50,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 08:43:50,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 08:43:50,735 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 08:43:50,735 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 08:43:50,736 INFO L87 Difference]: Start difference. First operand 4784 states and 6259 transitions. Second operand has 6 states, 6 states have (on average 21.5) internal successors, (129), 5 states have internal predecessors, (129), 2 states have call successors, (39), 2 states have call predecessors, (39), 3 states have return successors, (36), 3 states have call predecessors, (36), 2 states have call successors, (36) [2025-03-17 08:43:51,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 08:43:51,074 INFO L93 Difference]: Finished difference Result 9575 states and 12578 transitions. [2025-03-17 08:43:51,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 08:43:51,097 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 21.5) internal successors, (129), 5 states have internal predecessors, (129), 2 states have call successors, (39), 2 states have call predecessors, (39), 3 states have return successors, (36), 3 states have call predecessors, (36), 2 states have call successors, (36) Word has length 339 [2025-03-17 08:43:51,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 08:43:51,140 INFO L225 Difference]: With dead ends: 9575 [2025-03-17 08:43:51,143 INFO L226 Difference]: Without dead ends: 4838 [2025-03-17 08:43:51,159 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-17 08:43:51,161 INFO L435 NwaCegarLoop]: 660 mSDtfsCounter, 14 mSDsluCounter, 2625 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 3285 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 08:43:51,161 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 3285 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 08:43:51,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4838 states. [2025-03-17 08:43:51,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4838 to 4814. [2025-03-17 08:43:51,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4814 states, 3624 states have (on average 1.3258830022075054) internal successors, (4805), 3697 states have internal predecessors, (4805), 743 states have call successors, (743), 451 states have call predecessors, (743), 446 states have return successors, (759), 727 states have call predecessors, (759), 727 states have call successors, (759) [2025-03-17 08:43:51,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4814 states to 4814 states and 6307 transitions. [2025-03-17 08:43:51,372 INFO L78 Accepts]: Start accepts. Automaton has 4814 states and 6307 transitions. Word has length 339 [2025-03-17 08:43:51,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 08:43:51,374 INFO L471 AbstractCegarLoop]: Abstraction has 4814 states and 6307 transitions. [2025-03-17 08:43:51,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.5) internal successors, (129), 5 states have internal predecessors, (129), 2 states have call successors, (39), 2 states have call predecessors, (39), 3 states have return successors, (36), 3 states have call predecessors, (36), 2 states have call successors, (36) [2025-03-17 08:43:51,374 INFO L276 IsEmpty]: Start isEmpty. Operand 4814 states and 6307 transitions. [2025-03-17 08:43:51,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2025-03-17 08:43:51,391 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 08:43:51,391 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 4, 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] [2025-03-17 08:43:51,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-17 08:43:51,392 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 08:43:51,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 08:43:51,393 INFO L85 PathProgramCache]: Analyzing trace with hash 521755084, now seen corresponding path program 1 times [2025-03-17 08:43:51,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 08:43:51,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214655329] [2025-03-17 08:43:51,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 08:43:51,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 08:43:51,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 342 statements into 1 equivalence classes. [2025-03-17 08:43:52,024 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 342 of 342 statements. [2025-03-17 08:43:52,024 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 08:43:52,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 08:43:52,550 INFO L134 CoverageAnalysis]: Checked inductivity of 640 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2025-03-17 08:43:52,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 08:43:52,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214655329] [2025-03-17 08:43:52,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214655329] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 08:43:52,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 08:43:52,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 08:43:52,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135517609] [2025-03-17 08:43:52,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 08:43:52,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 08:43:52,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 08:43:52,552 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 08:43:52,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 08:43:52,552 INFO L87 Difference]: Start difference. First operand 4814 states and 6307 transitions. Second operand has 6 states, 6 states have (on average 23.333333333333332) internal successors, (140), 5 states have internal predecessors, (140), 2 states have call successors, (35), 2 states have call predecessors, (35), 2 states have return successors, (34), 2 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-17 08:43:53,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 08:43:53,004 INFO L93 Difference]: Finished difference Result 4994 states and 6471 transitions. [2025-03-17 08:43:53,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 08:43:53,009 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 23.333333333333332) internal successors, (140), 5 states have internal predecessors, (140), 2 states have call successors, (35), 2 states have call predecessors, (35), 2 states have return successors, (34), 2 states have call predecessors, (34), 1 states have call successors, (34) Word has length 342 [2025-03-17 08:43:53,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 08:43:53,021 INFO L225 Difference]: With dead ends: 4994 [2025-03-17 08:43:53,022 INFO L226 Difference]: Without dead ends: 0 [2025-03-17 08:43:53,033 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 08:43:53,034 INFO L435 NwaCegarLoop]: 647 mSDtfsCounter, 27 mSDsluCounter, 2539 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 3186 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 08:43:53,034 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 3186 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 08:43:53,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-17 08:43:53,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-17 08:43:53,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 08:43:53,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-17 08:43:53,043 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 342 [2025-03-17 08:43:53,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 08:43:53,044 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-17 08:43:53,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.333333333333332) internal successors, (140), 5 states have internal predecessors, (140), 2 states have call successors, (35), 2 states have call predecessors, (35), 2 states have return successors, (34), 2 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-17 08:43:53,044 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-17 08:43:53,045 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-17 08:43:53,050 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 08:43:53,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-17 08:43:53,054 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 08:43:53,056 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.