./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 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/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-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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-?-551b009-m [2025-01-09 18:54:31,753 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 18:54:31,804 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-01-09 18:54:31,808 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 18:54:31,808 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 18:54:31,827 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 18:54:31,828 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 18:54:31,828 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 18:54:31,828 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 18:54:31,828 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 18:54:31,828 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 18:54:31,828 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 18:54:31,829 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 18:54:31,829 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 18:54:31,829 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 18:54:31,829 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 18:54:31,829 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 18:54:31,829 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 18:54:31,829 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 18:54:31,829 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 18:54:31,829 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 18:54:31,829 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 18:54:31,829 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 18:54:31,829 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 18:54:31,829 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 18:54:31,829 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 18:54:31,829 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 18:54:31,829 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 18:54:31,829 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 18:54:31,829 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 18:54:31,830 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 18:54:31,830 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 18:54:31,830 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 18:54:31,830 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 18:54:31,830 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 18:54:31,830 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 18:54:31,830 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 18:54:31,830 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 18:54:31,830 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 18:54:31,830 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 18:54:31,830 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 18:54:31,830 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 18:54:31,830 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 18:54:31,830 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 18:54:31,830 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 18:54:31,830 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-jdk21/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-01-09 18:54:32,056 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 18:54:32,064 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 18:54:32,068 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 18:54:32,069 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 18:54:32,069 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 18:54:32,071 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/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-01-09 18:54:33,273 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5e4056e01/c8666cf71c234cc2a10fd9cd92b8c2af/FLAG0226850e4 [2025-01-09 18:54:33,733 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 18:54:33,733 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/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-01-09 18:54:33,766 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5e4056e01/c8666cf71c234cc2a10fd9cd92b8c2af/FLAG0226850e4 [2025-01-09 18:54:33,871 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5e4056e01/c8666cf71c234cc2a10fd9cd92b8c2af [2025-01-09 18:54:33,873 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 18:54:33,874 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 18:54:33,876 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 18:54:33,876 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 18:54:33,879 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 18:54:33,880 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 06:54:33" (1/1) ... [2025-01-09 18:54:33,881 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68118327 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:54:33, skipping insertion in model container [2025-01-09 18:54:33,881 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 06:54:33" (1/1) ... [2025-01-09 18:54:33,951 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 18:54:34,533 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-01-09 18:54:34,605 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 18:54:34,629 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 18:54:34,716 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-01-09 18:54:34,718 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-01-09 18:54:34,718 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-01-09 18:54:34,718 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-01-09 18:54:34,719 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-01-09 18:54:34,756 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-01-09 18:54:34,756 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-01-09 18:54:34,757 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-01-09 18:54:34,757 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-01-09 18:54:34,758 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-01-09 18:54:34,764 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-01-09 18:54:34,797 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-01-09 18:54:34,825 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 18:54:34,899 INFO L204 MainTranslator]: Completed translation [2025-01-09 18:54:34,901 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:54:34 WrapperNode [2025-01-09 18:54:34,901 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 18:54:34,902 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 18:54:34,903 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 18:54:34,903 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 18:54:34,909 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:54:34" (1/1) ... [2025-01-09 18:54:34,942 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:54:34" (1/1) ... [2025-01-09 18:54:35,006 INFO L138 Inliner]: procedures = 190, calls = 552, calls flagged for inlining = 74, calls inlined = 69, statements flattened = 1678 [2025-01-09 18:54:35,006 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 18:54:35,007 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 18:54:35,007 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 18:54:35,007 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 18:54:35,014 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:54:34" (1/1) ... [2025-01-09 18:54:35,014 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:54:34" (1/1) ... [2025-01-09 18:54:35,022 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:54:34" (1/1) ... [2025-01-09 18:54:35,107 INFO L175 MemorySlicer]: Split 205 memory accesses to 7 slices as follows [2, 4, 122, 14, 13, 23, 27]. 60 percent of accesses are in the largest equivalence class. The 4 initializations are split as follows [2, 0, 2, 0, 0, 0, 0]. The 128 writes are split as follows [0, 2, 62, 12, 2, 23, 27]. [2025-01-09 18:54:35,108 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:54:34" (1/1) ... [2025-01-09 18:54:35,108 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:54:34" (1/1) ... [2025-01-09 18:54:35,143 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:54:34" (1/1) ... [2025-01-09 18:54:35,146 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:54:34" (1/1) ... [2025-01-09 18:54:35,158 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:54:34" (1/1) ... [2025-01-09 18:54:35,167 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:54:34" (1/1) ... [2025-01-09 18:54:35,173 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:54:34" (1/1) ... [2025-01-09 18:54:35,183 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 18:54:35,188 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 18:54:35,188 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 18:54:35,188 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 18:54:35,189 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:54:34" (1/1) ... [2025-01-09 18:54:35,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 18:54:35,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 18:54:35,214 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 18:54:35,217 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 18:54:35,235 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_serio_raw_mutex [2025-01-09 18:54:35,235 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_serio_raw_mutex [2025-01-09 18:54:35,235 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-01-09 18:54:35,235 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-01-09 18:54:35,235 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-01-09 18:54:35,235 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-01-09 18:54:35,235 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-01-09 18:54:35,235 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-01-09 18:54:35,235 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2025-01-09 18:54:35,235 INFO L130 BoogieDeclarations]: Found specification of procedure kref_sub [2025-01-09 18:54:35,235 INFO L138 BoogieDeclarations]: Found implementation of procedure kref_sub [2025-01-09 18:54:35,235 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-01-09 18:54:35,235 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-01-09 18:54:35,235 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-01-09 18:54:35,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-01-09 18:54:35,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-01-09 18:54:35,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2025-01-09 18:54:35,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2025-01-09 18:54:35,236 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2025-01-09 18:54:35,236 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2025-01-09 18:54:35,236 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 18:54:35,236 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 18:54:35,236 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-09 18:54:35,236 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-09 18:54:35,236 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-01-09 18:54:35,236 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-01-09 18:54:35,236 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-01-09 18:54:35,236 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2025-01-09 18:54:35,236 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2025-01-09 18:54:35,236 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2025-01-09 18:54:35,236 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2025-01-09 18:54:35,236 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2025-01-09 18:54:35,236 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2025-01-09 18:54:35,236 INFO L130 BoogieDeclarations]: Found specification of procedure kill_fasync [2025-01-09 18:54:35,236 INFO L138 BoogieDeclarations]: Found implementation of procedure kill_fasync [2025-01-09 18:54:35,236 INFO L130 BoogieDeclarations]: Found specification of procedure list_del_init [2025-01-09 18:54:35,236 INFO L138 BoogieDeclarations]: Found implementation of procedure list_del_init [2025-01-09 18:54:35,236 INFO L130 BoogieDeclarations]: Found specification of procedure list_add_tail [2025-01-09 18:54:35,236 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add_tail [2025-01-09 18:54:35,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 18:54:35,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 18:54:35,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-09 18:54:35,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-09 18:54:35,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-01-09 18:54:35,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-01-09 18:54:35,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-01-09 18:54:35,239 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2025-01-09 18:54:35,239 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2025-01-09 18:54:35,239 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2025-01-09 18:54:35,239 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2025-01-09 18:54:35,239 INFO L130 BoogieDeclarations]: Found specification of procedure __dynamic_dev_dbg [2025-01-09 18:54:35,239 INFO L138 BoogieDeclarations]: Found implementation of procedure __dynamic_dev_dbg [2025-01-09 18:54:35,239 INFO L130 BoogieDeclarations]: Found specification of procedure kref_put [2025-01-09 18:54:35,239 INFO L138 BoogieDeclarations]: Found implementation of procedure kref_put [2025-01-09 18:54:35,239 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2025-01-09 18:54:35,239 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2025-01-09 18:54:35,239 INFO L130 BoogieDeclarations]: Found specification of procedure serio_raw_disconnect [2025-01-09 18:54:35,239 INFO L138 BoogieDeclarations]: Found implementation of procedure serio_raw_disconnect [2025-01-09 18:54:35,239 INFO L130 BoogieDeclarations]: Found specification of procedure serio_continue_rx [2025-01-09 18:54:35,239 INFO L138 BoogieDeclarations]: Found implementation of procedure serio_continue_rx [2025-01-09 18:54:35,239 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_zalloc [2025-01-09 18:54:35,239 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_zalloc [2025-01-09 18:54:35,239 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 18:54:35,239 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 18:54:35,239 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 18:54:35,239 INFO L130 BoogieDeclarations]: Found specification of procedure serio_raw_poll [2025-01-09 18:54:35,239 INFO L138 BoogieDeclarations]: Found implementation of procedure serio_raw_poll [2025-01-09 18:54:35,239 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock [2025-01-09 18:54:35,239 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock [2025-01-09 18:54:35,239 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_memset [2025-01-09 18:54:35,239 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_memset [2025-01-09 18:54:35,239 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 18:54:35,239 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2025-01-09 18:54:35,239 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2025-01-09 18:54:35,239 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 18:54:35,239 INFO L130 BoogieDeclarations]: Found specification of procedure serio_set_drvdata [2025-01-09 18:54:35,239 INFO L138 BoogieDeclarations]: Found implementation of procedure serio_set_drvdata [2025-01-09 18:54:35,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-09 18:54:35,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-09 18:54:35,240 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-01-09 18:54:35,240 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-01-09 18:54:35,240 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-01-09 18:54:35,240 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-01-09 18:54:35,240 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-01-09 18:54:35,240 INFO L130 BoogieDeclarations]: Found specification of procedure INIT_LIST_HEAD [2025-01-09 18:54:35,240 INFO L138 BoogieDeclarations]: Found implementation of procedure INIT_LIST_HEAD [2025-01-09 18:54:35,240 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2025-01-09 18:54:35,240 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2025-01-09 18:54:35,240 INFO L130 BoogieDeclarations]: Found specification of procedure misc_register [2025-01-09 18:54:35,240 INFO L138 BoogieDeclarations]: Found implementation of procedure misc_register [2025-01-09 18:54:35,240 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-09 18:54:35,240 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-09 18:54:35,240 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-01-09 18:54:35,240 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-01-09 18:54:35,240 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-01-09 18:54:35,240 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-01-09 18:54:35,240 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-01-09 18:54:35,240 INFO L130 BoogieDeclarations]: Found specification of procedure __wake_up [2025-01-09 18:54:35,240 INFO L138 BoogieDeclarations]: Found implementation of procedure __wake_up [2025-01-09 18:54:35,240 INFO L130 BoogieDeclarations]: Found specification of procedure serio_pause_rx [2025-01-09 18:54:35,240 INFO L138 BoogieDeclarations]: Found implementation of procedure serio_pause_rx [2025-01-09 18:54:35,240 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock_interruptible [2025-01-09 18:54:35,240 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock_interruptible [2025-01-09 18:54:35,240 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_add_return [2025-01-09 18:54:35,240 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_add_return [2025-01-09 18:54:35,240 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 18:54:35,240 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-01-09 18:54:35,240 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-01-09 18:54:35,240 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-01-09 18:54:35,240 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-01-09 18:54:35,240 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-01-09 18:54:35,240 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-01-09 18:54:35,240 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-01-09 18:54:35,240 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_file_operations_2 [2025-01-09 18:54:35,241 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_file_operations_2 [2025-01-09 18:54:35,241 INFO L130 BoogieDeclarations]: Found specification of procedure serio_get_drvdata [2025-01-09 18:54:35,241 INFO L138 BoogieDeclarations]: Found implementation of procedure serio_get_drvdata [2025-01-09 18:54:35,241 INFO L130 BoogieDeclarations]: Found specification of procedure warn_slowpath_null [2025-01-09 18:54:35,241 INFO L138 BoogieDeclarations]: Found implementation of procedure warn_slowpath_null [2025-01-09 18:54:35,241 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_interruptible_serio_raw_mutex [2025-01-09 18:54:35,242 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_interruptible_serio_raw_mutex [2025-01-09 18:54:35,242 INFO L130 BoogieDeclarations]: Found specification of procedure __might_fault [2025-01-09 18:54:35,242 INFO L138 BoogieDeclarations]: Found implementation of procedure __might_fault [2025-01-09 18:54:35,242 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2025-01-09 18:54:35,242 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2025-01-09 18:54:35,242 INFO L130 BoogieDeclarations]: Found specification of procedure serio_close [2025-01-09 18:54:35,242 INFO L138 BoogieDeclarations]: Found implementation of procedure serio_close [2025-01-09 18:54:35,242 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_serio_raw_mutex [2025-01-09 18:54:35,242 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_serio_raw_mutex [2025-01-09 18:54:35,242 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 18:54:35,242 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 18:54:35,242 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 18:54:35,243 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-09 18:54:35,243 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-01-09 18:54:35,243 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-01-09 18:54:35,243 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-01-09 18:54:35,243 INFO L130 BoogieDeclarations]: Found specification of procedure serio_raw_write [2025-01-09 18:54:35,243 INFO L138 BoogieDeclarations]: Found implementation of procedure serio_raw_write [2025-01-09 18:54:35,243 INFO L130 BoogieDeclarations]: Found specification of procedure serio_raw_fasync [2025-01-09 18:54:35,243 INFO L138 BoogieDeclarations]: Found implementation of procedure serio_raw_fasync [2025-01-09 18:54:35,243 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 18:54:35,243 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 18:54:35,544 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 18:54:35,547 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 18:54:35,609 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2025-01-09 18:54:41,011 INFO L? ?]: Removed 756 outVars from TransFormulas that were not future-live. [2025-01-09 18:54:41,012 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 18:54:41,025 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 18:54:41,025 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 18:54:41,025 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 06:54:41 BoogieIcfgContainer [2025-01-09 18:54:41,026 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 18:54:41,027 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 18:54:41,027 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 18:54:41,034 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 18:54:41,034 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 06:54:33" (1/3) ... [2025-01-09 18:54:41,035 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42109ace and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 06:54:41, skipping insertion in model container [2025-01-09 18:54:41,035 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:54:34" (2/3) ... [2025-01-09 18:54:41,035 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42109ace and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 06:54:41, skipping insertion in model container [2025-01-09 18:54:41,035 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 06:54:41" (3/3) ... [2025-01-09 18:54:41,035 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-01-09 18:54:41,045 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 18:54:41,046 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, 544 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-01-09 18:54:41,112 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 18:54:41,122 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;@1dff937e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 18:54:41,123 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 18:54:41,127 INFO L276 IsEmpty]: Start isEmpty. Operand has 543 states, 387 states have (on average 1.3281653746770026) internal successors, (514), 408 states have internal predecessors, (514), 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-01-09 18:54:41,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-01-09 18:54:41,138 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:54:41,139 INFO L218 NwaCegarLoop]: trace histogram [8, 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] [2025-01-09 18:54:41,139 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:54:41,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:54:41,144 INFO L85 PathProgramCache]: Analyzing trace with hash -205434704, now seen corresponding path program 1 times [2025-01-09 18:54:41,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:54:41,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699249267] [2025-01-09 18:54:41,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:54:41,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:54:41,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-01-09 18:54:42,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-01-09 18:54:42,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:54:42,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:54:42,364 INFO L134 CoverageAnalysis]: Checked inductivity of 350 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2025-01-09 18:54:42,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:54:42,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699249267] [2025-01-09 18:54:42,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699249267] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 18:54:42,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1131129977] [2025-01-09 18:54:42,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:54:42,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 18:54:42,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 18:54:42,371 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 18:54:42,376 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 18:54:43,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-01-09 18:54:43,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-01-09 18:54:43,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:54:43,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:54:43,351 INFO L256 TraceCheckSpWp]: Trace formula consists of 1915 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 18:54:43,357 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 18:54:43,372 INFO L134 CoverageAnalysis]: Checked inductivity of 350 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 305 trivial. 0 not checked. [2025-01-09 18:54:43,372 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 18:54:43,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1131129977] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:54:43,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 18:54:43,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 18:54:43,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905313646] [2025-01-09 18:54:43,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:54:43,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 18:54:43,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:54:43,390 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 18:54:43,391 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 18:54:43,394 INFO L87 Difference]: Start difference. First operand has 543 states, 387 states have (on average 1.3281653746770026) internal successors, (514), 408 states have internal predecessors, (514), 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 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 18:54:43,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:54:43,444 INFO L93 Difference]: Finished difference Result 1081 states and 1510 transitions. [2025-01-09 18:54:43,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 18:54:43,445 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 168 [2025-01-09 18:54:43,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:54:43,455 INFO L225 Difference]: With dead ends: 1081 [2025-01-09 18:54:43,455 INFO L226 Difference]: Without dead ends: 532 [2025-01-09 18:54:43,463 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 18:54:43,465 INFO L435 NwaCegarLoop]: 727 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 727 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 18:54:43,465 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 727 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 18:54:43,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2025-01-09 18:54:43,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 532. [2025-01-09 18:54:43,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 532 states, 382 states have (on average 1.3089005235602094) internal successors, (500), 397 states have internal predecessors, (500), 111 states have call successors, (111), 39 states have call predecessors, (111), 38 states have return successors, (103), 103 states have call predecessors, (103), 103 states have call successors, (103) [2025-01-09 18:54:43,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 714 transitions. [2025-01-09 18:54:43,537 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 714 transitions. Word has length 168 [2025-01-09 18:54:43,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:54:43,538 INFO L471 AbstractCegarLoop]: Abstraction has 532 states and 714 transitions. [2025-01-09 18:54:43,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 18:54:43,538 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 714 transitions. [2025-01-09 18:54:43,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-01-09 18:54:43,540 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:54:43,540 INFO L218 NwaCegarLoop]: trace histogram [8, 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] [2025-01-09 18:54:43,551 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 18:54:43,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 18:54:43,741 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:54:43,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:54:43,742 INFO L85 PathProgramCache]: Analyzing trace with hash 1676755644, now seen corresponding path program 1 times [2025-01-09 18:54:43,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:54:43,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760353456] [2025-01-09 18:54:43,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:54:43,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:54:44,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-01-09 18:54:44,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-01-09 18:54:44,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:54:44,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:54:44,475 INFO L134 CoverageAnalysis]: Checked inductivity of 350 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 350 trivial. 0 not checked. [2025-01-09 18:54:44,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:54:44,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760353456] [2025-01-09 18:54:44,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760353456] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:54:44,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:54:44,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 18:54:44,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27447067] [2025-01-09 18:54:44,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:54:44,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 18:54:44,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:54:44,480 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 18:54:44,480 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:54:44,480 INFO L87 Difference]: Start difference. First operand 532 states and 714 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-01-09 18:54:48,519 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 18:54:48,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:54:48,642 INFO L93 Difference]: Finished difference Result 1503 states and 2015 transitions. [2025-01-09 18:54:48,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 18:54:48,643 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 168 [2025-01-09 18:54:48,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:54:48,649 INFO L225 Difference]: With dead ends: 1503 [2025-01-09 18:54:48,649 INFO L226 Difference]: Without dead ends: 1007 [2025-01-09 18:54:48,651 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-01-09 18:54:48,651 INFO L435 NwaCegarLoop]: 727 mSDtfsCounter, 639 mSDsluCounter, 692 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 639 SdHoareTripleChecker+Valid, 1419 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-01-09 18:54:48,652 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [639 Valid, 1419 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-01-09 18:54:48,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1007 states. [2025-01-09 18:54:48,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1007 to 1001. [2025-01-09 18:54:48,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1001 states, 726 states have (on average 1.31267217630854) internal successors, (953), 749 states have internal predecessors, (953), 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-01-09 18:54:48,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1001 states to 1001 states and 1343 transitions. [2025-01-09 18:54:48,698 INFO L78 Accepts]: Start accepts. Automaton has 1001 states and 1343 transitions. Word has length 168 [2025-01-09 18:54:48,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:54:48,698 INFO L471 AbstractCegarLoop]: Abstraction has 1001 states and 1343 transitions. [2025-01-09 18:54:48,699 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-01-09 18:54:48,699 INFO L276 IsEmpty]: Start isEmpty. Operand 1001 states and 1343 transitions. [2025-01-09 18:54:48,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-01-09 18:54:48,701 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:54:48,701 INFO L218 NwaCegarLoop]: trace histogram [8, 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-01-09 18:54:48,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 18:54:48,701 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:54:48,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:54:48,702 INFO L85 PathProgramCache]: Analyzing trace with hash -558984291, now seen corresponding path program 1 times [2025-01-09 18:54:48,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:54:48,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034630860] [2025-01-09 18:54:48,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:54:48,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:54:49,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-01-09 18:54:49,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-01-09 18:54:49,255 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:54:49,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:54:49,363 INFO L134 CoverageAnalysis]: Checked inductivity of 350 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 350 trivial. 0 not checked. [2025-01-09 18:54:49,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:54:49,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034630860] [2025-01-09 18:54:49,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034630860] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:54:49,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:54:49,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 18:54:49,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048037318] [2025-01-09 18:54:49,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:54:49,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 18:54:49,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:54:49,365 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 18:54:49,365 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:54:49,365 INFO L87 Difference]: Start difference. First operand 1001 states and 1343 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 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-01-09 18:54:49,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:54:49,473 INFO L93 Difference]: Finished difference Result 2451 states and 3233 transitions. [2025-01-09 18:54:49,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 18:54:49,474 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), 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 175 [2025-01-09 18:54:49,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:54:49,481 INFO L225 Difference]: With dead ends: 2451 [2025-01-09 18:54:49,481 INFO L226 Difference]: Without dead ends: 1486 [2025-01-09 18:54:49,483 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-01-09 18:54:49,484 INFO L435 NwaCegarLoop]: 726 mSDtfsCounter, 402 mSDsluCounter, 582 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 402 SdHoareTripleChecker+Valid, 1308 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 18:54:49,484 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [402 Valid, 1308 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 18:54:49,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1486 states. [2025-01-09 18:54:49,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1486 to 1460. [2025-01-09 18:54:49,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1460 states, 1058 states have (on average 1.2911153119092627) internal successors, (1366), 1097 states have internal predecessors, (1366), 272 states have call successors, (272), 132 states have call predecessors, (272), 129 states have return successors, (272), 256 states have call predecessors, (272), 264 states have call successors, (272) [2025-01-09 18:54:49,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1460 states to 1460 states and 1910 transitions. [2025-01-09 18:54:49,558 INFO L78 Accepts]: Start accepts. Automaton has 1460 states and 1910 transitions. Word has length 175 [2025-01-09 18:54:49,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:54:49,559 INFO L471 AbstractCegarLoop]: Abstraction has 1460 states and 1910 transitions. [2025-01-09 18:54:49,560 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), 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-01-09 18:54:49,560 INFO L276 IsEmpty]: Start isEmpty. Operand 1460 states and 1910 transitions. [2025-01-09 18:54:49,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-01-09 18:54:49,562 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:54:49,562 INFO L218 NwaCegarLoop]: trace histogram [8, 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-01-09 18:54:49,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 18:54:49,563 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:54:49,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:54:49,563 INFO L85 PathProgramCache]: Analyzing trace with hash -1973412285, now seen corresponding path program 1 times [2025-01-09 18:54:49,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:54:49,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534414023] [2025-01-09 18:54:49,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:54:49,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:54:49,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-01-09 18:54:49,978 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-01-09 18:54:49,979 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:54:49,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:54:50,085 INFO L134 CoverageAnalysis]: Checked inductivity of 350 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 350 trivial. 0 not checked. [2025-01-09 18:54:50,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:54:50,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534414023] [2025-01-09 18:54:50,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534414023] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:54:50,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:54:50,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 18:54:50,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736747678] [2025-01-09 18:54:50,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:54:50,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 18:54:50,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:54:50,087 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 18:54:50,087 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:54:50,088 INFO L87 Difference]: Start difference. First operand 1460 states and 1910 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 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-01-09 18:54:50,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:54:50,169 INFO L93 Difference]: Finished difference Result 1482 states and 1936 transitions. [2025-01-09 18:54:50,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 18:54:50,170 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 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 173 [2025-01-09 18:54:50,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:54:50,180 INFO L225 Difference]: With dead ends: 1482 [2025-01-09 18:54:50,180 INFO L226 Difference]: Without dead ends: 1471 [2025-01-09 18:54:50,181 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-01-09 18:54:50,185 INFO L435 NwaCegarLoop]: 726 mSDtfsCounter, 709 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 709 SdHoareTripleChecker+Valid, 739 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 18:54:50,186 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [709 Valid, 739 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 18:54:50,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1471 states. [2025-01-09 18:54:50,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1471 to 1460. [2025-01-09 18:54:50,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1460 states, 1058 states have (on average 1.289224952741021) internal successors, (1364), 1097 states have internal predecessors, (1364), 272 states have call successors, (272), 132 states have call predecessors, (272), 129 states have return successors, (272), 256 states have call predecessors, (272), 264 states have call successors, (272) [2025-01-09 18:54:50,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1460 states to 1460 states and 1908 transitions. [2025-01-09 18:54:50,233 INFO L78 Accepts]: Start accepts. Automaton has 1460 states and 1908 transitions. Word has length 173 [2025-01-09 18:54:50,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:54:50,233 INFO L471 AbstractCegarLoop]: Abstraction has 1460 states and 1908 transitions. [2025-01-09 18:54:50,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 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-01-09 18:54:50,233 INFO L276 IsEmpty]: Start isEmpty. Operand 1460 states and 1908 transitions. [2025-01-09 18:54:50,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-01-09 18:54:50,234 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:54:50,235 INFO L218 NwaCegarLoop]: trace histogram [8, 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-01-09 18:54:50,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 18:54:50,235 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:54:50,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:54:50,235 INFO L85 PathProgramCache]: Analyzing trace with hash -1916153983, now seen corresponding path program 1 times [2025-01-09 18:54:50,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:54:50,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772159000] [2025-01-09 18:54:50,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:54:50,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:54:50,609 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-01-09 18:54:50,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-01-09 18:54:50,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:54:50,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:54:50,771 INFO L134 CoverageAnalysis]: Checked inductivity of 350 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 350 trivial. 0 not checked. [2025-01-09 18:54:50,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:54:50,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772159000] [2025-01-09 18:54:50,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772159000] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:54:50,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:54:50,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 18:54:50,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944578563] [2025-01-09 18:54:50,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:54:50,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 18:54:50,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:54:50,774 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 18:54:50,774 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:54:50,775 INFO L87 Difference]: Start difference. First operand 1460 states and 1908 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 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-01-09 18:54:50,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:54:50,809 INFO L93 Difference]: Finished difference Result 1462 states and 1909 transitions. [2025-01-09 18:54:50,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 18:54:50,810 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 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 173 [2025-01-09 18:54:50,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:54:50,816 INFO L225 Difference]: With dead ends: 1462 [2025-01-09 18:54:50,817 INFO L226 Difference]: Without dead ends: 1459 [2025-01-09 18:54:50,818 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-01-09 18:54:50,819 INFO L435 NwaCegarLoop]: 711 mSDtfsCounter, 666 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 666 SdHoareTripleChecker+Valid, 711 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 18:54:50,819 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [666 Valid, 711 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 18:54:50,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1459 states. [2025-01-09 18:54:50,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1459 to 1459. [2025-01-09 18:54:50,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1459 states, 1058 states have (on average 1.2882797731568998) internal successors, (1363), 1096 states have internal predecessors, (1363), 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-01-09 18:54:50,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1459 states to 1459 states and 1906 transitions. [2025-01-09 18:54:50,871 INFO L78 Accepts]: Start accepts. Automaton has 1459 states and 1906 transitions. Word has length 173 [2025-01-09 18:54:50,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:54:50,872 INFO L471 AbstractCegarLoop]: Abstraction has 1459 states and 1906 transitions. [2025-01-09 18:54:50,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 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-01-09 18:54:50,872 INFO L276 IsEmpty]: Start isEmpty. Operand 1459 states and 1906 transitions. [2025-01-09 18:54:50,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-01-09 18:54:50,873 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:54:50,873 INFO L218 NwaCegarLoop]: trace histogram [8, 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] [2025-01-09 18:54:50,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 18:54:50,873 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:54:50,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:54:50,874 INFO L85 PathProgramCache]: Analyzing trace with hash 728662927, now seen corresponding path program 1 times [2025-01-09 18:54:50,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:54:50,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079080113] [2025-01-09 18:54:50,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:54:50,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:54:51,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-01-09 18:54:51,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-01-09 18:54:51,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:54:51,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:54:51,574 INFO L134 CoverageAnalysis]: Checked inductivity of 350 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 350 trivial. 0 not checked. [2025-01-09 18:54:51,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:54:51,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079080113] [2025-01-09 18:54:51,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079080113] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:54:51,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:54:51,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 18:54:51,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228760440] [2025-01-09 18:54:51,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:54:51,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 18:54:51,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:54:51,576 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 18:54:51,576 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:54:51,576 INFO L87 Difference]: Start difference. First operand 1459 states and 1906 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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-01-09 18:54:51,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:54:51,612 INFO L93 Difference]: Finished difference Result 1461 states and 1907 transitions. [2025-01-09 18:54:51,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 18:54:51,612 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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 174 [2025-01-09 18:54:51,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:54:51,618 INFO L225 Difference]: With dead ends: 1461 [2025-01-09 18:54:51,618 INFO L226 Difference]: Without dead ends: 1458 [2025-01-09 18:54:51,619 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-01-09 18:54:51,620 INFO L435 NwaCegarLoop]: 709 mSDtfsCounter, 663 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 663 SdHoareTripleChecker+Valid, 709 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 18:54:51,620 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [663 Valid, 709 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 18:54:51,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1458 states. [2025-01-09 18:54:51,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1458 to 1458. [2025-01-09 18:54:51,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1458 states, 1058 states have (on average 1.287334593572779) internal successors, (1362), 1095 states have internal predecessors, (1362), 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-01-09 18:54:51,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1458 states to 1458 states and 1904 transitions. [2025-01-09 18:54:51,667 INFO L78 Accepts]: Start accepts. Automaton has 1458 states and 1904 transitions. Word has length 174 [2025-01-09 18:54:51,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:54:51,667 INFO L471 AbstractCegarLoop]: Abstraction has 1458 states and 1904 transitions. [2025-01-09 18:54:51,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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-01-09 18:54:51,667 INFO L276 IsEmpty]: Start isEmpty. Operand 1458 states and 1904 transitions. [2025-01-09 18:54:51,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-01-09 18:54:51,669 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:54:51,669 INFO L218 NwaCegarLoop]: trace histogram [8, 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, 1, 1, 1] [2025-01-09 18:54:51,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 18:54:51,669 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:54:51,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:54:51,670 INFO L85 PathProgramCache]: Analyzing trace with hash 1158057193, now seen corresponding path program 1 times [2025-01-09 18:54:51,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:54:51,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037513218] [2025-01-09 18:54:51,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:54:51,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:54:52,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-01-09 18:54:52,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-01-09 18:54:52,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:54:52,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:54:52,167 INFO L134 CoverageAnalysis]: Checked inductivity of 350 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 350 trivial. 0 not checked. [2025-01-09 18:54:52,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:54:52,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037513218] [2025-01-09 18:54:52,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037513218] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:54:52,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:54:52,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 18:54:52,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715563608] [2025-01-09 18:54:52,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:54:52,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 18:54:52,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:54:52,169 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 18:54:52,169 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:54:52,169 INFO L87 Difference]: Start difference. First operand 1458 states and 1904 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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-01-09 18:54:52,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:54:52,307 INFO L93 Difference]: Finished difference Result 3769 states and 4898 transitions. [2025-01-09 18:54:52,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 18:54:52,307 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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 178 [2025-01-09 18:54:52,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:54:52,317 INFO L225 Difference]: With dead ends: 3769 [2025-01-09 18:54:52,317 INFO L226 Difference]: Without dead ends: 2357 [2025-01-09 18:54:52,321 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-01-09 18:54:52,322 INFO L435 NwaCegarLoop]: 1077 mSDtfsCounter, 548 mSDsluCounter, 642 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 548 SdHoareTripleChecker+Valid, 1719 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 18:54:52,322 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [548 Valid, 1719 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 18:54:52,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2357 states. [2025-01-09 18:54:52,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2357 to 2330. [2025-01-09 18:54:52,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2330 states, 1717 states have (on average 1.2935352358765289) internal successors, (2221), 1762 states have internal predecessors, (2221), 396 states have call successors, (396), 219 states have call predecessors, (396), 216 states have return successors, (404), 382 states have call predecessors, (404), 390 states have call successors, (404) [2025-01-09 18:54:52,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2330 states to 2330 states and 3021 transitions. [2025-01-09 18:54:52,433 INFO L78 Accepts]: Start accepts. Automaton has 2330 states and 3021 transitions. Word has length 178 [2025-01-09 18:54:52,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:54:52,435 INFO L471 AbstractCegarLoop]: Abstraction has 2330 states and 3021 transitions. [2025-01-09 18:54:52,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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-01-09 18:54:52,435 INFO L276 IsEmpty]: Start isEmpty. Operand 2330 states and 3021 transitions. [2025-01-09 18:54:52,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-01-09 18:54:52,437 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:54:52,437 INFO L218 NwaCegarLoop]: trace histogram [8, 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-01-09 18:54:52,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 18:54:52,437 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:54:52,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:54:52,438 INFO L85 PathProgramCache]: Analyzing trace with hash 1113613380, now seen corresponding path program 1 times [2025-01-09 18:54:52,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:54:52,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388782000] [2025-01-09 18:54:52,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:54:52,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:54:52,787 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-01-09 18:54:52,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-01-09 18:54:52,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:54:52,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:54:52,946 INFO L134 CoverageAnalysis]: Checked inductivity of 350 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 350 trivial. 0 not checked. [2025-01-09 18:54:52,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:54:52,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388782000] [2025-01-09 18:54:52,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388782000] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:54:52,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:54:52,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 18:54:52,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010684715] [2025-01-09 18:54:52,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:54:52,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 18:54:52,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:54:52,948 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 18:54:52,948 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:54:52,948 INFO L87 Difference]: Start difference. First operand 2330 states and 3021 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 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-01-09 18:54:53,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:54:53,010 INFO L93 Difference]: Finished difference Result 2332 states and 3022 transitions. [2025-01-09 18:54:53,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 18:54:53,011 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 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 175 [2025-01-09 18:54:53,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:54:53,020 INFO L225 Difference]: With dead ends: 2332 [2025-01-09 18:54:53,020 INFO L226 Difference]: Without dead ends: 2329 [2025-01-09 18:54:53,021 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-01-09 18:54:53,022 INFO L435 NwaCegarLoop]: 707 mSDtfsCounter, 660 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 660 SdHoareTripleChecker+Valid, 707 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 18:54:53,022 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [660 Valid, 707 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 18:54:53,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2329 states. [2025-01-09 18:54:53,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2329 to 2329. [2025-01-09 18:54:53,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2329 states, 1717 states have (on average 1.2929528246942341) internal successors, (2220), 1761 states have internal predecessors, (2220), 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-01-09 18:54:53,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2329 states to 2329 states and 3019 transitions. [2025-01-09 18:54:53,118 INFO L78 Accepts]: Start accepts. Automaton has 2329 states and 3019 transitions. Word has length 175 [2025-01-09 18:54:53,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:54:53,119 INFO L471 AbstractCegarLoop]: Abstraction has 2329 states and 3019 transitions. [2025-01-09 18:54:53,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 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-01-09 18:54:53,119 INFO L276 IsEmpty]: Start isEmpty. Operand 2329 states and 3019 transitions. [2025-01-09 18:54:53,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-01-09 18:54:53,120 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:54:53,120 INFO L218 NwaCegarLoop]: trace histogram [8, 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, 1] [2025-01-09 18:54:53,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 18:54:53,120 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:54:53,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:54:53,121 INFO L85 PathProgramCache]: Analyzing trace with hash 162180402, now seen corresponding path program 1 times [2025-01-09 18:54:53,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:54:53,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541449790] [2025-01-09 18:54:53,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:54:53,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:54:53,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-01-09 18:54:53,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-01-09 18:54:53,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:54:53,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:54:53,680 INFO L134 CoverageAnalysis]: Checked inductivity of 350 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 350 trivial. 0 not checked. [2025-01-09 18:54:53,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:54:53,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541449790] [2025-01-09 18:54:53,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541449790] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:54:53,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:54:53,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 18:54:53,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721456885] [2025-01-09 18:54:53,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:54:53,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 18:54:53,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:54:53,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 18:54:53,682 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:54:53,682 INFO L87 Difference]: Start difference. First operand 2329 states and 3019 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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-01-09 18:54:53,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:54:53,915 INFO L93 Difference]: Finished difference Result 6413 states and 8465 transitions. [2025-01-09 18:54:53,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 18:54:53,916 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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 176 [2025-01-09 18:54:53,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:54:53,934 INFO L225 Difference]: With dead ends: 6413 [2025-01-09 18:54:53,935 INFO L226 Difference]: Without dead ends: 4126 [2025-01-09 18:54:53,942 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-01-09 18:54:53,945 INFO L435 NwaCegarLoop]: 862 mSDtfsCounter, 645 mSDsluCounter, 559 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 645 SdHoareTripleChecker+Valid, 1421 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 18:54:53,946 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [645 Valid, 1421 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 18:54:53,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4126 states. [2025-01-09 18:54:54,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4126 to 4084. [2025-01-09 18:54:54,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4084 states, 3075 states have (on average 1.3095934959349593) internal successors, (4027), 3158 states have internal predecessors, (4027), 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-01-09 18:54:54,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4084 states to 4084 states and 5403 transitions. [2025-01-09 18:54:54,142 INFO L78 Accepts]: Start accepts. Automaton has 4084 states and 5403 transitions. Word has length 176 [2025-01-09 18:54:54,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:54:54,142 INFO L471 AbstractCegarLoop]: Abstraction has 4084 states and 5403 transitions. [2025-01-09 18:54:54,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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-01-09 18:54:54,143 INFO L276 IsEmpty]: Start isEmpty. Operand 4084 states and 5403 transitions. [2025-01-09 18:54:54,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2025-01-09 18:54:54,147 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:54:54,148 INFO L218 NwaCegarLoop]: trace histogram [8, 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, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 18:54:54,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 18:54:54,148 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:54:54,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:54:54,148 INFO L85 PathProgramCache]: Analyzing trace with hash 908328443, now seen corresponding path program 1 times [2025-01-09 18:54:54,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:54:54,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373184645] [2025-01-09 18:54:54,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:54:54,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:54:54,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 230 statements into 1 equivalence classes. [2025-01-09 18:54:54,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 230 of 230 statements. [2025-01-09 18:54:54,550 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:54:54,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:54:54,722 INFO L134 CoverageAnalysis]: Checked inductivity of 436 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 434 trivial. 0 not checked. [2025-01-09 18:54:54,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:54:54,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373184645] [2025-01-09 18:54:54,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373184645] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:54:54,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:54:54,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 18:54:54,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495593374] [2025-01-09 18:54:54,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:54:54,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 18:54:54,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:54:54,723 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 18:54:54,723 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:54:54,723 INFO L87 Difference]: Start difference. First operand 4084 states and 5403 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 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-01-09 18:54:58,735 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 18:54:58,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:54:58,984 INFO L93 Difference]: Finished difference Result 9760 states and 12931 transitions. [2025-01-09 18:54:58,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 18:54:58,985 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 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 230 [2025-01-09 18:54:58,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:54:59,009 INFO L225 Difference]: With dead ends: 9760 [2025-01-09 18:54:59,010 INFO L226 Difference]: Without dead ends: 5726 [2025-01-09 18:54:59,021 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-01-09 18:54:59,021 INFO L435 NwaCegarLoop]: 1104 mSDtfsCounter, 599 mSDsluCounter, 590 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 6 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 599 SdHoareTripleChecker+Valid, 1694 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-01-09 18:54:59,022 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [599 Valid, 1694 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 20 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-01-09 18:54:59,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5726 states. [2025-01-09 18:54:59,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5726 to 5678. [2025-01-09 18:54:59,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5678 states, 4327 states have (on average 1.3143055234573608) internal successors, (5687), 4422 states have internal predecessors, (5687), 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-01-09 18:54:59,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5678 states to 5678 states and 7499 transitions. [2025-01-09 18:54:59,235 INFO L78 Accepts]: Start accepts. Automaton has 5678 states and 7499 transitions. Word has length 230 [2025-01-09 18:54:59,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:54:59,236 INFO L471 AbstractCegarLoop]: Abstraction has 5678 states and 7499 transitions. [2025-01-09 18:54:59,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 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-01-09 18:54:59,239 INFO L276 IsEmpty]: Start isEmpty. Operand 5678 states and 7499 transitions. [2025-01-09 18:54:59,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2025-01-09 18:54:59,242 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:54:59,243 INFO L218 NwaCegarLoop]: trace histogram [8, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 18:54:59,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 18:54:59,243 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:54:59,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:54:59,243 INFO L85 PathProgramCache]: Analyzing trace with hash 1621206871, now seen corresponding path program 1 times [2025-01-09 18:54:59,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:54:59,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075638246] [2025-01-09 18:54:59,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:54:59,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:54:59,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 260 statements into 1 equivalence classes. [2025-01-09 18:54:59,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 260 of 260 statements. [2025-01-09 18:54:59,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:54:59,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:54:59,960 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 436 trivial. 0 not checked. [2025-01-09 18:54:59,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:54:59,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075638246] [2025-01-09 18:54:59,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075638246] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:54:59,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:54:59,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 18:54:59,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84875699] [2025-01-09 18:54:59,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:54:59,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 18:54:59,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:54:59,963 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 18:54:59,964 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 18:54:59,965 INFO L87 Difference]: Start difference. First operand 5678 states and 7499 transitions. Second operand has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 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-01-09 18:55:03,978 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 18:55:04,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:55:04,303 INFO L93 Difference]: Finished difference Result 13636 states and 17961 transitions. [2025-01-09 18:55:04,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 18:55:04,303 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 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 260 [2025-01-09 18:55:04,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:55:04,351 INFO L225 Difference]: With dead ends: 13636 [2025-01-09 18:55:04,352 INFO L226 Difference]: Without dead ends: 8008 [2025-01-09 18:55:04,367 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-01-09 18:55:04,368 INFO L435 NwaCegarLoop]: 1322 mSDtfsCounter, 617 mSDsluCounter, 2018 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 617 SdHoareTripleChecker+Valid, 3340 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-01-09 18:55:04,368 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [617 Valid, 3340 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-01-09 18:55:04,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8008 states. [2025-01-09 18:55:04,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8008 to 5694. [2025-01-09 18:55:04,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5694 states, 4343 states have (on average 1.3131475938291504) internal successors, (5703), 4438 states have internal predecessors, (5703), 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-01-09 18:55:04,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5694 states to 5694 states and 7515 transitions. [2025-01-09 18:55:04,627 INFO L78 Accepts]: Start accepts. Automaton has 5694 states and 7515 transitions. Word has length 260 [2025-01-09 18:55:04,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:55:04,628 INFO L471 AbstractCegarLoop]: Abstraction has 5694 states and 7515 transitions. [2025-01-09 18:55:04,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 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-01-09 18:55:04,628 INFO L276 IsEmpty]: Start isEmpty. Operand 5694 states and 7515 transitions. [2025-01-09 18:55:04,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2025-01-09 18:55:04,631 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:55:04,631 INFO L218 NwaCegarLoop]: trace histogram [8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 18:55:04,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 18:55:04,632 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:55:04,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:55:04,632 INFO L85 PathProgramCache]: Analyzing trace with hash -1407473805, now seen corresponding path program 1 times [2025-01-09 18:55:04,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:55:04,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867145662] [2025-01-09 18:55:04,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:55:04,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:55:04,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 260 statements into 1 equivalence classes. [2025-01-09 18:55:05,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 260 of 260 statements. [2025-01-09 18:55:05,021 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:55:05,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:55:05,173 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 440 trivial. 0 not checked. [2025-01-09 18:55:05,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:55:05,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867145662] [2025-01-09 18:55:05,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867145662] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:55:05,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:55:05,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 18:55:05,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020997354] [2025-01-09 18:55:05,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:55:05,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 18:55:05,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:55:05,176 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 18:55:05,176 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:55:05,176 INFO L87 Difference]: Start difference. First operand 5694 states and 7515 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 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-01-09 18:55:05,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:55:05,340 INFO L93 Difference]: Finished difference Result 11338 states and 14987 transitions. [2025-01-09 18:55:05,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 18:55:05,341 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 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 260 [2025-01-09 18:55:05,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:55:05,362 INFO L225 Difference]: With dead ends: 11338 [2025-01-09 18:55:05,362 INFO L226 Difference]: Without dead ends: 5694 [2025-01-09 18:55:05,375 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-01-09 18:55:05,375 INFO L435 NwaCegarLoop]: 702 mSDtfsCounter, 0 mSDsluCounter, 696 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1398 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 18:55:05,376 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1398 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 18:55:05,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5694 states. [2025-01-09 18:55:05,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5694 to 5694. [2025-01-09 18:55:05,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5694 states, 4343 states have (on average 1.302095325811651) internal successors, (5655), 4438 states have internal predecessors, (5655), 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-01-09 18:55:05,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5694 states to 5694 states and 7467 transitions. [2025-01-09 18:55:05,571 INFO L78 Accepts]: Start accepts. Automaton has 5694 states and 7467 transitions. Word has length 260 [2025-01-09 18:55:05,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:55:05,572 INFO L471 AbstractCegarLoop]: Abstraction has 5694 states and 7467 transitions. [2025-01-09 18:55:05,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 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-01-09 18:55:05,572 INFO L276 IsEmpty]: Start isEmpty. Operand 5694 states and 7467 transitions. [2025-01-09 18:55:05,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2025-01-09 18:55:05,574 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:55:05,574 INFO L218 NwaCegarLoop]: trace histogram [8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 18:55:05,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 18:55:05,575 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:55:05,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:55:05,575 INFO L85 PathProgramCache]: Analyzing trace with hash 1373568888, now seen corresponding path program 1 times [2025-01-09 18:55:05,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:55:05,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421695705] [2025-01-09 18:55:05,575 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:55:05,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:55:05,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 262 statements into 1 equivalence classes. [2025-01-09 18:55:05,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 262 of 262 statements. [2025-01-09 18:55:05,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:55:05,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:55:06,176 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 440 trivial. 0 not checked. [2025-01-09 18:55:06,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:55:06,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421695705] [2025-01-09 18:55:06,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421695705] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:55:06,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:55:06,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 18:55:06,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944834468] [2025-01-09 18:55:06,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:55:06,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 18:55:06,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:55:06,180 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 18:55:06,180 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:55:06,180 INFO L87 Difference]: Start difference. First operand 5694 states and 7467 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 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-01-09 18:55:10,193 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 18:55:10,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:55:10,400 INFO L93 Difference]: Finished difference Result 11340 states and 14872 transitions. [2025-01-09 18:55:10,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 18:55:10,400 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 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 262 [2025-01-09 18:55:10,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:55:10,418 INFO L225 Difference]: With dead ends: 11340 [2025-01-09 18:55:10,418 INFO L226 Difference]: Without dead ends: 5696 [2025-01-09 18:55:10,431 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-01-09 18:55:10,431 INFO L435 NwaCegarLoop]: 1031 mSDtfsCounter, 553 mSDsluCounter, 667 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 553 SdHoareTripleChecker+Valid, 1698 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-01-09 18:55:10,432 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [553 Valid, 1698 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 10 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-01-09 18:55:10,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5696 states. [2025-01-09 18:55:10,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5696 to 5567. [2025-01-09 18:55:10,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5567 states, 4265 states have (on average 1.3010550996483001) internal successors, (5549), 4352 states have internal predecessors, (5549), 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-01-09 18:55:10,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5567 states to 5567 states and 7217 transitions. [2025-01-09 18:55:10,709 INFO L78 Accepts]: Start accepts. Automaton has 5567 states and 7217 transitions. Word has length 262 [2025-01-09 18:55:10,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:55:10,709 INFO L471 AbstractCegarLoop]: Abstraction has 5567 states and 7217 transitions. [2025-01-09 18:55:10,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 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-01-09 18:55:10,710 INFO L276 IsEmpty]: Start isEmpty. Operand 5567 states and 7217 transitions. [2025-01-09 18:55:10,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2025-01-09 18:55:10,712 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:55:10,712 INFO L218 NwaCegarLoop]: trace histogram [8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 18:55:10,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 18:55:10,713 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:55:10,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:55:10,713 INFO L85 PathProgramCache]: Analyzing trace with hash 93705210, now seen corresponding path program 1 times [2025-01-09 18:55:10,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:55:10,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200364007] [2025-01-09 18:55:10,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:55:10,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:55:11,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 262 statements into 1 equivalence classes. [2025-01-09 18:55:11,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 262 of 262 statements. [2025-01-09 18:55:11,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:55:11,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:55:11,504 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 440 trivial. 0 not checked. [2025-01-09 18:55:11,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:55:11,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200364007] [2025-01-09 18:55:11,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200364007] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:55:11,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:55:11,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 18:55:11,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448828859] [2025-01-09 18:55:11,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:55:11,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 18:55:11,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:55:11,507 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 18:55:11,507 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 18:55:11,507 INFO L87 Difference]: Start difference. First operand 5567 states and 7217 transitions. Second operand has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 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-01-09 18:55:11,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:55:11,673 INFO L93 Difference]: Finished difference Result 5594 states and 7253 transitions. [2025-01-09 18:55:11,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 18:55:11,673 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 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 262 [2025-01-09 18:55:11,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:55:11,688 INFO L225 Difference]: With dead ends: 5594 [2025-01-09 18:55:11,688 INFO L226 Difference]: Without dead ends: 5572 [2025-01-09 18:55:11,689 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-01-09 18:55:11,689 INFO L435 NwaCegarLoop]: 711 mSDtfsCounter, 1 mSDsluCounter, 2108 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2819 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 18:55:11,689 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2819 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 18:55:11,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5572 states. [2025-01-09 18:55:11,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5572 to 5558. [2025-01-09 18:55:11,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5558 states, 4261 states have (on average 1.3003989673785497) internal successors, (5541), 4345 states have internal predecessors, (5541), 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-01-09 18:55:11,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5558 states to 5558 states and 7202 transitions. [2025-01-09 18:55:11,899 INFO L78 Accepts]: Start accepts. Automaton has 5558 states and 7202 transitions. Word has length 262 [2025-01-09 18:55:11,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:55:11,899 INFO L471 AbstractCegarLoop]: Abstraction has 5558 states and 7202 transitions. [2025-01-09 18:55:11,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 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-01-09 18:55:11,900 INFO L276 IsEmpty]: Start isEmpty. Operand 5558 states and 7202 transitions. [2025-01-09 18:55:11,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2025-01-09 18:55:11,902 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:55:11,902 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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] [2025-01-09 18:55:11,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 18:55:11,903 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:55:11,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:55:11,903 INFO L85 PathProgramCache]: Analyzing trace with hash -886510679, now seen corresponding path program 1 times [2025-01-09 18:55:11,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:55:11,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084263482] [2025-01-09 18:55:11,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:55:11,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:55:12,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 295 statements into 1 equivalence classes. [2025-01-09 18:55:12,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 295 of 295 statements. [2025-01-09 18:55:12,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:55:12,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:55:12,582 INFO L134 CoverageAnalysis]: Checked inductivity of 447 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 447 trivial. 0 not checked. [2025-01-09 18:55:12,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:55:12,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084263482] [2025-01-09 18:55:12,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084263482] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:55:12,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:55:12,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 18:55:12,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242344756] [2025-01-09 18:55:12,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:55:12,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 18:55:12,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:55:12,585 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 18:55:12,585 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 18:55:12,585 INFO L87 Difference]: Start difference. First operand 5558 states and 7202 transitions. Second operand has 5 states, 5 states have (on average 23.2) internal successors, (116), 5 states have internal predecessors, (116), 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-01-09 18:55:12,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:55:12,842 INFO L93 Difference]: Finished difference Result 11052 states and 14329 transitions. [2025-01-09 18:55:12,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 18:55:12,843 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.2) internal successors, (116), 5 states have internal predecessors, (116), 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 295 [2025-01-09 18:55:12,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:55:12,861 INFO L225 Difference]: With dead ends: 11052 [2025-01-09 18:55:12,862 INFO L226 Difference]: Without dead ends: 5544 [2025-01-09 18:55:12,871 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-01-09 18:55:12,871 INFO L435 NwaCegarLoop]: 701 mSDtfsCounter, 0 mSDsluCounter, 2087 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2788 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 18:55:12,872 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2788 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 18:55:12,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5544 states. [2025-01-09 18:55:13,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5544 to 5544. [2025-01-09 18:55:13,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5544 states, 4255 states have (on average 1.299882491186839) internal successors, (5531), 4335 states have internal predecessors, (5531), 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-01-09 18:55:13,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5544 states to 5544 states and 7184 transitions. [2025-01-09 18:55:13,048 INFO L78 Accepts]: Start accepts. Automaton has 5544 states and 7184 transitions. Word has length 295 [2025-01-09 18:55:13,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:55:13,049 INFO L471 AbstractCegarLoop]: Abstraction has 5544 states and 7184 transitions. [2025-01-09 18:55:13,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.2) internal successors, (116), 5 states have internal predecessors, (116), 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-01-09 18:55:13,049 INFO L276 IsEmpty]: Start isEmpty. Operand 5544 states and 7184 transitions. [2025-01-09 18:55:13,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2025-01-09 18:55:13,056 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:55:13,056 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 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, 1, 1, 1, 1, 1, 1] [2025-01-09 18:55:13,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 18:55:13,056 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:55:13,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:55:13,057 INFO L85 PathProgramCache]: Analyzing trace with hash -1844646473, now seen corresponding path program 1 times [2025-01-09 18:55:13,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:55:13,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114501695] [2025-01-09 18:55:13,057 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:55:13,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:55:13,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 351 statements into 1 equivalence classes. [2025-01-09 18:55:13,484 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 351 of 351 statements. [2025-01-09 18:55:13,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:55:13,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:55:14,022 INFO L134 CoverageAnalysis]: Checked inductivity of 660 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 658 trivial. 0 not checked. [2025-01-09 18:55:14,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:55:14,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114501695] [2025-01-09 18:55:14,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114501695] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:55:14,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:55:14,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 18:55:14,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311645914] [2025-01-09 18:55:14,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:55:14,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 18:55:14,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:55:14,023 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 18:55:14,023 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 18:55:14,023 INFO L87 Difference]: Start difference. First operand 5544 states and 7184 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, (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-01-09 18:55:14,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:55:14,315 INFO L93 Difference]: Finished difference Result 5591 states and 7236 transitions. [2025-01-09 18:55:14,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 18:55:14,315 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, (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 351 [2025-01-09 18:55:14,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:55:14,331 INFO L225 Difference]: With dead ends: 5591 [2025-01-09 18:55:14,331 INFO L226 Difference]: Without dead ends: 5499 [2025-01-09 18:55:14,333 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-01-09 18:55:14,334 INFO L435 NwaCegarLoop]: 707 mSDtfsCounter, 1 mSDsluCounter, 2810 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 3517 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 18:55:14,334 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 3517 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 18:55:14,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5499 states. [2025-01-09 18:55:14,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5499 to 5475. [2025-01-09 18:55:14,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5475 states, 4193 states have (on average 1.2940615311233008) internal successors, (5426), 4272 states have internal predecessors, (5426), 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-01-09 18:55:14,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5475 states to 5475 states and 7066 transitions. [2025-01-09 18:55:14,525 INFO L78 Accepts]: Start accepts. Automaton has 5475 states and 7066 transitions. Word has length 351 [2025-01-09 18:55:14,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:55:14,525 INFO L471 AbstractCegarLoop]: Abstraction has 5475 states and 7066 transitions. [2025-01-09 18:55:14,525 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, (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-01-09 18:55:14,526 INFO L276 IsEmpty]: Start isEmpty. Operand 5475 states and 7066 transitions. [2025-01-09 18:55:14,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2025-01-09 18:55:14,533 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:55:14,533 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 18:55:14,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 18:55:14,534 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:55:14,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:55:14,534 INFO L85 PathProgramCache]: Analyzing trace with hash -1329332030, now seen corresponding path program 1 times [2025-01-09 18:55:14,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:55:14,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534375816] [2025-01-09 18:55:14,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:55:14,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:55:15,069 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 358 statements into 1 equivalence classes. [2025-01-09 18:55:15,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 358 of 358 statements. [2025-01-09 18:55:15,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:55:15,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:55:15,565 INFO L134 CoverageAnalysis]: Checked inductivity of 660 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 658 trivial. 0 not checked. [2025-01-09 18:55:15,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:55:15,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534375816] [2025-01-09 18:55:15,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534375816] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:55:15,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:55:15,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 18:55:15,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571592205] [2025-01-09 18:55:15,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:55:15,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 18:55:15,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:55:15,567 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 18:55:15,567 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 18:55:15,568 INFO L87 Difference]: Start difference. First operand 5475 states and 7066 transitions. Second operand has 6 states, 6 states have (on average 24.666666666666668) internal successors, (148), 5 states have internal predecessors, (148), 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-01-09 18:55:15,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:55:15,747 INFO L93 Difference]: Finished difference Result 5661 states and 7243 transitions. [2025-01-09 18:55:15,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 18:55:15,748 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.666666666666668) internal successors, (148), 5 states have internal predecessors, (148), 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 358 [2025-01-09 18:55:15,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:55:15,764 INFO L225 Difference]: With dead ends: 5661 [2025-01-09 18:55:15,765 INFO L226 Difference]: Without dead ends: 5161 [2025-01-09 18:55:15,767 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-01-09 18:55:15,767 INFO L435 NwaCegarLoop]: 705 mSDtfsCounter, 1 mSDsluCounter, 2802 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 3507 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 18:55:15,767 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 3507 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 18:55:15,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5161 states. [2025-01-09 18:55:15,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5161 to 5137. [2025-01-09 18:55:15,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5137 states, 3947 states have (on average 1.2946541677223207) internal successors, (5110), 4014 states have internal predecessors, (5110), 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-01-09 18:55:15,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5137 states to 5137 states and 6612 transitions. [2025-01-09 18:55:15,962 INFO L78 Accepts]: Start accepts. Automaton has 5137 states and 6612 transitions. Word has length 358 [2025-01-09 18:55:15,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:55:15,962 INFO L471 AbstractCegarLoop]: Abstraction has 5137 states and 6612 transitions. [2025-01-09 18:55:15,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.666666666666668) internal successors, (148), 5 states have internal predecessors, (148), 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-01-09 18:55:15,963 INFO L276 IsEmpty]: Start isEmpty. Operand 5137 states and 6612 transitions. [2025-01-09 18:55:15,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2025-01-09 18:55:15,971 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:55:15,972 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 18:55:15,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 18:55:15,972 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:55:15,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:55:15,973 INFO L85 PathProgramCache]: Analyzing trace with hash 923314967, now seen corresponding path program 1 times [2025-01-09 18:55:15,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:55:15,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687559032] [2025-01-09 18:55:15,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:55:15,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:55:16,370 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 360 statements into 1 equivalence classes. [2025-01-09 18:55:16,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 360 of 360 statements. [2025-01-09 18:55:16,402 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:55:16,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:55:16,717 INFO L134 CoverageAnalysis]: Checked inductivity of 667 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 661 trivial. 0 not checked. [2025-01-09 18:55:16,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:55:16,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687559032] [2025-01-09 18:55:16,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687559032] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:55:16,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:55:16,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 18:55:16,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803923146] [2025-01-09 18:55:16,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:55:16,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 18:55:16,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:55:16,720 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 18:55:16,720 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 18:55:16,720 INFO L87 Difference]: Start difference. First operand 5137 states and 6612 transitions. Second operand has 6 states, 6 states have (on average 23.833333333333332) internal successors, (143), 5 states have internal predecessors, (143), 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-01-09 18:55:17,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:55:17,012 INFO L93 Difference]: Finished difference Result 10284 states and 13287 transitions. [2025-01-09 18:55:17,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 18:55:17,013 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 23.833333333333332) internal successors, (143), 5 states have internal predecessors, (143), 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 360 [2025-01-09 18:55:17,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:55:17,032 INFO L225 Difference]: With dead ends: 10284 [2025-01-09 18:55:17,033 INFO L226 Difference]: Without dead ends: 5197 [2025-01-09 18:55:17,042 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-01-09 18:55:17,043 INFO L435 NwaCegarLoop]: 703 mSDtfsCounter, 15 mSDsluCounter, 2797 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 3500 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 18:55:17,043 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 3500 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 18:55:17,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5197 states. [2025-01-09 18:55:17,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5197 to 5173. [2025-01-09 18:55:17,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5173 states, 3983 states have (on average 1.2965101682149134) internal successors, (5164), 4056 states have internal predecessors, (5164), 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-01-09 18:55:17,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5173 states to 5173 states and 6666 transitions. [2025-01-09 18:55:17,306 INFO L78 Accepts]: Start accepts. Automaton has 5173 states and 6666 transitions. Word has length 360 [2025-01-09 18:55:17,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:55:17,307 INFO L471 AbstractCegarLoop]: Abstraction has 5173 states and 6666 transitions. [2025-01-09 18:55:17,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.833333333333332) internal successors, (143), 5 states have internal predecessors, (143), 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-01-09 18:55:17,307 INFO L276 IsEmpty]: Start isEmpty. Operand 5173 states and 6666 transitions. [2025-01-09 18:55:17,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 367 [2025-01-09 18:55:17,320 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:55:17,320 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 18:55:17,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 18:55:17,321 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:55:17,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:55:17,321 INFO L85 PathProgramCache]: Analyzing trace with hash -256670114, now seen corresponding path program 1 times [2025-01-09 18:55:17,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:55:17,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520676566] [2025-01-09 18:55:17,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:55:17,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:55:17,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 366 statements into 1 equivalence classes. [2025-01-09 18:55:17,857 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 366 of 366 statements. [2025-01-09 18:55:17,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:55:17,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:55:18,152 INFO L134 CoverageAnalysis]: Checked inductivity of 668 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 658 trivial. 0 not checked. [2025-01-09 18:55:18,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:55:18,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520676566] [2025-01-09 18:55:18,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520676566] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:55:18,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:55:18,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 18:55:18,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369053113] [2025-01-09 18:55:18,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:55:18,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 18:55:18,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:55:18,154 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 18:55:18,154 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 18:55:18,154 INFO L87 Difference]: Start difference. First operand 5173 states and 6666 transitions. Second operand has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (35), 2 states have call predecessors, (35), 2 states have return successors, (34), 2 states have call predecessors, (34), 1 states have call successors, (34) [2025-01-09 18:55:18,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:55:18,299 INFO L93 Difference]: Finished difference Result 5381 states and 6858 transitions. [2025-01-09 18:55:18,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 18:55:18,299 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (35), 2 states have call predecessors, (35), 2 states have return successors, (34), 2 states have call predecessors, (34), 1 states have call successors, (34) Word has length 366 [2025-01-09 18:55:18,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:55:18,305 INFO L225 Difference]: With dead ends: 5381 [2025-01-09 18:55:18,305 INFO L226 Difference]: Without dead ends: 0 [2025-01-09 18:55:18,312 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-01-09 18:55:18,312 INFO L435 NwaCegarLoop]: 687 mSDtfsCounter, 28 mSDsluCounter, 2698 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 3385 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 18:55:18,312 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 3385 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 18:55:18,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-09 18:55:18,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-09 18:55:18,313 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-01-09 18:55:18,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-09 18:55:18,316 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 366 [2025-01-09 18:55:18,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:55:18,316 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-09 18:55:18,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (35), 2 states have call predecessors, (35), 2 states have return successors, (34), 2 states have call predecessors, (34), 1 states have call successors, (34) [2025-01-09 18:55:18,316 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-09 18:55:18,316 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-09 18:55:18,319 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 18:55:18,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 18:55:18,321 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 18:55:18,322 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-01-09 18:55:46,577 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 18:55:46,587 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 06:55:46 BoogieIcfgContainer [2025-01-09 18:55:46,587 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 18:55:46,588 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 18:55:46,588 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 18:55:46,588 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 18:55:46,592 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 06:54:41" (3/4) ... [2025-01-09 18:55:46,594 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-09 18:55:46,598 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure kfree [2025-01-09 18:55:46,598 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_mutex_unlock_serio_raw_mutex [2025-01-09 18:55:46,598 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure kill_fasync [2025-01-09 18:55:46,598 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_file_operations_2 [2025-01-09 18:55:46,598 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure serio_get_drvdata [2025-01-09 18:55:46,598 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure warn_slowpath_null [2025-01-09 18:55:46,598 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_undef_int [2025-01-09 18:55:46,598 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure list_del_init [2025-01-09 18:55:46,598 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure list_add_tail [2025-01-09 18:55:46,599 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure serio_set_drvdata [2025-01-09 18:55:46,599 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure kref_sub [2025-01-09 18:55:46,599 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure INIT_LIST_HEAD [2025-01-09 18:55:46,599 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure mutex_unlock [2025-01-09 18:55:46,599 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_mutex_lock_interruptible_serio_raw_mutex [2025-01-09 18:55:46,599 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure __might_fault [2025-01-09 18:55:46,599 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_error [2025-01-09 18:55:46,599 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure __dynamic_dev_dbg [2025-01-09 18:55:46,599 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure ##fun~$Pointer$~TO~VOID [2025-01-09 18:55:46,599 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure kzalloc [2025-01-09 18:55:46,599 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_stop [2025-01-09 18:55:46,599 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.meminit [2025-01-09 18:55:46,599 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure misc_register [2025-01-09 18:55:46,599 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure kref_put [2025-01-09 18:55:46,599 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv__builtin_expect [2025-01-09 18:55:46,599 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure serio_raw_disconnect [2025-01-09 18:55:46,599 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure serio_close [2025-01-09 18:55:46,599 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure serio_continue_rx [2025-01-09 18:55:46,599 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_mutex_lock_serio_raw_mutex [2025-01-09 18:55:46,599 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure __wake_up [2025-01-09 18:55:46,600 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_init_zalloc [2025-01-09 18:55:46,600 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2025-01-09 18:55:46,600 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure serio_pause_rx [2025-01-09 18:55:46,600 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure serio_raw_write [2025-01-09 18:55:46,600 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure serio_raw_fasync [2025-01-09 18:55:46,600 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2025-01-09 18:55:46,600 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure serio_raw_poll [2025-01-09 18:55:46,600 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure mutex_lock_interruptible [2025-01-09 18:55:46,600 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure mutex_lock [2025-01-09 18:55:46,600 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_memset [2025-01-09 18:55:46,600 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure atomic_add_return [2025-01-09 18:55:46,629 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 193 nodes and edges [2025-01-09 18:55:46,631 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 68 nodes and edges [2025-01-09 18:55:46,633 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2025-01-09 18:55:46,634 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-09 18:55:46,640 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-09 18:55:46,676 WARN L216 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((1 == ldv_mutex_mutex_of_device) && (ldv_mutex_i_mutex_of_inode == 1)) && (ldv_retval_1 == 0)) && (\old(ldv_mutex_serio_raw_mutex) == 1)) && (ldv_mutex_lock == 1)) && (ldv_state_variable_2 == 0)) && (ldv_mutex_serio_raw_mutex == 1)) [2025-01-09 18:55:46,680 WARN L216 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((1 == ldv_mutex_mutex_of_device) && (ldv_mutex_i_mutex_of_inode == 1)) && (ldv_retval_1 == 0)) && (\old(ldv_mutex_serio_raw_mutex) == 1)) && (ldv_mutex_lock == 1)) && (2 == ldv_mutex_serio_raw_mutex)) [2025-01-09 18:55:46,767 WARN L140 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((1 == ldv_mutex_mutex_of_device) && (ldv_mutex_i_mutex_of_inode == 1)) && (ldv_retval_1 == 0)) && (\old(ldv_mutex_serio_raw_mutex) == 1)) && (ldv_mutex_lock == 1)) && (ldv_state_variable_2 == 0)) && (ldv_mutex_serio_raw_mutex == 1)) [2025-01-09 18:55:46,769 WARN L140 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((1 == ldv_mutex_mutex_of_device) && (ldv_mutex_i_mutex_of_inode == 1)) && (ldv_retval_1 == 0)) && (\old(ldv_mutex_serio_raw_mutex) == 1)) && (ldv_mutex_lock == 1)) && (2 == ldv_mutex_serio_raw_mutex)) [2025-01-09 18:55:46,810 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 18:55:46,810 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 18:55:46,810 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 18:55:46,811 INFO L158 Benchmark]: Toolchain (without parser) took 72937.35ms. Allocated memory was 167.8MB in the beginning and 1.3GB in the end (delta: 1.2GB). Free memory was 123.4MB in the beginning and 856.9MB in the end (delta: -733.6MB). Peak memory consumption was 428.7MB. Max. memory is 16.1GB. [2025-01-09 18:55:46,811 INFO L158 Benchmark]: CDTParser took 0.37ms. Allocated memory is still 201.3MB. Free memory is still 126.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 18:55:46,812 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1025.41ms. Allocated memory is still 167.8MB. Free memory was 123.4MB in the beginning and 111.6MB in the end (delta: 11.8MB). Peak memory consumption was 102.7MB. Max. memory is 16.1GB. [2025-01-09 18:55:46,812 INFO L158 Benchmark]: Boogie Procedure Inliner took 104.91ms. Allocated memory is still 167.8MB. Free memory was 111.6MB in the beginning and 101.6MB in the end (delta: 10.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 18:55:46,813 INFO L158 Benchmark]: Boogie Preprocessor took 175.94ms. Allocated memory is still 167.8MB. Free memory was 101.6MB in the beginning and 67.2MB in the end (delta: 34.4MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-01-09 18:55:46,813 INFO L158 Benchmark]: RCFGBuilder took 5837.64ms. Allocated memory is still 167.8MB. Free memory was 67.2MB in the beginning and 86.4MB in the end (delta: -19.2MB). Peak memory consumption was 46.1MB. Max. memory is 16.1GB. [2025-01-09 18:55:46,814 INFO L158 Benchmark]: TraceAbstraction took 65560.02ms. Allocated memory was 167.8MB in the beginning and 1.3GB in the end (delta: 1.2GB). Free memory was 85.3MB in the beginning and 886.3MB in the end (delta: -801.0MB). Peak memory consumption was 824.9MB. Max. memory is 16.1GB. [2025-01-09 18:55:46,814 INFO L158 Benchmark]: Witness Printer took 222.79ms. Allocated memory is still 1.3GB. Free memory was 886.3MB in the beginning and 856.9MB in the end (delta: 29.4MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-01-09 18:55:46,815 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.37ms. Allocated memory is still 201.3MB. Free memory is still 126.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1025.41ms. Allocated memory is still 167.8MB. Free memory was 123.4MB in the beginning and 111.6MB in the end (delta: 11.8MB). Peak memory consumption was 102.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 104.91ms. Allocated memory is still 167.8MB. Free memory was 111.6MB in the beginning and 101.6MB in the end (delta: 10.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 175.94ms. Allocated memory is still 167.8MB. Free memory was 101.6MB in the beginning and 67.2MB in the end (delta: 34.4MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * RCFGBuilder took 5837.64ms. Allocated memory is still 167.8MB. Free memory was 67.2MB in the beginning and 86.4MB in the end (delta: -19.2MB). Peak memory consumption was 46.1MB. Max. memory is 16.1GB. * TraceAbstraction took 65560.02ms. Allocated memory was 167.8MB in the beginning and 1.3GB in the end (delta: 1.2GB). Free memory was 85.3MB in the beginning and 886.3MB in the end (delta: -801.0MB). Peak memory consumption was 824.9MB. Max. memory is 16.1GB. * Witness Printer took 222.79ms. Allocated memory is still 1.3GB. Free memory was 886.3MB in the beginning and 856.9MB in the end (delta: 29.4MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 3226]: 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] - GenericResultAtLocation [Line: 3238]: 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] - GenericResultAtLocation [Line: 3242]: 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] - GenericResultAtLocation [Line: 3246]: 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] - GenericResultAtLocation [Line: 3250]: 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] - GenericResultAtLocation [Line: 3767]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_1": "=a" (__ret_pu): "0" (__pu_val), "c" (tmp): "ebx"); [3767] - GenericResultAtLocation [Line: 3772]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_2": "=a" (__ret_pu): "0" (__pu_val), "c" (tmp___0): "ebx"); [3772] - GenericResultAtLocation [Line: 3777]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_4": "=a" (__ret_pu): "0" (__pu_val), "c" (tmp___1): "ebx"); [3777] - GenericResultAtLocation [Line: 3782]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_8": "=a" (__ret_pu): "0" (__pu_val), "c" (tmp___2): "ebx"); [3782] - GenericResultAtLocation [Line: 3787]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_X": "=a" (__ret_pu): "0" (__pu_val), "c" (tmp___3): "ebx"); [3787] - GenericResultAtLocation [Line: 3886]: 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] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 4599]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 41 procedures, 544 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 37.2s, OverallIterations: 19, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 19.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 4 mSolverCounterUnknown, 6769 SdHoareTripleChecker+Valid, 16.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6747 mSDsluCounter, 37106 SdHoareTripleChecker+Invalid, 16.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 21761 mSDsCounter, 45 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 327 IncrementalHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 45 mSolverCounterUnsat, 15345 mSDtfsCounter, 327 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 242 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5694occurred in iteration=11, InterpolantAutomatonStates: 74, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.6s AutomataMinimizationTime, 19 MinimizatonAttempts, 2689 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 4.2s InterpolantComputationTime, 4732 NumberOfCodeBlocks, 4732 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 4712 ConstructedInterpolants, 0 QuantifiedInterpolants, 5257 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1915 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 20 InterpolantComputations, 19 PerfectInterpolantSequences, 8775/8800 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 3984]: Location Invariant Derived location invariant: ((((((1 == ldv_mutex_mutex_of_device) && (ldv_mutex_i_mutex_of_inode == 1)) && (ldv_retval_1 == 0)) && (ldv_mutex_lock == 1)) && (ldv_mutex_serio_raw_mutex == 1)) && (ldv_state_variable_1 == 1)) - InvariantResult [Line: 3740]: Location Invariant Derived location invariant: (((((1 == ldv_mutex_mutex_of_device) && (ldv_mutex_i_mutex_of_inode == 1)) && (ldv_retval_1 == 0)) && (ldv_mutex_lock == 1)) && (ldv_mutex_serio_raw_mutex == 1)) - InvariantResult [Line: 4086]: Location Invariant Derived location invariant: (((((((1 == ldv_mutex_mutex_of_device) && (ldv_mutex_i_mutex_of_inode == 1)) && (ldv_retval_1 == 0)) && (\old(ldv_mutex_serio_raw_mutex) == 1)) && (ldv_mutex_lock == 1)) && (ldv_state_variable_2 == 0)) && (ldv_mutex_serio_raw_mutex == 1)) - InvariantResult [Line: 4004]: Loop Invariant Derived loop invariant: ((((((1 == ldv_mutex_mutex_of_device) && (ldv_mutex_i_mutex_of_inode == 1)) && (ldv_retval_1 == 0)) && (ldv_mutex_lock == 1)) && (ldv_mutex_serio_raw_mutex == 1)) && (ldv_state_variable_1 == 1)) - InvariantResult [Line: 3954]: Location Invariant Derived location invariant: (((((1 == ldv_mutex_mutex_of_device) && (ldv_mutex_i_mutex_of_inode == 1)) && (ldv_retval_1 == 0)) && (ldv_mutex_lock == 1)) && (ldv_mutex_serio_raw_mutex == 1)) - InvariantResult [Line: 3984]: Location Invariant Derived location invariant: ((((((1 == ldv_mutex_mutex_of_device) && (ldv_mutex_i_mutex_of_inode == 1)) && (ldv_retval_1 == 0)) && (ldv_mutex_lock == 1)) && (ldv_mutex_serio_raw_mutex == 1)) && (ldv_state_variable_1 == 1)) - InvariantResult [Line: 3862]: Location Invariant Derived location invariant: ((((((1 == ldv_mutex_mutex_of_device) && (ldv_mutex_i_mutex_of_inode == 1)) && (ldv_retval_1 == 0)) && (\old(ldv_mutex_serio_raw_mutex) == 1)) && (ldv_mutex_lock == 1)) && (2 == ldv_mutex_serio_raw_mutex)) - InvariantResult [Line: 4042]: Location Invariant Derived location invariant: ((((((1 == ldv_mutex_mutex_of_device) && (ldv_mutex_i_mutex_of_inode == 1)) && (ldv_retval_1 == 0)) && (ldv_mutex_lock == 1)) && (ldv_mutex_serio_raw_mutex == 1)) && (ldv_state_variable_1 == 1)) RESULT: Ultimate proved your program to be correct! [2025-01-09 18:55:46,880 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE