./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-08_1a-drivers--md--md-cluster.ko-entry_point.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-08_1a-drivers--md--md-cluster.ko-entry_point.cil.out.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 03d5d1a576959110e79c00ca2825754bce7439905d85699b470a90adbbee10ad --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 04:11:52,705 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 04:11:52,760 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-04 04:11:52,764 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 04:11:52,764 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 04:11:52,778 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 04:11:52,779 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 04:11:52,779 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 04:11:52,780 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 04:11:52,780 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 04:11:52,781 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 04:11:52,781 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 04:11:52,781 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 04:11:52,781 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 04:11:52,782 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 04:11:52,782 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 04:11:52,782 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 04:11:52,782 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 04:11:52,782 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 04:11:52,782 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 04:11:52,782 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 04:11:52,782 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 04:11:52,783 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 04:11:52,783 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 04:11:52,783 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 04:11:52,783 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 04:11:52,783 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 04:11:52,783 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 04:11:52,783 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 04:11:52,784 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 04:11:52,784 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 04:11:52,784 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 04:11:52,784 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 04:11:52,784 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 04:11:52,784 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 04:11:52,784 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 04:11:52,785 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 04:11:52,785 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 04:11:52,785 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 04:11:52,785 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 04:11:52,785 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 03d5d1a576959110e79c00ca2825754bce7439905d85699b470a90adbbee10ad [2025-03-04 04:11:53,004 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 04:11:53,014 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 04:11:53,016 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 04:11:53,018 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 04:11:53,018 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 04:11:53,019 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-08_1a-drivers--md--md-cluster.ko-entry_point.cil.out.i [2025-03-04 04:11:54,121 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dbf6cdd91/290f145e1b534e26bdaf197c44e41e91/FLAG44da6194f [2025-03-04 04:11:54,548 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 04:11:54,548 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-08_1a-drivers--md--md-cluster.ko-entry_point.cil.out.i [2025-03-04 04:11:54,572 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dbf6cdd91/290f145e1b534e26bdaf197c44e41e91/FLAG44da6194f [2025-03-04 04:11:54,690 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dbf6cdd91/290f145e1b534e26bdaf197c44e41e91 [2025-03-04 04:11:54,691 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 04:11:54,692 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 04:11:54,693 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 04:11:54,693 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 04:11:54,696 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 04:11:54,697 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 04:11:54" (1/1) ... [2025-03-04 04:11:54,697 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@798f92ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:11:54, skipping insertion in model container [2025-03-04 04:11:54,697 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 04:11:54" (1/1) ... [2025-03-04 04:11:54,750 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 04:11:55,561 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-08_1a-drivers--md--md-cluster.ko-entry_point.cil.out.i[164960,164973] [2025-03-04 04:11:55,609 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 04:11:55,626 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 04:11:55,747 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; bts %1,%0": "+m" (*((long volatile *)addr)): "Ir" (nr): "memory"); [4160] [2025-03-04 04:11:55,749 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; btr %1,%0": "+m" (*((long volatile *)addr)): "Ir" (nr)); [4167] [2025-03-04 04:11:55,750 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("bsrq %1,%q0": "+r" (bitpos): "rm" (x)); [4182] [2025-03-04 04:11:55,939 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-08_1a-drivers--md--md-cluster.ko-entry_point.cil.out.i[164960,164973] [2025-03-04 04:11:55,950 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 04:11:56,017 INFO L204 MainTranslator]: Completed translation [2025-03-04 04:11:56,017 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:11:56 WrapperNode [2025-03-04 04:11:56,018 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 04:11:56,019 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 04:11:56,019 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 04:11:56,019 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 04:11:56,023 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:11:56" (1/1) ... [2025-03-04 04:11:56,061 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:11:56" (1/1) ... [2025-03-04 04:11:56,133 INFO L138 Inliner]: procedures = 151, calls = 825, calls flagged for inlining = 67, calls inlined = 53, statements flattened = 1833 [2025-03-04 04:11:56,134 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 04:11:56,134 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 04:11:56,134 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 04:11:56,135 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 04:11:56,141 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:11:56" (1/1) ... [2025-03-04 04:11:56,141 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:11:56" (1/1) ... [2025-03-04 04:11:56,152 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:11:56" (1/1) ... [2025-03-04 04:11:56,329 INFO L175 MemorySlicer]: Split 277 memory accesses to 11 slices as follows [2, 1, 3, 2, 16, 24, 16, 23, 12, 8, 170]. 61 percent of accesses are in the largest equivalence class. The 51 initializations are split as follows [2, 0, 3, 0, 0, 18, 16, 0, 0, 8, 4]. The 81 writes are split as follows [0, 0, 0, 0, 16, 6, 0, 16, 1, 0, 42]. [2025-03-04 04:11:56,329 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:11:56" (1/1) ... [2025-03-04 04:11:56,330 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:11:56" (1/1) ... [2025-03-04 04:11:56,385 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:11:56" (1/1) ... [2025-03-04 04:11:56,392 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:11:56" (1/1) ... [2025-03-04 04:11:56,409 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:11:56" (1/1) ... [2025-03-04 04:11:56,417 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:11:56" (1/1) ... [2025-03-04 04:11:56,435 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 04:11:56,436 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 04:11:56,436 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 04:11:56,436 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 04:11:56,437 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:11:56" (1/1) ... [2025-03-04 04:11:56,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 04:11:56,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 04:11:56,464 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 04:11:56,467 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 04:11:56,485 INFO L130 BoogieDeclarations]: Found specification of procedure dlm_lock_sync [2025-03-04 04:11:56,485 INFO L138 BoogieDeclarations]: Found implementation of procedure dlm_lock_sync [2025-03-04 04:11:56,485 INFO L130 BoogieDeclarations]: Found specification of procedure lockres_free [2025-03-04 04:11:56,485 INFO L138 BoogieDeclarations]: Found implementation of procedure lockres_free [2025-03-04 04:11:56,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-03-04 04:11:56,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-03-04 04:11:56,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-03-04 04:11:56,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-03-04 04:11:56,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-03-04 04:11:56,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-03-04 04:11:56,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2025-03-04 04:11:56,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2025-03-04 04:11:56,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#8 [2025-03-04 04:11:56,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#9 [2025-03-04 04:11:56,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#10 [2025-03-04 04:11:56,485 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#0 [2025-03-04 04:11:56,485 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#1 [2025-03-04 04:11:56,485 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#2 [2025-03-04 04:11:56,485 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#3 [2025-03-04 04:11:56,485 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#4 [2025-03-04 04:11:56,485 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#5 [2025-03-04 04:11:56,485 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#6 [2025-03-04 04:11:56,485 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#7 [2025-03-04 04:11:56,486 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#8 [2025-03-04 04:11:56,486 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#9 [2025-03-04 04:11:56,486 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#10 [2025-03-04 04:11:56,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-03-04 04:11:56,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-03-04 04:11:56,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-03-04 04:11:56,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-03-04 04:11:56,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-03-04 04:11:56,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2025-03-04 04:11:56,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2025-03-04 04:11:56,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#7 [2025-03-04 04:11:56,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#8 [2025-03-04 04:11:56,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#9 [2025-03-04 04:11:56,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#10 [2025-03-04 04:11:56,486 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2025-03-04 04:11:56,486 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2025-03-04 04:11:56,486 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 04:11:56,486 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 04:11:56,486 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 04:11:56,486 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-04 04:11:56,486 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-04 04:11:56,486 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-04 04:11:56,486 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-04 04:11:56,486 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-04 04:11:56,488 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-03-04 04:11:56,488 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-03-04 04:11:56,488 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-03-04 04:11:56,488 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2025-03-04 04:11:56,488 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2025-03-04 04:11:56,488 INFO L130 BoogieDeclarations]: Found specification of procedure dlm_release_lockspace [2025-03-04 04:11:56,488 INFO L138 BoogieDeclarations]: Found implementation of procedure dlm_release_lockspace [2025-03-04 04:11:56,488 INFO L130 BoogieDeclarations]: Found specification of procedure lock_comm [2025-03-04 04:11:56,489 INFO L138 BoogieDeclarations]: Found implementation of procedure lock_comm [2025-03-04 04:11:56,489 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#0 [2025-03-04 04:11:56,489 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#1 [2025-03-04 04:11:56,489 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#2 [2025-03-04 04:11:56,489 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#3 [2025-03-04 04:11:56,490 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#4 [2025-03-04 04:11:56,490 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#5 [2025-03-04 04:11:56,490 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#6 [2025-03-04 04:11:56,490 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#7 [2025-03-04 04:11:56,490 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#8 [2025-03-04 04:11:56,490 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#9 [2025-03-04 04:11:56,490 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#10 [2025-03-04 04:11:56,491 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#0 [2025-03-04 04:11:56,491 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#1 [2025-03-04 04:11:56,491 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#2 [2025-03-04 04:11:56,491 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#3 [2025-03-04 04:11:56,491 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#4 [2025-03-04 04:11:56,491 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#5 [2025-03-04 04:11:56,492 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#6 [2025-03-04 04:11:56,492 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#7 [2025-03-04 04:11:56,492 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#8 [2025-03-04 04:11:56,492 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#9 [2025-03-04 04:11:56,492 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#10 [2025-03-04 04:11:56,492 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2025-03-04 04:11:56,492 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2025-03-04 04:11:56,492 INFO L130 BoogieDeclarations]: Found specification of procedure constant_test_bit [2025-03-04 04:11:56,492 INFO L138 BoogieDeclarations]: Found implementation of procedure constant_test_bit [2025-03-04 04:11:56,492 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_module_put [2025-03-04 04:11:56,492 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_module_put [2025-03-04 04:11:56,492 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2025-03-04 04:11:56,492 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2025-03-04 04:11:56,492 INFO L130 BoogieDeclarations]: Found specification of procedure init_completion [2025-03-04 04:11:56,492 INFO L138 BoogieDeclarations]: Found implementation of procedure init_completion [2025-03-04 04:11:56,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 04:11:56,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 04:11:56,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 04:11:56,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-04 04:11:56,493 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-04 04:11:56,493 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-04 04:11:56,493 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-04 04:11:56,493 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-04 04:11:56,493 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-03-04 04:11:56,493 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-03-04 04:11:56,493 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-03-04 04:11:56,493 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2025-03-04 04:11:56,493 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2025-03-04 04:11:56,493 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_irq [2025-03-04 04:11:56,493 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_irq [2025-03-04 04:11:56,493 INFO L130 BoogieDeclarations]: Found specification of procedure md_wakeup_thread [2025-03-04 04:11:56,493 INFO L138 BoogieDeclarations]: Found implementation of procedure md_wakeup_thread [2025-03-04 04:11:56,493 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-03-04 04:11:56,493 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-03-04 04:11:56,493 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-03-04 04:11:56,493 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#3 [2025-03-04 04:11:56,493 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#4 [2025-03-04 04:11:56,493 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#5 [2025-03-04 04:11:56,493 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#6 [2025-03-04 04:11:56,493 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#7 [2025-03-04 04:11:56,493 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#8 [2025-03-04 04:11:56,493 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#9 [2025-03-04 04:11:56,493 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#10 [2025-03-04 04:11:56,493 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-03-04 04:11:56,493 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-03-04 04:11:56,493 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-03-04 04:11:56,493 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#3 [2025-03-04 04:11:56,493 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#4 [2025-03-04 04:11:56,493 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#5 [2025-03-04 04:11:56,493 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#6 [2025-03-04 04:11:56,493 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#7 [2025-03-04 04:11:56,493 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#8 [2025-03-04 04:11:56,494 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#9 [2025-03-04 04:11:56,494 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#10 [2025-03-04 04:11:56,494 INFO L130 BoogieDeclarations]: Found specification of procedure bitmap_copy_from_slot [2025-03-04 04:11:56,494 INFO L138 BoogieDeclarations]: Found implementation of procedure bitmap_copy_from_slot [2025-03-04 04:11:56,494 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_zalloc [2025-03-04 04:11:56,494 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_zalloc [2025-03-04 04:11:56,494 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 04:11:56,494 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 04:11:56,494 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 04:11:56,494 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_memset [2025-03-04 04:11:56,494 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_memset [2025-03-04 04:11:56,494 INFO L130 BoogieDeclarations]: Found specification of procedure complete [2025-03-04 04:11:56,494 INFO L138 BoogieDeclarations]: Found implementation of procedure complete [2025-03-04 04:11:56,494 INFO L130 BoogieDeclarations]: Found specification of procedure md_register_thread [2025-03-04 04:11:56,494 INFO L138 BoogieDeclarations]: Found implementation of procedure md_register_thread [2025-03-04 04:11:56,494 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 04:11:56,494 INFO L130 BoogieDeclarations]: Found specification of procedure md_unregister_thread [2025-03-04 04:11:56,494 INFO L138 BoogieDeclarations]: Found implementation of procedure md_unregister_thread [2025-03-04 04:11:56,494 INFO L130 BoogieDeclarations]: Found specification of procedure wait_for_completion [2025-03-04 04:11:56,494 INFO L138 BoogieDeclarations]: Found implementation of procedure wait_for_completion [2025-03-04 04:11:56,494 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 04:11:56,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 04:11:56,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 04:11:56,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-04 04:11:56,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-04 04:11:56,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-03-04 04:11:56,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-03-04 04:11:56,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-03-04 04:11:56,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-03-04 04:11:56,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-03-04 04:11:56,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-03-04 04:11:56,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-03-04 04:11:56,497 INFO L130 BoogieDeclarations]: Found specification of procedure resync_send [2025-03-04 04:11:56,498 INFO L138 BoogieDeclarations]: Found implementation of procedure resync_send [2025-03-04 04:11:56,498 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock_irq [2025-03-04 04:11:56,498 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock_irq [2025-03-04 04:11:56,498 INFO L130 BoogieDeclarations]: Found specification of procedure lockres_init [2025-03-04 04:11:56,498 INFO L138 BoogieDeclarations]: Found implementation of procedure lockres_init [2025-03-04 04:11:56,498 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 04:11:56,498 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 04:11:56,498 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-04 04:11:56,498 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-04 04:11:56,498 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-03-04 04:11:56,498 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-03-04 04:11:56,498 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-03-04 04:11:56,498 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-03-04 04:11:56,498 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-03-04 04:11:56,498 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-03-04 04:11:56,498 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-03-04 04:11:56,498 INFO L130 BoogieDeclarations]: Found specification of procedure unlock_comm [2025-03-04 04:11:56,498 INFO L138 BoogieDeclarations]: Found implementation of procedure unlock_comm [2025-03-04 04:11:56,498 INFO L130 BoogieDeclarations]: Found specification of procedure list_add [2025-03-04 04:11:56,498 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add [2025-03-04 04:11:56,498 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 04:11:56,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-04 04:11:56,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-04 04:11:56,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-04 04:11:56,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-03-04 04:11:56,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-03-04 04:11:56,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-03-04 04:11:56,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-03-04 04:11:56,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2025-03-04 04:11:56,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2025-03-04 04:11:56,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2025-03-04 04:11:56,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2025-03-04 04:11:56,498 INFO L130 BoogieDeclarations]: Found specification of procedure resync_info_update [2025-03-04 04:11:56,498 INFO L138 BoogieDeclarations]: Found implementation of procedure resync_info_update [2025-03-04 04:11:56,498 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2025-03-04 04:11:56,498 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2025-03-04 04:11:56,498 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2025-03-04 04:11:56,498 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2025-03-04 04:11:56,499 INFO L130 BoogieDeclarations]: Found specification of procedure __sendmsg [2025-03-04 04:11:56,499 INFO L138 BoogieDeclarations]: Found implementation of procedure __sendmsg [2025-03-04 04:11:56,499 INFO L130 BoogieDeclarations]: Found specification of procedure set_bit [2025-03-04 04:11:56,499 INFO L138 BoogieDeclarations]: Found implementation of procedure set_bit [2025-03-04 04:11:56,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 04:11:56,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 04:11:56,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 04:11:56,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-04 04:11:56,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-04 04:11:56,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-04 04:11:56,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-04 04:11:56,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-04 04:11:56,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-04 04:11:56,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-04 04:11:56,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-04 04:11:56,499 INFO L130 BoogieDeclarations]: Found specification of procedure pretty_uuid [2025-03-04 04:11:56,499 INFO L138 BoogieDeclarations]: Found implementation of procedure pretty_uuid [2025-03-04 04:11:56,499 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#0 [2025-03-04 04:11:56,499 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#1 [2025-03-04 04:11:56,499 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#2 [2025-03-04 04:11:56,499 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#3 [2025-03-04 04:11:56,499 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#4 [2025-03-04 04:11:56,499 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#5 [2025-03-04 04:11:56,499 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#6 [2025-03-04 04:11:56,499 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#7 [2025-03-04 04:11:56,499 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#8 [2025-03-04 04:11:56,499 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#9 [2025-03-04 04:11:56,499 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#10 [2025-03-04 04:11:56,499 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 04:11:56,499 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 04:11:56,499 INFO L130 BoogieDeclarations]: Found specification of procedure sendmsg [2025-03-04 04:11:56,499 INFO L138 BoogieDeclarations]: Found implementation of procedure sendmsg [2025-03-04 04:11:56,502 INFO L130 BoogieDeclarations]: Found specification of procedure dlm_unlock_sync [2025-03-04 04:11:56,502 INFO L138 BoogieDeclarations]: Found implementation of procedure dlm_unlock_sync [2025-03-04 04:11:56,899 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 04:11:56,902 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 04:11:57,045 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5948: havoc dlm_lock_#t~nondet495#1; [2025-03-04 04:11:57,045 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4435: havoc #t~mem117#1; [2025-03-04 04:11:57,073 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5960: havoc dlm_unlock_#t~nondet498#1; [2025-03-04 04:11:57,075 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2025-03-04 04:11:57,086 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5956: havoc #t~nondet497; [2025-03-04 04:11:57,135 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4174: havoc #t~mem1;havoc #t~bitwise2; [2025-03-04 04:11:57,162 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4244: call ULTIMATE.dealloc(~#__key~0#1.base, ~#__key~0#1.offset);havoc ~#__key~0#1.base, ~#__key~0#1.offset; [2025-03-04 04:11:57,265 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5941: havoc #t~nondet494; [2025-03-04 04:11:57,453 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5982: havoc #t~ret501.base, #t~ret501.offset; [2025-03-04 04:11:57,551 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5303: call ULTIMATE.dealloc(~#cmsg~1.base, ~#cmsg~1.offset);havoc ~#cmsg~1.base, ~#cmsg~1.offset; [2025-03-04 04:11:57,625 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6006: havoc strlcpy_#t~nondet504#1; [2025-03-04 04:11:57,647 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5998: havoc #t~nondet502; [2025-03-04 04:11:57,662 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4263: havoc __kmalloc_#t~ret48#1.base, __kmalloc_#t~ret48#1.offset; [2025-03-04 04:11:58,338 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5255: havoc slot_number_#t~mem364#1; [2025-03-04 04:11:58,338 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5553: call ULTIMATE.dealloc(main_~#ldvarg7~0#1.base, main_~#ldvarg7~0#1.offset);havoc main_~#ldvarg7~0#1.base, main_~#ldvarg7~0#1.offset;call ULTIMATE.dealloc(main_~#ldvarg3~0#1.base, main_~#ldvarg3~0#1.offset);havoc main_~#ldvarg3~0#1.base, main_~#ldvarg3~0#1.offset;call ULTIMATE.dealloc(main_~#ldvarg0~0#1.base, main_~#ldvarg0~0#1.offset);havoc main_~#ldvarg0~0#1.base, main_~#ldvarg0~0#1.offset;call ULTIMATE.dealloc(main_~#ldvarg5~0#1.base, main_~#ldvarg5~0#1.offset);havoc main_~#ldvarg5~0#1.base, main_~#ldvarg5~0#1.offset;call ULTIMATE.dealloc(main_~#ldvarg6~0#1.base, main_~#ldvarg6~0#1.offset);havoc main_~#ldvarg6~0#1.base, main_~#ldvarg6~0#1.offset;call ULTIMATE.dealloc(main_~#ldvarg1~0#1.base, main_~#ldvarg1~0#1.offset);havoc main_~#ldvarg1~0#1.base, main_~#ldvarg1~0#1.offset;call ULTIMATE.dealloc(main_~#ldvarg4~0#1.base, main_~#ldvarg4~0#1.offset);havoc main_~#ldvarg4~0#1.base, main_~#ldvarg4~0#1.offset;call ULTIMATE.dealloc(main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset);havoc main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset;call ULTIMATE.dealloc(main_~#ldvarg11~0#1.base, main_~#ldvarg11~0#1.offset);havoc main_~#ldvarg11~0#1.base, main_~#ldvarg11~0#1.offset;call ULTIMATE.dealloc(main_~#ldvarg12~0#1.base, main_~#ldvarg12~0#1.offset);havoc main_~#ldvarg12~0#1.base, main_~#ldvarg12~0#1.offset;call ULTIMATE.dealloc(main_~#ldvarg9~0#1.base, main_~#ldvarg9~0#1.offset);havoc main_~#ldvarg9~0#1.base, main_~#ldvarg9~0#1.offset; [2025-03-04 04:11:58,338 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5091: call ULTIMATE.dealloc(join_~#ops_rv~0#1.base, join_~#ops_rv~0#1.offset);havoc join_~#ops_rv~0#1.base, join_~#ops_rv~0#1.offset;call ULTIMATE.dealloc(join_~#str~2#1.base, join_~#str~2#1.offset);havoc join_~#str~2#1.base, join_~#str~2#1.offset;call ULTIMATE.dealloc(join_~#__key~1#1.base, join_~#__key~1#1.offset);havoc join_~#__key~1#1.base, join_~#__key~1#1.offset;call ULTIMATE.dealloc(join_~#__key___0~0#1.base, join_~#__key___0~0#1.offset);havoc join_~#__key___0~0#1.base, join_~#__key___0~0#1.offset; [2025-03-04 04:11:58,338 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5952: havoc dlm_new_lockspace_#t~nondet496#1; [2025-03-04 04:11:58,338 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4567: call ULTIMATE.dealloc(read_resync_info_~#ri~1#1.base, read_resync_info_~#ri~1#1.offset);havoc read_resync_info_~#ri~1#1.base, read_resync_info_~#ri~1#1.offset; [2025-03-04 04:11:58,338 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5033: call ULTIMATE.dealloc(gather_all_resync_info_~#str~1#1.base, gather_all_resync_info_~#str~1#1.offset);havoc gather_all_resync_info_~#str~1#1.base, gather_all_resync_info_~#str~1#1.offset; [2025-03-04 04:11:58,338 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5464: call ULTIMATE.dealloc(gather_bitmaps_~#lo~1#1.base, gather_bitmaps_~#lo~1#1.offset);havoc gather_bitmaps_~#lo~1#1.base, gather_bitmaps_~#lo~1#1.offset;call ULTIMATE.dealloc(gather_bitmaps_~#hi~2#1.base, gather_bitmaps_~#hi~2#1.offset);havoc gather_bitmaps_~#hi~2#1.base, gather_bitmaps_~#hi~2#1.offset;call ULTIMATE.dealloc(gather_bitmaps_~#cmsg~5#1.base, gather_bitmaps_~#cmsg~5#1.offset);havoc gather_bitmaps_~#cmsg~5#1.base, gather_bitmaps_~#cmsg~5#1.offset; [2025-03-04 04:11:58,338 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4209: havoc list_empty_#t~mem14#1.base, list_empty_#t~mem14#1.offset; [2025-03-04 04:11:58,338 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6002: havoc register_md_cluster_operations_#t~nondet503#1; [2025-03-04 04:11:58,339 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5279: call ULTIMATE.dealloc(metadata_update_finish_~#cmsg~0#1.base, metadata_update_finish_~#cmsg~0#1.offset);havoc metadata_update_finish_~#cmsg~0#1.base, metadata_update_finish_~#cmsg~0#1.offset; [2025-03-04 04:11:58,339 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5379: call ULTIMATE.dealloc(add_new_disk_start_~#cmsg~2#1.base, add_new_disk_start_~#cmsg~2#1.offset);havoc add_new_disk_start_~#cmsg~2#1.base, add_new_disk_start_~#cmsg~2#1.offset; [2025-03-04 04:11:58,339 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5413: call ULTIMATE.dealloc(add_new_disk_finish_~#cmsg~3#1.base, add_new_disk_finish_~#cmsg~3#1.offset);havoc add_new_disk_finish_~#cmsg~3#1.base, add_new_disk_finish_~#cmsg~3#1.offset; [2025-03-04 04:11:58,339 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6010: havoc unregister_md_cluster_operations_#t~nondet505#1; [2025-03-04 04:11:58,339 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5449: call ULTIMATE.dealloc(remove_disk_~#cmsg~4#1.base, remove_disk_~#cmsg~4#1.offset);havoc remove_disk_~#cmsg~4#1.base, remove_disk_~#cmsg~4#1.offset; [2025-03-04 04:11:58,339 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4395: havoc mdname_#t~mem88#1.base, mdname_#t~mem88#1.offset;havoc mdname_#t~ite90#1.base, mdname_#t~ite90#1.offset;havoc mdname_#t~mem89#1.base, mdname_#t~mem89#1.offset; [2025-03-04 04:11:58,601 INFO L? ?]: Removed 919 outVars from TransFormulas that were not future-live. [2025-03-04 04:11:58,601 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 04:11:58,634 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 04:11:58,638 INFO L336 CfgBuilder]: Removed 1 assume(true) statements. [2025-03-04 04:11:58,638 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 04:11:58 BoogieIcfgContainer [2025-03-04 04:11:58,638 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 04:11:58,639 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 04:11:58,639 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 04:11:58,643 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 04:11:58,644 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 04:11:54" (1/3) ... [2025-03-04 04:11:58,644 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@102aeef9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 04:11:58, skipping insertion in model container [2025-03-04 04:11:58,644 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:11:56" (2/3) ... [2025-03-04 04:11:58,644 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@102aeef9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 04:11:58, skipping insertion in model container [2025-03-04 04:11:58,644 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 04:11:58" (3/3) ... [2025-03-04 04:11:58,645 INFO L128 eAbstractionObserver]: Analyzing ICFG linux-4.2-rc1.tar.xz-08_1a-drivers--md--md-cluster.ko-entry_point.cil.out.i [2025-03-04 04:11:58,658 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 04:11:58,659 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG linux-4.2-rc1.tar.xz-08_1a-drivers--md--md-cluster.ko-entry_point.cil.out.i that has 58 procedures, 730 locations, 1 initial locations, 39 loop locations, and 1 error locations. [2025-03-04 04:11:58,733 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 04:11:58,745 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;@76b3b6a0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 04:11:58,745 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 04:11:58,749 INFO L276 IsEmpty]: Start isEmpty. Operand has 656 states, 458 states have (on average 1.3078602620087336) internal successors, (599), 469 states have internal predecessors, (599), 156 states have call successors, (156), 41 states have call predecessors, (156), 40 states have return successors, (152), 151 states have call predecessors, (152), 152 states have call successors, (152) [2025-03-04 04:11:58,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2025-03-04 04:11:58,761 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:11:58,762 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 04:11:58,762 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:11:58,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:11:58,767 INFO L85 PathProgramCache]: Analyzing trace with hash -1789508005, now seen corresponding path program 1 times [2025-03-04 04:11:58,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:11:58,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982193074] [2025-03-04 04:11:58,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:11:58,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:11:58,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-03-04 04:11:59,009 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-03-04 04:11:59,010 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:11:59,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:11:59,271 INFO L134 CoverageAnalysis]: Checked inductivity of 537 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 527 trivial. 0 not checked. [2025-03-04 04:11:59,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:11:59,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982193074] [2025-03-04 04:11:59,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982193074] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 04:11:59,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1369007134] [2025-03-04 04:11:59,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:11:59,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 04:11:59,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 04:11:59,275 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 04:11:59,276 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 04:11:59,661 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-03-04 04:11:59,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-03-04 04:11:59,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:11:59,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:11:59,817 INFO L256 TraceCheckSpWp]: Trace formula consists of 1521 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 04:11:59,824 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 04:11:59,838 INFO L134 CoverageAnalysis]: Checked inductivity of 537 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 519 trivial. 0 not checked. [2025-03-04 04:11:59,838 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 04:11:59,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1369007134] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:11:59,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 04:11:59,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 04:11:59,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576609810] [2025-03-04 04:11:59,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:11:59,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 04:11:59,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:11:59,859 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 04:11:59,859 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 04:11:59,862 INFO L87 Difference]: Start difference. First operand has 656 states, 458 states have (on average 1.3078602620087336) internal successors, (599), 469 states have internal predecessors, (599), 156 states have call successors, (156), 41 states have call predecessors, (156), 40 states have return successors, (152), 151 states have call predecessors, (152), 152 states have call successors, (152) Second operand has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-04 04:11:59,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:11:59,959 INFO L93 Difference]: Finished difference Result 1307 states and 1834 transitions. [2025-03-04 04:11:59,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 04:11:59,962 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 184 [2025-03-04 04:11:59,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:11:59,975 INFO L225 Difference]: With dead ends: 1307 [2025-03-04 04:11:59,977 INFO L226 Difference]: Without dead ends: 645 [2025-03-04 04:11:59,986 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 04:11:59,987 INFO L435 NwaCegarLoop]: 894 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 894 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 04:11:59,989 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 894 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 04:12:00,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 645 states. [2025-03-04 04:12:00,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 645 to 645. [2025-03-04 04:12:00,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 645 states, 453 states have (on average 1.2891832229580573) internal successors, (584), 458 states have internal predecessors, (584), 152 states have call successors, (152), 40 states have call predecessors, (152), 39 states have return successors, (150), 149 states have call predecessors, (150), 150 states have call successors, (150) [2025-03-04 04:12:00,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 645 states and 886 transitions. [2025-03-04 04:12:00,076 INFO L78 Accepts]: Start accepts. Automaton has 645 states and 886 transitions. Word has length 184 [2025-03-04 04:12:00,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:12:00,076 INFO L471 AbstractCegarLoop]: Abstraction has 645 states and 886 transitions. [2025-03-04 04:12:00,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-04 04:12:00,077 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 886 transitions. [2025-03-04 04:12:00,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2025-03-04 04:12:00,082 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:12:00,082 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 04:12:00,091 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 04:12:00,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-04 04:12:00,286 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:12:00,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:12:00,287 INFO L85 PathProgramCache]: Analyzing trace with hash -1431387170, now seen corresponding path program 1 times [2025-03-04 04:12:00,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:12:00,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144121031] [2025-03-04 04:12:00,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:12:00,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:12:00,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-03-04 04:12:00,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-03-04 04:12:00,418 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:12:00,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:12:00,653 INFO L134 CoverageAnalysis]: Checked inductivity of 537 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 537 trivial. 0 not checked. [2025-03-04 04:12:00,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:12:00,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144121031] [2025-03-04 04:12:00,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144121031] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:12:00,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:12:00,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 04:12:00,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592400323] [2025-03-04 04:12:00,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:12:00,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 04:12:00,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:12:00,655 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 04:12:00,655 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 04:12:00,655 INFO L87 Difference]: Start difference. First operand 645 states and 886 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-04 04:12:00,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:12:00,851 INFO L93 Difference]: Finished difference Result 1825 states and 2514 transitions. [2025-03-04 04:12:00,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 04:12:00,855 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 184 [2025-03-04 04:12:00,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:12:00,862 INFO L225 Difference]: With dead ends: 1825 [2025-03-04 04:12:00,862 INFO L226 Difference]: Without dead ends: 1220 [2025-03-04 04:12:00,865 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 04:12:00,865 INFO L435 NwaCegarLoop]: 882 mSDtfsCounter, 796 mSDsluCounter, 861 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 796 SdHoareTripleChecker+Valid, 1743 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 04:12:00,865 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [796 Valid, 1743 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 04:12:00,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1220 states. [2025-03-04 04:12:00,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1220 to 1217. [2025-03-04 04:12:00,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1217 states, 862 states have (on average 1.2981438515081207) internal successors, (1119), 871 states have internal predecessors, (1119), 280 states have call successors, (280), 75 states have call predecessors, (280), 74 states have return successors, (278), 276 states have call predecessors, (278), 278 states have call successors, (278) [2025-03-04 04:12:00,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1217 states to 1217 states and 1677 transitions. [2025-03-04 04:12:00,941 INFO L78 Accepts]: Start accepts. Automaton has 1217 states and 1677 transitions. Word has length 184 [2025-03-04 04:12:00,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:12:00,943 INFO L471 AbstractCegarLoop]: Abstraction has 1217 states and 1677 transitions. [2025-03-04 04:12:00,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-04 04:12:00,943 INFO L276 IsEmpty]: Start isEmpty. Operand 1217 states and 1677 transitions. [2025-03-04 04:12:00,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2025-03-04 04:12:00,945 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:12:00,945 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 04:12:00,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 04:12:00,945 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:12:00,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:12:00,946 INFO L85 PathProgramCache]: Analyzing trace with hash -1105850636, now seen corresponding path program 1 times [2025-03-04 04:12:00,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:12:00,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50891021] [2025-03-04 04:12:00,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:12:00,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:12:01,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-03-04 04:12:01,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-03-04 04:12:01,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:12:01,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:12:01,256 INFO L134 CoverageAnalysis]: Checked inductivity of 540 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 540 trivial. 0 not checked. [2025-03-04 04:12:01,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:12:01,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50891021] [2025-03-04 04:12:01,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50891021] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:12:01,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:12:01,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 04:12:01,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876698717] [2025-03-04 04:12:01,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:12:01,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 04:12:01,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:12:01,257 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 04:12:01,257 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 04:12:01,257 INFO L87 Difference]: Start difference. First operand 1217 states and 1677 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 04:12:01,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:12:01,350 INFO L93 Difference]: Finished difference Result 2393 states and 3298 transitions. [2025-03-04 04:12:01,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 04:12:01,351 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 197 [2025-03-04 04:12:01,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:12:01,361 INFO L225 Difference]: With dead ends: 2393 [2025-03-04 04:12:01,361 INFO L226 Difference]: Without dead ends: 1216 [2025-03-04 04:12:01,365 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 04:12:01,366 INFO L435 NwaCegarLoop]: 876 mSDtfsCounter, 882 mSDsluCounter, 874 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 882 SdHoareTripleChecker+Valid, 1750 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 04:12:01,366 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [882 Valid, 1750 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 04:12:01,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1216 states. [2025-03-04 04:12:01,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1216 to 1216. [2025-03-04 04:12:01,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1216 states, 861 states have (on average 1.2950058072009292) internal successors, (1115), 870 states have internal predecessors, (1115), 280 states have call successors, (280), 75 states have call predecessors, (280), 74 states have return successors, (278), 276 states have call predecessors, (278), 278 states have call successors, (278) [2025-03-04 04:12:01,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1216 states to 1216 states and 1673 transitions. [2025-03-04 04:12:01,440 INFO L78 Accepts]: Start accepts. Automaton has 1216 states and 1673 transitions. Word has length 197 [2025-03-04 04:12:01,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:12:01,442 INFO L471 AbstractCegarLoop]: Abstraction has 1216 states and 1673 transitions. [2025-03-04 04:12:01,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 04:12:01,442 INFO L276 IsEmpty]: Start isEmpty. Operand 1216 states and 1673 transitions. [2025-03-04 04:12:01,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2025-03-04 04:12:01,447 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:12:01,447 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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] [2025-03-04 04:12:01,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 04:12:01,447 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:12:01,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:12:01,448 INFO L85 PathProgramCache]: Analyzing trace with hash -1023317809, now seen corresponding path program 1 times [2025-03-04 04:12:01,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:12:01,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827219893] [2025-03-04 04:12:01,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:12:01,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:12:01,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 255 statements into 1 equivalence classes. [2025-03-04 04:12:01,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 255 of 255 statements. [2025-03-04 04:12:01,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:12:01,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:12:01,743 INFO L134 CoverageAnalysis]: Checked inductivity of 713 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 713 trivial. 0 not checked. [2025-03-04 04:12:01,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:12:01,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827219893] [2025-03-04 04:12:01,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827219893] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:12:01,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:12:01,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 04:12:01,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830356523] [2025-03-04 04:12:01,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:12:01,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 04:12:01,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:12:01,746 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 04:12:01,746 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 04:12:01,746 INFO L87 Difference]: Start difference. First operand 1216 states and 1673 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 3 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-04 04:12:01,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:12:01,870 INFO L93 Difference]: Finished difference Result 3565 states and 4910 transitions. [2025-03-04 04:12:01,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 04:12:01,871 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 3 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 255 [2025-03-04 04:12:01,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:12:01,888 INFO L225 Difference]: With dead ends: 3565 [2025-03-04 04:12:01,889 INFO L226 Difference]: Without dead ends: 2385 [2025-03-04 04:12:01,894 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 04:12:01,896 INFO L435 NwaCegarLoop]: 895 mSDtfsCounter, 820 mSDsluCounter, 820 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 820 SdHoareTripleChecker+Valid, 1715 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 04:12:01,897 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [820 Valid, 1715 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 04:12:01,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2385 states. [2025-03-04 04:12:01,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2385 to 2381. [2025-03-04 04:12:01,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2381 states, 1691 states have (on average 1.2980484920165583) internal successors, (2195), 1708 states have internal predecessors, (2195), 543 states have call successors, (543), 147 states have call predecessors, (543), 146 states have return successors, (541), 537 states have call predecessors, (541), 541 states have call successors, (541) [2025-03-04 04:12:02,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2381 states to 2381 states and 3279 transitions. [2025-03-04 04:12:02,014 INFO L78 Accepts]: Start accepts. Automaton has 2381 states and 3279 transitions. Word has length 255 [2025-03-04 04:12:02,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:12:02,014 INFO L471 AbstractCegarLoop]: Abstraction has 2381 states and 3279 transitions. [2025-03-04 04:12:02,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 3 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-04 04:12:02,015 INFO L276 IsEmpty]: Start isEmpty. Operand 2381 states and 3279 transitions. [2025-03-04 04:12:02,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2025-03-04 04:12:02,025 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:12:02,026 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 04:12:02,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 04:12:02,026 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:12:02,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:12:02,027 INFO L85 PathProgramCache]: Analyzing trace with hash -392818647, now seen corresponding path program 1 times [2025-03-04 04:12:02,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:12:02,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064373688] [2025-03-04 04:12:02,027 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:12:02,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:12:02,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 277 statements into 1 equivalence classes. [2025-03-04 04:12:02,154 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 277 of 277 statements. [2025-03-04 04:12:02,155 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:12:02,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:12:02,271 INFO L134 CoverageAnalysis]: Checked inductivity of 717 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 710 trivial. 0 not checked. [2025-03-04 04:12:02,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:12:02,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064373688] [2025-03-04 04:12:02,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064373688] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:12:02,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:12:02,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 04:12:02,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907610335] [2025-03-04 04:12:02,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:12:02,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 04:12:02,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:12:02,273 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 04:12:02,273 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 04:12:02,273 INFO L87 Difference]: Start difference. First operand 2381 states and 3279 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-04 04:12:02,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:12:02,393 INFO L93 Difference]: Finished difference Result 4726 states and 6512 transitions. [2025-03-04 04:12:02,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 04:12:02,393 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 277 [2025-03-04 04:12:02,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:12:02,409 INFO L225 Difference]: With dead ends: 4726 [2025-03-04 04:12:02,409 INFO L226 Difference]: Without dead ends: 2385 [2025-03-04 04:12:02,418 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 04:12:02,420 INFO L435 NwaCegarLoop]: 878 mSDtfsCounter, 0 mSDsluCounter, 873 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1751 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 04:12:02,420 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1751 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 04:12:02,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2385 states. [2025-03-04 04:12:02,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2385 to 2385. [2025-03-04 04:12:02,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2385 states, 1695 states have (on average 1.297345132743363) internal successors, (2199), 1712 states have internal predecessors, (2199), 543 states have call successors, (543), 147 states have call predecessors, (543), 146 states have return successors, (541), 537 states have call predecessors, (541), 541 states have call successors, (541) [2025-03-04 04:12:02,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2385 states to 2385 states and 3283 transitions. [2025-03-04 04:12:02,535 INFO L78 Accepts]: Start accepts. Automaton has 2385 states and 3283 transitions. Word has length 277 [2025-03-04 04:12:02,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:12:02,537 INFO L471 AbstractCegarLoop]: Abstraction has 2385 states and 3283 transitions. [2025-03-04 04:12:02,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-04 04:12:02,538 INFO L276 IsEmpty]: Start isEmpty. Operand 2385 states and 3283 transitions. [2025-03-04 04:12:02,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2025-03-04 04:12:02,547 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:12:02,547 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 04:12:02,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 04:12:02,547 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:12:02,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:12:02,548 INFO L85 PathProgramCache]: Analyzing trace with hash 1114733162, now seen corresponding path program 1 times [2025-03-04 04:12:02,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:12:02,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439288993] [2025-03-04 04:12:02,549 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:12:02,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:12:02,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 277 statements into 1 equivalence classes. [2025-03-04 04:12:02,711 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 277 of 277 statements. [2025-03-04 04:12:02,711 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:12:02,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:12:03,451 INFO L134 CoverageAnalysis]: Checked inductivity of 717 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 708 trivial. 0 not checked. [2025-03-04 04:12:03,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:12:03,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439288993] [2025-03-04 04:12:03,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439288993] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 04:12:03,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1107970133] [2025-03-04 04:12:03,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:12:03,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 04:12:03,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 04:12:03,454 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 04:12:03,456 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 04:12:03,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 277 statements into 1 equivalence classes. [2025-03-04 04:12:04,028 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 277 of 277 statements. [2025-03-04 04:12:04,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:12:04,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:12:04,039 INFO L256 TraceCheckSpWp]: Trace formula consists of 1971 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-04 04:12:04,047 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 04:12:04,153 INFO L134 CoverageAnalysis]: Checked inductivity of 717 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 710 trivial. 0 not checked. [2025-03-04 04:12:04,154 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 04:12:04,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1107970133] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:12:04,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 04:12:04,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2025-03-04 04:12:04,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183521932] [2025-03-04 04:12:04,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:12:04,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 04:12:04,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:12:04,155 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 04:12:04,155 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-04 04:12:04,156 INFO L87 Difference]: Start difference. First operand 2385 states and 3283 transitions. Second operand has 6 states, 6 states have (on average 14.0) internal successors, (84), 6 states have internal predecessors, (84), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-04 04:12:04,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:12:04,334 INFO L93 Difference]: Finished difference Result 3569 states and 4912 transitions. [2025-03-04 04:12:04,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 04:12:04,334 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.0) internal successors, (84), 6 states have internal predecessors, (84), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 277 [2025-03-04 04:12:04,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:12:04,350 INFO L225 Difference]: With dead ends: 3569 [2025-03-04 04:12:04,351 INFO L226 Difference]: Without dead ends: 2391 [2025-03-04 04:12:04,357 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 275 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-04 04:12:04,358 INFO L435 NwaCegarLoop]: 877 mSDtfsCounter, 0 mSDsluCounter, 3489 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4366 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 04:12:04,358 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4366 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 04:12:04,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2391 states. [2025-03-04 04:12:04,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2391 to 2391. [2025-03-04 04:12:04,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2391 states, 1701 states have (on average 1.2962962962962963) internal successors, (2205), 1718 states have internal predecessors, (2205), 543 states have call successors, (543), 147 states have call predecessors, (543), 146 states have return successors, (541), 537 states have call predecessors, (541), 541 states have call successors, (541) [2025-03-04 04:12:04,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2391 states to 2391 states and 3289 transitions. [2025-03-04 04:12:04,502 INFO L78 Accepts]: Start accepts. Automaton has 2391 states and 3289 transitions. Word has length 277 [2025-03-04 04:12:04,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:12:04,502 INFO L471 AbstractCegarLoop]: Abstraction has 2391 states and 3289 transitions. [2025-03-04 04:12:04,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.0) internal successors, (84), 6 states have internal predecessors, (84), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-04 04:12:04,503 INFO L276 IsEmpty]: Start isEmpty. Operand 2391 states and 3289 transitions. [2025-03-04 04:12:04,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2025-03-04 04:12:04,511 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:12:04,511 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 6, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 04:12:04,527 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 04:12:04,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-04 04:12:04,712 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:12:04,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:12:04,713 INFO L85 PathProgramCache]: Analyzing trace with hash -1333234219, now seen corresponding path program 1 times [2025-03-04 04:12:04,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:12:04,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100327640] [2025-03-04 04:12:04,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:12:04,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:12:04,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 278 statements into 1 equivalence classes. [2025-03-04 04:12:04,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 278 of 278 statements. [2025-03-04 04:12:04,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:12:04,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:12:04,969 INFO L134 CoverageAnalysis]: Checked inductivity of 597 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 597 trivial. 0 not checked. [2025-03-04 04:12:04,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:12:04,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100327640] [2025-03-04 04:12:04,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100327640] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:12:04,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:12:04,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 04:12:04,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889921577] [2025-03-04 04:12:04,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:12:04,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 04:12:04,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:12:04,970 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 04:12:04,970 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 04:12:04,971 INFO L87 Difference]: Start difference. First operand 2391 states and 3289 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 2 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2025-03-04 04:12:05,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:12:05,105 INFO L93 Difference]: Finished difference Result 3854 states and 5259 transitions. [2025-03-04 04:12:05,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 04:12:05,106 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 2 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 278 [2025-03-04 04:12:05,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:12:05,116 INFO L225 Difference]: With dead ends: 3854 [2025-03-04 04:12:05,116 INFO L226 Difference]: Without dead ends: 1503 [2025-03-04 04:12:05,124 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 04:12:05,125 INFO L435 NwaCegarLoop]: 887 mSDtfsCounter, 164 mSDsluCounter, 777 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 1664 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 04:12:05,125 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 1664 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 04:12:05,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1503 states. [2025-03-04 04:12:05,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1503 to 1492. [2025-03-04 04:12:05,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1492 states, 1066 states have (on average 1.2861163227016885) internal successors, (1371), 1077 states have internal predecessors, (1371), 321 states have call successors, (321), 105 states have call predecessors, (321), 104 states have return successors, (319), 315 states have call predecessors, (319), 319 states have call successors, (319) [2025-03-04 04:12:05,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1492 states to 1492 states and 2011 transitions. [2025-03-04 04:12:05,191 INFO L78 Accepts]: Start accepts. Automaton has 1492 states and 2011 transitions. Word has length 278 [2025-03-04 04:12:05,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:12:05,191 INFO L471 AbstractCegarLoop]: Abstraction has 1492 states and 2011 transitions. [2025-03-04 04:12:05,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 2 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2025-03-04 04:12:05,191 INFO L276 IsEmpty]: Start isEmpty. Operand 1492 states and 2011 transitions. [2025-03-04 04:12:05,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2025-03-04 04:12:05,197 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:12:05,197 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 04:12:05,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 04:12:05,197 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:12:05,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:12:05,197 INFO L85 PathProgramCache]: Analyzing trace with hash 1333301910, now seen corresponding path program 1 times [2025-03-04 04:12:05,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:12:05,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067688916] [2025-03-04 04:12:05,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:12:05,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:12:05,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 293 statements into 1 equivalence classes. [2025-03-04 04:12:05,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 293 of 293 statements. [2025-03-04 04:12:05,346 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:12:05,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:12:05,685 INFO L134 CoverageAnalysis]: Checked inductivity of 717 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 710 trivial. 0 not checked. [2025-03-04 04:12:05,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:12:05,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067688916] [2025-03-04 04:12:05,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067688916] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:12:05,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:12:05,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 04:12:05,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809388293] [2025-03-04 04:12:05,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:12:05,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 04:12:05,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:12:05,688 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 04:12:05,688 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 04:12:05,688 INFO L87 Difference]: Start difference. First operand 1492 states and 2011 transitions. Second operand has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 3 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (24), 3 states have call predecessors, (24), 2 states have call successors, (24) [2025-03-04 04:12:05,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:12:05,807 INFO L93 Difference]: Finished difference Result 2894 states and 3925 transitions. [2025-03-04 04:12:05,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 04:12:05,808 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 3 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (24), 3 states have call predecessors, (24), 2 states have call successors, (24) Word has length 293 [2025-03-04 04:12:05,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:12:05,820 INFO L225 Difference]: With dead ends: 2894 [2025-03-04 04:12:05,820 INFO L226 Difference]: Without dead ends: 1492 [2025-03-04 04:12:05,827 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 04:12:05,828 INFO L435 NwaCegarLoop]: 877 mSDtfsCounter, 2 mSDsluCounter, 1740 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2617 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 04:12:05,828 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2617 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 04:12:05,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1492 states. [2025-03-04 04:12:05,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1492 to 1492. [2025-03-04 04:12:05,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1492 states, 1066 states have (on average 1.2842401500938085) internal successors, (1369), 1077 states have internal predecessors, (1369), 321 states have call successors, (321), 105 states have call predecessors, (321), 104 states have return successors, (319), 315 states have call predecessors, (319), 319 states have call successors, (319) [2025-03-04 04:12:05,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1492 states to 1492 states and 2009 transitions. [2025-03-04 04:12:05,917 INFO L78 Accepts]: Start accepts. Automaton has 1492 states and 2009 transitions. Word has length 293 [2025-03-04 04:12:05,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:12:05,918 INFO L471 AbstractCegarLoop]: Abstraction has 1492 states and 2009 transitions. [2025-03-04 04:12:05,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 3 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (24), 3 states have call predecessors, (24), 2 states have call successors, (24) [2025-03-04 04:12:05,919 INFO L276 IsEmpty]: Start isEmpty. Operand 1492 states and 2009 transitions. [2025-03-04 04:12:05,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2025-03-04 04:12:05,924 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:12:05,924 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 04:12:05,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 04:12:05,925 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:12:05,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:12:05,926 INFO L85 PathProgramCache]: Analyzing trace with hash 54176291, now seen corresponding path program 1 times [2025-03-04 04:12:05,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:12:05,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478115847] [2025-03-04 04:12:05,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:12:05,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:12:06,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 295 statements into 1 equivalence classes. [2025-03-04 04:12:06,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 295 of 295 statements. [2025-03-04 04:12:06,100 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:12:06,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:12:06,536 INFO L134 CoverageAnalysis]: Checked inductivity of 717 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 647 trivial. 0 not checked. [2025-03-04 04:12:06,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:12:06,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478115847] [2025-03-04 04:12:06,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478115847] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 04:12:06,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [573573287] [2025-03-04 04:12:06,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:12:06,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 04:12:06,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 04:12:06,538 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 04:12:06,540 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 04:12:06,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 295 statements into 1 equivalence classes. [2025-03-04 04:12:07,292 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 295 of 295 statements. [2025-03-04 04:12:07,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:12:07,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:12:07,301 INFO L256 TraceCheckSpWp]: Trace formula consists of 2060 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-04 04:12:07,307 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 04:12:07,350 INFO L134 CoverageAnalysis]: Checked inductivity of 717 backedges. 216 proven. 0 refuted. 0 times theorem prover too weak. 501 trivial. 0 not checked. [2025-03-04 04:12:07,351 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 04:12:07,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [573573287] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:12:07,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 04:12:07,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 8 [2025-03-04 04:12:07,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193363413] [2025-03-04 04:12:07,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:12:07,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 04:12:07,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:12:07,354 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 04:12:07,355 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-04 04:12:07,355 INFO L87 Difference]: Start difference. First operand 1492 states and 2009 transitions. Second operand has 6 states, 5 states have (on average 21.8) internal successors, (109), 6 states have internal predecessors, (109), 3 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (27), 3 states have call predecessors, (27), 3 states have call successors, (27) [2025-03-04 04:12:07,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:12:07,559 INFO L93 Difference]: Finished difference Result 2980 states and 4021 transitions. [2025-03-04 04:12:07,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 04:12:07,561 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 21.8) internal successors, (109), 6 states have internal predecessors, (109), 3 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (27), 3 states have call predecessors, (27), 3 states have call successors, (27) Word has length 295 [2025-03-04 04:12:07,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:12:07,572 INFO L225 Difference]: With dead ends: 2980 [2025-03-04 04:12:07,572 INFO L226 Difference]: Without dead ends: 1493 [2025-03-04 04:12:07,577 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 294 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-03-04 04:12:07,578 INFO L435 NwaCegarLoop]: 864 mSDtfsCounter, 4 mSDsluCounter, 3428 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 4292 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 04:12:07,578 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 4292 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 04:12:07,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1493 states. [2025-03-04 04:12:07,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1493 to 1493. [2025-03-04 04:12:07,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1493 states, 1067 states have (on average 1.2839737582005624) internal successors, (1370), 1078 states have internal predecessors, (1370), 321 states have call successors, (321), 105 states have call predecessors, (321), 104 states have return successors, (319), 315 states have call predecessors, (319), 319 states have call successors, (319) [2025-03-04 04:12:07,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1493 states to 1493 states and 2010 transitions. [2025-03-04 04:12:07,649 INFO L78 Accepts]: Start accepts. Automaton has 1493 states and 2010 transitions. Word has length 295 [2025-03-04 04:12:07,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:12:07,649 INFO L471 AbstractCegarLoop]: Abstraction has 1493 states and 2010 transitions. [2025-03-04 04:12:07,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 21.8) internal successors, (109), 6 states have internal predecessors, (109), 3 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (27), 3 states have call predecessors, (27), 3 states have call successors, (27) [2025-03-04 04:12:07,649 INFO L276 IsEmpty]: Start isEmpty. Operand 1493 states and 2010 transitions. [2025-03-04 04:12:07,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2025-03-04 04:12:07,653 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:12:07,653 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 04:12:07,666 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 04:12:07,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 04:12:07,854 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:12:07,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:12:07,854 INFO L85 PathProgramCache]: Analyzing trace with hash -286582464, now seen corresponding path program 1 times [2025-03-04 04:12:07,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:12:07,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059610855] [2025-03-04 04:12:07,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:12:07,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:12:07,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 306 statements into 1 equivalence classes. [2025-03-04 04:12:08,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 306 of 306 statements. [2025-03-04 04:12:08,000 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:12:08,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:12:08,598 INFO L134 CoverageAnalysis]: Checked inductivity of 893 backedges. 10 proven. 91 refuted. 0 times theorem prover too weak. 792 trivial. 0 not checked. [2025-03-04 04:12:08,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:12:08,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059610855] [2025-03-04 04:12:08,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059610855] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 04:12:08,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [550220163] [2025-03-04 04:12:08,598 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:12:08,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 04:12:08,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 04:12:08,601 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 04:12:08,602 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 04:12:09,213 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 306 statements into 1 equivalence classes. [2025-03-04 04:12:09,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 306 of 306 statements. [2025-03-04 04:12:09,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:12:09,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:12:09,690 INFO L256 TraceCheckSpWp]: Trace formula consists of 2225 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-03-04 04:12:09,696 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 04:12:09,748 INFO L134 CoverageAnalysis]: Checked inductivity of 893 backedges. 351 proven. 1 refuted. 0 times theorem prover too weak. 541 trivial. 0 not checked. [2025-03-04 04:12:09,748 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 04:12:10,113 INFO L134 CoverageAnalysis]: Checked inductivity of 893 backedges. 10 proven. 91 refuted. 0 times theorem prover too weak. 792 trivial. 0 not checked. [2025-03-04 04:12:10,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [550220163] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 04:12:10,113 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 04:12:10,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-03-04 04:12:10,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895005039] [2025-03-04 04:12:10,114 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 04:12:10,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 04:12:10,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:12:10,115 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 04:12:10,115 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2025-03-04 04:12:10,115 INFO L87 Difference]: Start difference. First operand 1493 states and 2010 transitions. Second operand has 13 states, 11 states have (on average 12.818181818181818) internal successors, (141), 13 states have internal predecessors, (141), 4 states have call successors, (46), 2 states have call predecessors, (46), 6 states have return successors, (48), 4 states have call predecessors, (48), 4 states have call successors, (48) [2025-03-04 04:12:10,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:12:10,419 INFO L93 Difference]: Finished difference Result 2998 states and 4044 transitions. [2025-03-04 04:12:10,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 04:12:10,420 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 12.818181818181818) internal successors, (141), 13 states have internal predecessors, (141), 4 states have call successors, (46), 2 states have call predecessors, (46), 6 states have return successors, (48), 4 states have call predecessors, (48), 4 states have call successors, (48) Word has length 306 [2025-03-04 04:12:10,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:12:10,429 INFO L225 Difference]: With dead ends: 2998 [2025-03-04 04:12:10,429 INFO L226 Difference]: Without dead ends: 1515 [2025-03-04 04:12:10,434 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 623 GetRequests, 605 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2025-03-04 04:12:10,435 INFO L435 NwaCegarLoop]: 863 mSDtfsCounter, 14 mSDsluCounter, 6008 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 6871 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 04:12:10,435 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 6871 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 04:12:10,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1515 states. [2025-03-04 04:12:10,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1515 to 1515. [2025-03-04 04:12:10,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1515 states, 1083 states have (on average 1.2825484764542936) internal successors, (1389), 1094 states have internal predecessors, (1389), 323 states have call successors, (323), 109 states have call predecessors, (323), 108 states have return successors, (321), 317 states have call predecessors, (321), 321 states have call successors, (321) [2025-03-04 04:12:10,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1515 states to 1515 states and 2033 transitions. [2025-03-04 04:12:10,484 INFO L78 Accepts]: Start accepts. Automaton has 1515 states and 2033 transitions. Word has length 306 [2025-03-04 04:12:10,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:12:10,485 INFO L471 AbstractCegarLoop]: Abstraction has 1515 states and 2033 transitions. [2025-03-04 04:12:10,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 12.818181818181818) internal successors, (141), 13 states have internal predecessors, (141), 4 states have call successors, (46), 2 states have call predecessors, (46), 6 states have return successors, (48), 4 states have call predecessors, (48), 4 states have call successors, (48) [2025-03-04 04:12:10,485 INFO L276 IsEmpty]: Start isEmpty. Operand 1515 states and 2033 transitions. [2025-03-04 04:12:10,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2025-03-04 04:12:10,489 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:12:10,490 INFO L218 NwaCegarLoop]: trace histogram [21, 11, 11, 11, 11, 11, 11, 11, 11, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 04:12:10,503 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 04:12:10,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 04:12:10,691 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:12:10,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:12:10,691 INFO L85 PathProgramCache]: Analyzing trace with hash 426437106, now seen corresponding path program 2 times [2025-03-04 04:12:10,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:12:10,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601581183] [2025-03-04 04:12:10,692 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 04:12:10,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:12:10,800 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 316 statements into 2 equivalence classes. [2025-03-04 04:12:10,949 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 316 of 316 statements. [2025-03-04 04:12:10,949 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 04:12:10,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:12:11,495 INFO L134 CoverageAnalysis]: Checked inductivity of 1158 backedges. 12 proven. 138 refuted. 0 times theorem prover too weak. 1008 trivial. 0 not checked. [2025-03-04 04:12:11,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:12:11,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601581183] [2025-03-04 04:12:11,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601581183] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 04:12:11,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [663525363] [2025-03-04 04:12:11,496 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 04:12:11,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 04:12:11,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 04:12:11,498 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 04:12:11,499 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 04:12:11,939 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 316 statements into 2 equivalence classes. [2025-03-04 04:12:12,577 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 316 of 316 statements. [2025-03-04 04:12:12,577 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 04:12:12,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:12:12,588 INFO L256 TraceCheckSpWp]: Trace formula consists of 2375 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-03-04 04:12:12,596 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 04:12:12,655 INFO L134 CoverageAnalysis]: Checked inductivity of 1158 backedges. 674 proven. 39 refuted. 0 times theorem prover too weak. 445 trivial. 0 not checked. [2025-03-04 04:12:12,656 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 04:12:13,006 INFO L134 CoverageAnalysis]: Checked inductivity of 1158 backedges. 87 proven. 63 refuted. 0 times theorem prover too weak. 1008 trivial. 0 not checked. [2025-03-04 04:12:13,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [663525363] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 04:12:13,007 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 04:12:13,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2025-03-04 04:12:13,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19961796] [2025-03-04 04:12:13,007 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 04:12:13,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-04 04:12:13,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:12:13,010 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-04 04:12:13,010 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2025-03-04 04:12:13,010 INFO L87 Difference]: Start difference. First operand 1515 states and 2033 transitions. Second operand has 17 states, 15 states have (on average 10.133333333333333) internal successors, (152), 17 states have internal predecessors, (152), 4 states have call successors, (46), 2 states have call predecessors, (46), 7 states have return successors, (49), 5 states have call predecessors, (49), 4 states have call successors, (49) [2025-03-04 04:12:13,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:12:13,368 INFO L93 Difference]: Finished difference Result 3022 states and 4063 transitions. [2025-03-04 04:12:13,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-04 04:12:13,369 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 10.133333333333333) internal successors, (152), 17 states have internal predecessors, (152), 4 states have call successors, (46), 2 states have call predecessors, (46), 7 states have return successors, (49), 5 states have call predecessors, (49), 4 states have call successors, (49) Word has length 316 [2025-03-04 04:12:13,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:12:13,379 INFO L225 Difference]: With dead ends: 3022 [2025-03-04 04:12:13,379 INFO L226 Difference]: Without dead ends: 1517 [2025-03-04 04:12:13,385 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 646 GetRequests, 623 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=109, Invalid=491, Unknown=0, NotChecked=0, Total=600 [2025-03-04 04:12:13,386 INFO L435 NwaCegarLoop]: 866 mSDtfsCounter, 19 mSDsluCounter, 6877 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 7743 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 04:12:13,386 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 7743 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 04:12:13,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1517 states. [2025-03-04 04:12:13,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1517 to 1517. [2025-03-04 04:12:13,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1517 states, 1085 states have (on average 1.2820276497695853) internal successors, (1391), 1096 states have internal predecessors, (1391), 323 states have call successors, (323), 109 states have call predecessors, (323), 108 states have return successors, (321), 317 states have call predecessors, (321), 321 states have call successors, (321) [2025-03-04 04:12:13,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1517 states to 1517 states and 2035 transitions. [2025-03-04 04:12:13,449 INFO L78 Accepts]: Start accepts. Automaton has 1517 states and 2035 transitions. Word has length 316 [2025-03-04 04:12:13,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:12:13,449 INFO L471 AbstractCegarLoop]: Abstraction has 1517 states and 2035 transitions. [2025-03-04 04:12:13,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 10.133333333333333) internal successors, (152), 17 states have internal predecessors, (152), 4 states have call successors, (46), 2 states have call predecessors, (46), 7 states have return successors, (49), 5 states have call predecessors, (49), 4 states have call successors, (49) [2025-03-04 04:12:13,450 INFO L276 IsEmpty]: Start isEmpty. Operand 1517 states and 2035 transitions. [2025-03-04 04:12:13,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2025-03-04 04:12:13,454 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:12:13,454 INFO L218 NwaCegarLoop]: trace histogram [31, 11, 11, 11, 11, 11, 11, 11, 11, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 04:12:13,470 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-04 04:12:13,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-04 04:12:13,655 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:12:13,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:12:13,657 INFO L85 PathProgramCache]: Analyzing trace with hash -492842944, now seen corresponding path program 3 times [2025-03-04 04:12:13,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:12:13,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616494361] [2025-03-04 04:12:13,657 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 04:12:13,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:12:13,735 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 326 statements into 17 equivalence classes. [2025-03-04 04:12:14,017 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 212 of 326 statements. [2025-03-04 04:12:14,017 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-04 04:12:14,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:12:14,403 INFO L134 CoverageAnalysis]: Checked inductivity of 1523 backedges. 212 proven. 6 refuted. 0 times theorem prover too weak. 1305 trivial. 0 not checked. [2025-03-04 04:12:14,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:12:14,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616494361] [2025-03-04 04:12:14,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616494361] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 04:12:14,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [866688573] [2025-03-04 04:12:14,404 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 04:12:14,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 04:12:14,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 04:12:14,407 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 04:12:14,408 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 04:12:14,938 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 326 statements into 17 equivalence classes. [2025-03-04 04:12:19,538 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 212 of 326 statements. [2025-03-04 04:12:19,538 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-04 04:12:19,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:12:19,551 INFO L256 TraceCheckSpWp]: Trace formula consists of 1695 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-04 04:12:19,557 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 04:12:19,630 INFO L134 CoverageAnalysis]: Checked inductivity of 1523 backedges. 346 proven. 6 refuted. 0 times theorem prover too weak. 1171 trivial. 0 not checked. [2025-03-04 04:12:19,630 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 04:12:20,000 INFO L134 CoverageAnalysis]: Checked inductivity of 1523 backedges. 212 proven. 6 refuted. 0 times theorem prover too weak. 1305 trivial. 0 not checked. [2025-03-04 04:12:20,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [866688573] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 04:12:20,000 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 04:12:20,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2025-03-04 04:12:20,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667164832] [2025-03-04 04:12:20,000 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 04:12:20,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-04 04:12:20,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:12:20,002 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-04 04:12:20,002 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=273, Unknown=0, NotChecked=0, Total=342 [2025-03-04 04:12:20,002 INFO L87 Difference]: Start difference. First operand 1517 states and 2035 transitions. Second operand has 19 states, 17 states have (on average 8.235294117647058) internal successors, (140), 19 states have internal predecessors, (140), 4 states have call successors, (36), 2 states have call predecessors, (36), 6 states have return successors, (38), 4 states have call predecessors, (38), 4 states have call successors, (38) [2025-03-04 04:12:20,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:12:20,387 INFO L93 Difference]: Finished difference Result 3026 states and 4067 transitions. [2025-03-04 04:12:20,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-04 04:12:20,389 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 8.235294117647058) internal successors, (140), 19 states have internal predecessors, (140), 4 states have call successors, (36), 2 states have call predecessors, (36), 6 states have return successors, (38), 4 states have call predecessors, (38), 4 states have call successors, (38) Word has length 326 [2025-03-04 04:12:20,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:12:20,409 INFO L225 Difference]: With dead ends: 3026 [2025-03-04 04:12:20,410 INFO L226 Difference]: Without dead ends: 1519 [2025-03-04 04:12:20,417 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 667 GetRequests, 641 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=145, Invalid=557, Unknown=0, NotChecked=0, Total=702 [2025-03-04 04:12:20,418 INFO L435 NwaCegarLoop]: 863 mSDtfsCounter, 19 mSDsluCounter, 10333 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 11196 SdHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 04:12:20,418 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 11196 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 329 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 04:12:20,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1519 states. [2025-03-04 04:12:20,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1519 to 1519. [2025-03-04 04:12:20,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1519 states, 1087 states have (on average 1.281508739650414) internal successors, (1393), 1098 states have internal predecessors, (1393), 323 states have call successors, (323), 109 states have call predecessors, (323), 108 states have return successors, (321), 317 states have call predecessors, (321), 321 states have call successors, (321) [2025-03-04 04:12:20,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1519 states to 1519 states and 2037 transitions. [2025-03-04 04:12:20,505 INFO L78 Accepts]: Start accepts. Automaton has 1519 states and 2037 transitions. Word has length 326 [2025-03-04 04:12:20,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:12:20,505 INFO L471 AbstractCegarLoop]: Abstraction has 1519 states and 2037 transitions. [2025-03-04 04:12:20,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 8.235294117647058) internal successors, (140), 19 states have internal predecessors, (140), 4 states have call successors, (36), 2 states have call predecessors, (36), 6 states have return successors, (38), 4 states have call predecessors, (38), 4 states have call successors, (38) [2025-03-04 04:12:20,506 INFO L276 IsEmpty]: Start isEmpty. Operand 1519 states and 2037 transitions. [2025-03-04 04:12:20,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2025-03-04 04:12:20,510 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:12:20,510 INFO L218 NwaCegarLoop]: trace histogram [41, 11, 11, 11, 11, 11, 11, 11, 11, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 04:12:20,527 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-04 04:12:20,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 04:12:20,713 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:12:20,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:12:20,714 INFO L85 PathProgramCache]: Analyzing trace with hash -2024277390, now seen corresponding path program 4 times [2025-03-04 04:12:20,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:12:20,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532131935] [2025-03-04 04:12:20,714 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 04:12:20,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:12:20,812 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 336 statements into 2 equivalence classes. [2025-03-04 04:12:20,921 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 336 of 336 statements. [2025-03-04 04:12:20,922 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 04:12:20,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:12:21,593 INFO L134 CoverageAnalysis]: Checked inductivity of 1988 backedges. 202 proven. 103 refuted. 0 times theorem prover too weak. 1683 trivial. 0 not checked. [2025-03-04 04:12:21,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:12:21,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532131935] [2025-03-04 04:12:21,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532131935] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 04:12:21,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1018249755] [2025-03-04 04:12:21,594 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 04:12:21,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 04:12:21,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 04:12:21,596 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 04:12:21,598 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 04:12:22,113 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 336 statements into 2 equivalence classes. [2025-03-04 04:12:28,673 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 336 of 336 statements. [2025-03-04 04:12:28,673 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 04:12:28,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:12:28,688 INFO L256 TraceCheckSpWp]: Trace formula consists of 2675 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-03-04 04:12:28,698 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 04:12:28,771 INFO L134 CoverageAnalysis]: Checked inductivity of 1988 backedges. 1184 proven. 10 refuted. 0 times theorem prover too weak. 794 trivial. 0 not checked. [2025-03-04 04:12:28,771 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 04:12:29,162 INFO L134 CoverageAnalysis]: Checked inductivity of 1988 backedges. 140 proven. 165 refuted. 0 times theorem prover too weak. 1683 trivial. 0 not checked. [2025-03-04 04:12:29,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1018249755] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 04:12:29,162 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 04:12:29,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 23 [2025-03-04 04:12:29,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888113902] [2025-03-04 04:12:29,162 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 04:12:29,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-04 04:12:29,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:12:29,163 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-04 04:12:29,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=422, Unknown=0, NotChecked=0, Total=506 [2025-03-04 04:12:29,164 INFO L87 Difference]: Start difference. First operand 1519 states and 2037 transitions. Second operand has 23 states, 21 states have (on average 7.333333333333333) internal successors, (154), 23 states have internal predecessors, (154), 4 states have call successors, (44), 2 states have call predecessors, (44), 7 states have return successors, (47), 5 states have call predecessors, (47), 4 states have call successors, (47) [2025-03-04 04:12:29,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:12:29,577 INFO L93 Difference]: Finished difference Result 3024 states and 4066 transitions. [2025-03-04 04:12:29,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-04 04:12:29,577 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 7.333333333333333) internal successors, (154), 23 states have internal predecessors, (154), 4 states have call successors, (44), 2 states have call predecessors, (44), 7 states have return successors, (47), 5 states have call predecessors, (47), 4 states have call successors, (47) Word has length 336 [2025-03-04 04:12:29,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:12:29,588 INFO L225 Difference]: With dead ends: 3024 [2025-03-04 04:12:29,588 INFO L226 Difference]: Without dead ends: 1520 [2025-03-04 04:12:29,593 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 690 GetRequests, 659 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=175, Invalid=817, Unknown=0, NotChecked=0, Total=992 [2025-03-04 04:12:29,594 INFO L435 NwaCegarLoop]: 863 mSDtfsCounter, 17 mSDsluCounter, 8592 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 9455 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 04:12:29,594 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 9455 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 04:12:29,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1520 states. [2025-03-04 04:12:29,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1520 to 1520. [2025-03-04 04:12:29,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1520 states, 1088 states have (on average 1.2803308823529411) internal successors, (1393), 1099 states have internal predecessors, (1393), 323 states have call successors, (323), 109 states have call predecessors, (323), 108 states have return successors, (321), 317 states have call predecessors, (321), 321 states have call successors, (321) [2025-03-04 04:12:29,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1520 states to 1520 states and 2037 transitions. [2025-03-04 04:12:29,646 INFO L78 Accepts]: Start accepts. Automaton has 1520 states and 2037 transitions. Word has length 336 [2025-03-04 04:12:29,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:12:29,646 INFO L471 AbstractCegarLoop]: Abstraction has 1520 states and 2037 transitions. [2025-03-04 04:12:29,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 7.333333333333333) internal successors, (154), 23 states have internal predecessors, (154), 4 states have call successors, (44), 2 states have call predecessors, (44), 7 states have return successors, (47), 5 states have call predecessors, (47), 4 states have call successors, (47) [2025-03-04 04:12:29,646 INFO L276 IsEmpty]: Start isEmpty. Operand 1520 states and 2037 transitions. [2025-03-04 04:12:29,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2025-03-04 04:12:29,651 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:12:29,651 INFO L218 NwaCegarLoop]: trace histogram [47, 11, 11, 11, 11, 11, 11, 11, 11, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 04:12:29,701 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-04 04:12:29,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 04:12:29,853 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:12:29,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:12:29,854 INFO L85 PathProgramCache]: Analyzing trace with hash -494453158, now seen corresponding path program 5 times [2025-03-04 04:12:29,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:12:29,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115340377] [2025-03-04 04:12:29,855 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 04:12:29,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:12:29,970 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 342 statements into 18 equivalence classes. [2025-03-04 04:12:30,015 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 41 of 342 statements. [2025-03-04 04:12:30,016 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-03-04 04:12:30,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:12:30,402 INFO L134 CoverageAnalysis]: Checked inductivity of 2315 backedges. 18 proven. 369 refuted. 0 times theorem prover too weak. 1928 trivial. 0 not checked. [2025-03-04 04:12:30,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:12:30,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115340377] [2025-03-04 04:12:30,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115340377] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 04:12:30,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [920449167] [2025-03-04 04:12:30,404 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 04:12:30,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 04:12:30,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 04:12:30,410 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 04:12:30,418 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 04:12:31,026 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 342 statements into 18 equivalence classes. [2025-03-04 04:13:02,406 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 41 of 342 statements. [2025-03-04 04:13:02,406 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-03-04 04:13:02,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:13:02,420 INFO L256 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-03-04 04:13:02,425 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 04:13:02,507 INFO L134 CoverageAnalysis]: Checked inductivity of 2315 backedges. 688 proven. 15 refuted. 0 times theorem prover too weak. 1612 trivial. 0 not checked. [2025-03-04 04:13:02,507 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 04:13:02,886 INFO L134 CoverageAnalysis]: Checked inductivity of 2315 backedges. 60 proven. 327 refuted. 0 times theorem prover too weak. 1928 trivial. 0 not checked. [2025-03-04 04:13:02,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [920449167] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 04:13:02,886 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 04:13:02,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 25 [2025-03-04 04:13:02,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152734254] [2025-03-04 04:13:02,886 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 04:13:02,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-04 04:13:02,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:13:02,888 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-04 04:13:02,888 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=496, Unknown=0, NotChecked=0, Total=600 [2025-03-04 04:13:02,888 INFO L87 Difference]: Start difference. First operand 1520 states and 2037 transitions. Second operand has 25 states, 23 states have (on average 6.695652173913044) internal successors, (154), 25 states have internal predecessors, (154), 4 states have call successors, (47), 2 states have call predecessors, (47), 6 states have return successors, (49), 4 states have call predecessors, (49), 4 states have call successors, (49) [2025-03-04 04:13:03,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:13:03,242 INFO L93 Difference]: Finished difference Result 3026 states and 4061 transitions. [2025-03-04 04:13:03,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-04 04:13:03,243 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 23 states have (on average 6.695652173913044) internal successors, (154), 25 states have internal predecessors, (154), 4 states have call successors, (47), 2 states have call predecessors, (47), 6 states have return successors, (49), 4 states have call predecessors, (49), 4 states have call successors, (49) Word has length 342 [2025-03-04 04:13:03,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:13:03,254 INFO L225 Difference]: With dead ends: 3026 [2025-03-04 04:13:03,254 INFO L226 Difference]: Without dead ends: 1521 [2025-03-04 04:13:03,259 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 699 GetRequests, 669 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=740, Unknown=0, NotChecked=0, Total=930 [2025-03-04 04:13:03,260 INFO L435 NwaCegarLoop]: 863 mSDtfsCounter, 14 mSDsluCounter, 11187 mSDsCounter, 0 mSdLazyCounter, 420 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 12050 SdHoareTripleChecker+Invalid, 439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 04:13:03,260 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 12050 Invalid, 439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 420 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 04:13:03,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1521 states. [2025-03-04 04:13:03,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1521 to 1521. [2025-03-04 04:13:03,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1521 states, 1089 states have (on average 1.2800734618916436) internal successors, (1394), 1100 states have internal predecessors, (1394), 323 states have call successors, (323), 109 states have call predecessors, (323), 108 states have return successors, (321), 317 states have call predecessors, (321), 321 states have call successors, (321) [2025-03-04 04:13:03,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1521 states to 1521 states and 2038 transitions. [2025-03-04 04:13:03,309 INFO L78 Accepts]: Start accepts. Automaton has 1521 states and 2038 transitions. Word has length 342 [2025-03-04 04:13:03,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:13:03,310 INFO L471 AbstractCegarLoop]: Abstraction has 1521 states and 2038 transitions. [2025-03-04 04:13:03,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 23 states have (on average 6.695652173913044) internal successors, (154), 25 states have internal predecessors, (154), 4 states have call successors, (47), 2 states have call predecessors, (47), 6 states have return successors, (49), 4 states have call predecessors, (49), 4 states have call successors, (49) [2025-03-04 04:13:03,310 INFO L276 IsEmpty]: Start isEmpty. Operand 1521 states and 2038 transitions. [2025-03-04 04:13:03,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2025-03-04 04:13:03,313 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:13:03,313 INFO L218 NwaCegarLoop]: trace histogram [53, 11, 11, 11, 11, 11, 11, 11, 11, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 04:13:03,334 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-04 04:13:03,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-04 04:13:03,515 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:13:03,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:13:03,515 INFO L85 PathProgramCache]: Analyzing trace with hash 1110395826, now seen corresponding path program 6 times [2025-03-04 04:13:03,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:13:03,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728574780] [2025-03-04 04:13:03,516 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 04:13:03,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:13:03,634 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 348 statements into 18 equivalence classes. [2025-03-04 04:13:04,303 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) and asserted 228 of 348 statements. [2025-03-04 04:13:04,303 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2025-03-04 04:13:04,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:13:05,057 INFO L134 CoverageAnalysis]: Checked inductivity of 2678 backedges. 20 proven. 460 refuted. 0 times theorem prover too weak. 2198 trivial. 0 not checked. [2025-03-04 04:13:05,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:13:05,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728574780] [2025-03-04 04:13:05,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728574780] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 04:13:05,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1900279077] [2025-03-04 04:13:05,059 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 04:13:05,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 04:13:05,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 04:13:05,061 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 04:13:05,063 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 04:13:05,658 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 348 statements into 18 equivalence classes.