./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-43_2a-drivers--scsi--device_handler--scsi_dh_rdac.ko-entry_point.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-43_2a-drivers--scsi--device_handler--scsi_dh_rdac.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 230b725329634d718374ec3f6d82161758e5d9913588383fdc3e35a9fd1533f5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 19:59:25,219 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 19:59:25,272 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-08 19:59:25,276 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 19:59:25,277 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 19:59:25,294 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 19:59:25,294 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 19:59:25,295 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 19:59:25,295 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 19:59:25,295 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 19:59:25,295 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 19:59:25,295 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 19:59:25,295 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 19:59:25,295 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 19:59:25,296 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 19:59:25,296 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 19:59:25,296 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 19:59:25,296 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 19:59:25,296 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 19:59:25,296 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 19:59:25,296 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 19:59:25,296 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 19:59:25,296 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 19:59:25,296 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 19:59:25,296 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 19:59:25,296 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 19:59:25,297 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 19:59:25,297 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 19:59:25,297 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 19:59:25,297 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 19:59:25,297 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 19:59:25,297 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 19:59:25,297 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 19:59:25,297 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 19:59:25,297 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 19:59:25,297 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 19:59:25,297 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 19:59:25,297 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 19:59:25,297 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 19:59:25,297 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 19:59:25,297 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 -> 230b725329634d718374ec3f6d82161758e5d9913588383fdc3e35a9fd1533f5 [2025-03-08 19:59:25,513 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 19:59:25,518 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 19:59:25,519 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 19:59:25,520 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 19:59:25,520 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 19:59:25,521 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-43_2a-drivers--scsi--device_handler--scsi_dh_rdac.ko-entry_point.cil.out.i [2025-03-08 19:59:26,605 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fdc0ecf90/be93666ea5fb4f82a604823620952bcf/FLAGcd7e4e6cc [2025-03-08 19:59:27,071 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 19:59:27,071 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-43_2a-drivers--scsi--device_handler--scsi_dh_rdac.ko-entry_point.cil.out.i [2025-03-08 19:59:27,101 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fdc0ecf90/be93666ea5fb4f82a604823620952bcf/FLAGcd7e4e6cc [2025-03-08 19:59:27,111 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fdc0ecf90/be93666ea5fb4f82a604823620952bcf [2025-03-08 19:59:27,112 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 19:59:27,113 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 19:59:27,114 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 19:59:27,114 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 19:59:27,117 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 19:59:27,118 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 07:59:27" (1/1) ... [2025-03-08 19:59:27,118 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@556ffe32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:59:27, skipping insertion in model container [2025-03-08 19:59:27,120 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 07:59:27" (1/1) ... [2025-03-08 19:59:27,186 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 19:59:27,882 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-43_2a-drivers--scsi--device_handler--scsi_dh_rdac.ko-entry_point.cil.out.i[164687,164700] [2025-03-08 19:59:27,924 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 19:59:27,940 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 19:59:28,017 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile (".pushsection .smp_locks,\"a\"\n.balign 4\n.long 671f - .\n.popsection\n671:\n\tlock; subl %2, %0; sete %1": "+m" (v->counter), "=qm" (c): "er" (i): "memory"); [4273-4274] [2025-03-08 19:59:28,019 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile (".pushsection .smp_locks,\"a\"\n.balign 4\n.long 671f - .\n.popsection\n671:\n\tlock; xaddb %b0, %1\n": "+q" (__ret), "+m" (v->counter): : "memory", "cc"); [4285-4286] [2025-03-08 19:59:28,020 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile (".pushsection .smp_locks,\"a\"\n.balign 4\n.long 671f - .\n.popsection\n671:\n\tlock; xaddw %w0, %1\n": "+r" (__ret), "+m" (v->counter): : "memory", "cc"); [4289-4290] [2025-03-08 19:59:28,020 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile (".pushsection .smp_locks,\"a\"\n.balign 4\n.long 671f - .\n.popsection\n671:\n\tlock; xaddl %0, %1\n": "+r" (__ret), "+m" (v->counter): : "memory", "cc"); [4293-4294] [2025-03-08 19:59:28,020 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile (".pushsection .smp_locks,\"a\"\n.balign 4\n.long 671f - .\n.popsection\n671:\n\tlock; xaddq %q0, %1\n": "+r" (__ret), "+m" (v->counter): : "memory", "cc"); [4297-4298] [2025-03-08 19:59:28,137 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-43_2a-drivers--scsi--device_handler--scsi_dh_rdac.ko-entry_point.cil.out.i[164687,164700] [2025-03-08 19:59:28,146 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 19:59:28,175 WARN L1212 FunctionHandler]: The following functions are not defined or handled internally: __xadd_wrong_size [2025-03-08 19:59:28,181 INFO L204 MainTranslator]: Completed translation [2025-03-08 19:59:28,182 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:59:28 WrapperNode [2025-03-08 19:59:28,183 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 19:59:28,184 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 19:59:28,184 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 19:59:28,184 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 19:59:28,188 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:59:28" (1/1) ... [2025-03-08 19:59:28,225 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:59:28" (1/1) ... [2025-03-08 19:59:28,301 INFO L138 Inliner]: procedures = 147, calls = 882, calls flagged for inlining = 62, calls inlined = 60, statements flattened = 2112 [2025-03-08 19:59:28,302 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 19:59:28,302 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 19:59:28,302 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 19:59:28,302 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 19:59:28,309 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:59:28" (1/1) ... [2025-03-08 19:59:28,309 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:59:28" (1/1) ... [2025-03-08 19:59:28,326 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:59:28" (1/1) ... [2025-03-08 19:59:28,496 INFO L175 MemorySlicer]: Split 543 memory accesses to 16 slices as follows [2, 8, 2, 182, 5, 14, 3, 16, 14, 4, 3, 218, 56, 12, 2, 2]. 40 percent of accesses are in the largest equivalence class. The 258 initializations are split as follows [2, 0, 0, 182, 5, 14, 3, 16, 14, 3, 2, 17, 0, 0, 0, 0]. The 146 writes are split as follows [0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 81, 51, 12, 1, 0]. [2025-03-08 19:59:28,496 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:59:28" (1/1) ... [2025-03-08 19:59:28,496 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:59:28" (1/1) ... [2025-03-08 19:59:28,558 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:59:28" (1/1) ... [2025-03-08 19:59:28,568 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:59:28" (1/1) ... [2025-03-08 19:59:28,585 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:59:28" (1/1) ... [2025-03-08 19:59:28,597 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:59:28" (1/1) ... [2025-03-08 19:59:28,619 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 19:59:28,620 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 19:59:28,620 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 19:59:28,620 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 19:59:28,621 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:59:28" (1/1) ... [2025-03-08 19:59:28,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 19:59:28,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 19:59:28,647 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 19:59:28,652 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 19:59:28,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-03-08 19:59:28,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-03-08 19:59:28,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-03-08 19:59:28,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-03-08 19:59:28,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-03-08 19:59:28,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-03-08 19:59:28,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2025-03-08 19:59:28,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2025-03-08 19:59:28,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#8 [2025-03-08 19:59:28,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#9 [2025-03-08 19:59:28,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#10 [2025-03-08 19:59:28,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#11 [2025-03-08 19:59:28,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#12 [2025-03-08 19:59:28,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#13 [2025-03-08 19:59:28,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#14 [2025-03-08 19:59:28,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#15 [2025-03-08 19:59:28,670 INFO L130 BoogieDeclarations]: Found specification of procedure kref_sub [2025-03-08 19:59:28,670 INFO L138 BoogieDeclarations]: Found implementation of procedure kref_sub [2025-03-08 19:59:28,670 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#0 [2025-03-08 19:59:28,671 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#1 [2025-03-08 19:59:28,671 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#2 [2025-03-08 19:59:28,671 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#3 [2025-03-08 19:59:28,671 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#4 [2025-03-08 19:59:28,671 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#5 [2025-03-08 19:59:28,671 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#6 [2025-03-08 19:59:28,671 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#7 [2025-03-08 19:59:28,671 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#8 [2025-03-08 19:59:28,672 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#9 [2025-03-08 19:59:28,672 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#10 [2025-03-08 19:59:28,672 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#11 [2025-03-08 19:59:28,672 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#12 [2025-03-08 19:59:28,672 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#13 [2025-03-08 19:59:28,673 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#14 [2025-03-08 19:59:28,673 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#15 [2025-03-08 19:59:28,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-03-08 19:59:28,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-03-08 19:59:28,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-03-08 19:59:28,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-03-08 19:59:28,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-03-08 19:59:28,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2025-03-08 19:59:28,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2025-03-08 19:59:28,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#7 [2025-03-08 19:59:28,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#8 [2025-03-08 19:59:28,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#9 [2025-03-08 19:59:28,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#10 [2025-03-08 19:59:28,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#11 [2025-03-08 19:59:28,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#12 [2025-03-08 19:59:28,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#13 [2025-03-08 19:59:28,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#14 [2025-03-08 19:59:28,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#15 [2025-03-08 19:59:28,673 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2025-03-08 19:59:28,673 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2025-03-08 19:59:28,673 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 19:59:28,673 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 19:59:28,673 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-08 19:59:28,673 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-08 19:59:28,673 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-08 19:59:28,673 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-08 19:59:28,673 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-08 19:59:28,673 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-08 19:59:28,673 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-03-08 19:59:28,673 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-03-08 19:59:28,673 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-03-08 19:59:28,673 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-03-08 19:59:28,673 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-03-08 19:59:28,674 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-03-08 19:59:28,674 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-03-08 19:59:28,674 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2025-03-08 19:59:28,674 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2025-03-08 19:59:28,674 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2025-03-08 19:59:28,674 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#0 [2025-03-08 19:59:28,674 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#1 [2025-03-08 19:59:28,674 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#2 [2025-03-08 19:59:28,674 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#3 [2025-03-08 19:59:28,674 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#4 [2025-03-08 19:59:28,674 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#5 [2025-03-08 19:59:28,674 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#6 [2025-03-08 19:59:28,674 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#7 [2025-03-08 19:59:28,674 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#8 [2025-03-08 19:59:28,674 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#9 [2025-03-08 19:59:28,674 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#10 [2025-03-08 19:59:28,674 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#11 [2025-03-08 19:59:28,674 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#12 [2025-03-08 19:59:28,674 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#13 [2025-03-08 19:59:28,674 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#14 [2025-03-08 19:59:28,674 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#15 [2025-03-08 19:59:28,674 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#0 [2025-03-08 19:59:28,674 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#1 [2025-03-08 19:59:28,674 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#2 [2025-03-08 19:59:28,674 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#3 [2025-03-08 19:59:28,674 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#4 [2025-03-08 19:59:28,674 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#5 [2025-03-08 19:59:28,674 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#6 [2025-03-08 19:59:28,674 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#7 [2025-03-08 19:59:28,674 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#8 [2025-03-08 19:59:28,674 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#9 [2025-03-08 19:59:28,674 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#10 [2025-03-08 19:59:28,674 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#11 [2025-03-08 19:59:28,674 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#12 [2025-03-08 19:59:28,674 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#13 [2025-03-08 19:59:28,674 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#14 [2025-03-08 19:59:28,674 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#15 [2025-03-08 19:59:28,674 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2025-03-08 19:59:28,675 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2025-03-08 19:59:28,675 INFO L130 BoogieDeclarations]: Found specification of procedure get_rdac_data [2025-03-08 19:59:28,676 INFO L138 BoogieDeclarations]: Found implementation of procedure get_rdac_data [2025-03-08 19:59:28,676 INFO L130 BoogieDeclarations]: Found specification of procedure blk_put_request [2025-03-08 19:59:28,676 INFO L138 BoogieDeclarations]: Found implementation of procedure blk_put_request [2025-03-08 19:59:28,676 INFO L130 BoogieDeclarations]: Found specification of procedure activate_work_1 [2025-03-08 19:59:28,676 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_work_1 [2025-03-08 19:59:28,676 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2025-03-08 19:59:28,676 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2025-03-08 19:59:28,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 19:59:28,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 19:59:28,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-08 19:59:28,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-08 19:59:28,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-08 19:59:28,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-08 19:59:28,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-08 19:59:28,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-08 19:59:28,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-03-08 19:59:28,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-03-08 19:59:28,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-03-08 19:59:28,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-03-08 19:59:28,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-03-08 19:59:28,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-03-08 19:59:28,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-03-08 19:59:28,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2025-03-08 19:59:28,677 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2025-03-08 19:59:28,677 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2025-03-08 19:59:28,677 INFO L130 BoogieDeclarations]: Found specification of procedure send_mode_select [2025-03-08 19:59:28,677 INFO L138 BoogieDeclarations]: Found implementation of procedure send_mode_select [2025-03-08 19:59:28,677 INFO L130 BoogieDeclarations]: Found specification of procedure kref_put [2025-03-08 19:59:28,677 INFO L138 BoogieDeclarations]: Found implementation of procedure kref_put [2025-03-08 19:59:28,677 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2025-03-08 19:59:28,677 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2025-03-08 19:59:28,677 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-03-08 19:59:28,677 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-03-08 19:59:28,678 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-03-08 19:59:28,678 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#3 [2025-03-08 19:59:28,678 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#4 [2025-03-08 19:59:28,678 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#5 [2025-03-08 19:59:28,678 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#6 [2025-03-08 19:59:28,678 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#7 [2025-03-08 19:59:28,678 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#8 [2025-03-08 19:59:28,678 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#9 [2025-03-08 19:59:28,678 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#10 [2025-03-08 19:59:28,678 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#11 [2025-03-08 19:59:28,678 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#12 [2025-03-08 19:59:28,678 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#13 [2025-03-08 19:59:28,678 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#14 [2025-03-08 19:59:28,678 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#15 [2025-03-08 19:59:28,678 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-03-08 19:59:28,678 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-03-08 19:59:28,678 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-03-08 19:59:28,678 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#3 [2025-03-08 19:59:28,679 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#4 [2025-03-08 19:59:28,679 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#5 [2025-03-08 19:59:28,679 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#6 [2025-03-08 19:59:28,679 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#7 [2025-03-08 19:59:28,679 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#8 [2025-03-08 19:59:28,679 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#9 [2025-03-08 19:59:28,679 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#10 [2025-03-08 19:59:28,679 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#11 [2025-03-08 19:59:28,679 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#12 [2025-03-08 19:59:28,679 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#13 [2025-03-08 19:59:28,679 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#14 [2025-03-08 19:59:28,679 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#15 [2025-03-08 19:59:28,679 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_zalloc [2025-03-08 19:59:28,679 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_zalloc [2025-03-08 19:59:28,679 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 19:59:28,679 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 19:59:28,679 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-08 19:59:28,679 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~int~TO~VOID [2025-03-08 19:59:28,679 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~int~TO~VOID [2025-03-08 19:59:28,679 INFO L130 BoogieDeclarations]: Found specification of procedure scsi_unregister_device_handler [2025-03-08 19:59:28,679 INFO L138 BoogieDeclarations]: Found implementation of procedure scsi_unregister_device_handler [2025-03-08 19:59:28,679 INFO L130 BoogieDeclarations]: Found specification of procedure ERR_PTR [2025-03-08 19:59:28,679 INFO L138 BoogieDeclarations]: Found implementation of procedure ERR_PTR [2025-03-08 19:59:28,679 INFO L130 BoogieDeclarations]: Found specification of procedure __list_add [2025-03-08 19:59:28,679 INFO L138 BoogieDeclarations]: Found implementation of procedure __list_add [2025-03-08 19:59:28,679 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 19:59:28,679 INFO L130 BoogieDeclarations]: Found specification of procedure submit_inquiry [2025-03-08 19:59:28,679 INFO L138 BoogieDeclarations]: Found implementation of procedure submit_inquiry [2025-03-08 19:59:28,679 INFO L130 BoogieDeclarations]: Found specification of procedure rdac_bus_detach [2025-03-08 19:59:28,679 INFO L138 BoogieDeclarations]: Found implementation of procedure rdac_bus_detach [2025-03-08 19:59:28,679 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-08 19:59:28,679 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-08 19:59:28,679 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-08 19:59:28,679 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-08 19:59:28,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-08 19:59:28,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-03-08 19:59:28,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-03-08 19:59:28,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-03-08 19:59:28,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-03-08 19:59:28,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-03-08 19:59:28,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-03-08 19:59:28,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-03-08 19:59:28,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-03-08 19:59:28,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-03-08 19:59:28,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-03-08 19:59:28,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2025-03-08 19:59:28,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#15 [2025-03-08 19:59:28,681 INFO L130 BoogieDeclarations]: Found specification of procedure rdac_match [2025-03-08 19:59:28,681 INFO L138 BoogieDeclarations]: Found implementation of procedure rdac_match [2025-03-08 19:59:28,681 INFO L130 BoogieDeclarations]: Found specification of procedure INIT_LIST_HEAD [2025-03-08 19:59:28,681 INFO L138 BoogieDeclarations]: Found implementation of procedure INIT_LIST_HEAD [2025-03-08 19:59:28,681 INFO L130 BoogieDeclarations]: Found specification of procedure blk_execute_rq [2025-03-08 19:59:28,681 INFO L138 BoogieDeclarations]: Found implementation of procedure blk_execute_rq [2025-03-08 19:59:28,681 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2025-03-08 19:59:28,681 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2025-03-08 19:59:28,681 INFO L130 BoogieDeclarations]: Found specification of procedure sdev_prefix_printk [2025-03-08 19:59:28,681 INFO L138 BoogieDeclarations]: Found implementation of procedure sdev_prefix_printk [2025-03-08 19:59:28,681 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-08 19:59:28,681 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-08 19:59:28,681 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-08 19:59:28,681 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-08 19:59:28,681 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-03-08 19:59:28,681 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-03-08 19:59:28,681 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-03-08 19:59:28,681 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-03-08 19:59:28,681 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-03-08 19:59:28,681 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-03-08 19:59:28,681 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-03-08 19:59:28,681 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-03-08 19:59:28,681 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-03-08 19:59:28,681 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-03-08 19:59:28,681 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2025-03-08 19:59:28,681 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#15 [2025-03-08 19:59:28,681 INFO L130 BoogieDeclarations]: Found specification of procedure call_and_disable_work_1 [2025-03-08 19:59:28,681 INFO L138 BoogieDeclarations]: Found implementation of procedure call_and_disable_work_1 [2025-03-08 19:59:28,681 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2025-03-08 19:59:28,681 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2025-03-08 19:59:28,681 INFO L130 BoogieDeclarations]: Found specification of procedure check_ownership [2025-03-08 19:59:28,681 INFO L138 BoogieDeclarations]: Found implementation of procedure check_ownership [2025-03-08 19:59:28,681 INFO L130 BoogieDeclarations]: Found specification of procedure call_and_disable_all_1 [2025-03-08 19:59:28,681 INFO L138 BoogieDeclarations]: Found implementation of procedure call_and_disable_all_1 [2025-03-08 19:59:28,681 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 19:59:28,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-08 19:59:28,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-08 19:59:28,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-08 19:59:28,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-03-08 19:59:28,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-03-08 19:59:28,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-03-08 19:59:28,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-03-08 19:59:28,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2025-03-08 19:59:28,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2025-03-08 19:59:28,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2025-03-08 19:59:28,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2025-03-08 19:59:28,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2025-03-08 19:59:28,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2025-03-08 19:59:28,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2025-03-08 19:59:28,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#14 [2025-03-08 19:59:28,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#15 [2025-03-08 19:59:28,682 INFO L130 BoogieDeclarations]: Found specification of procedure get_rdac_req [2025-03-08 19:59:28,682 INFO L138 BoogieDeclarations]: Found implementation of procedure get_rdac_req [2025-03-08 19:59:28,682 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2025-03-08 19:59:28,682 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2025-03-08 19:59:28,682 INFO L130 BoogieDeclarations]: Found specification of procedure warn_slowpath_null [2025-03-08 19:59:28,682 INFO L138 BoogieDeclarations]: Found implementation of procedure warn_slowpath_null [2025-03-08 19:59:28,682 INFO L130 BoogieDeclarations]: Found specification of procedure list_del [2025-03-08 19:59:28,682 INFO L138 BoogieDeclarations]: Found implementation of procedure list_del [2025-03-08 19:59:28,682 INFO L130 BoogieDeclarations]: Found specification of procedure queue_work_on [2025-03-08 19:59:28,682 INFO L138 BoogieDeclarations]: Found implementation of procedure queue_work_on [2025-03-08 19:59:28,682 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2025-03-08 19:59:28,682 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2025-03-08 19:59:28,682 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock [2025-03-08 19:59:28,682 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock [2025-03-08 19:59:28,682 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock [2025-03-08 19:59:28,682 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock [2025-03-08 19:59:28,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 19:59:28,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 19:59:28,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 19:59:28,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-08 19:59:28,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-08 19:59:28,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-08 19:59:28,683 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-08 19:59:28,683 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-08 19:59:28,683 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-08 19:59:28,683 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-08 19:59:28,683 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-08 19:59:28,683 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-08 19:59:28,683 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-08 19:59:28,683 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-03-08 19:59:28,683 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-03-08 19:59:28,684 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-03-08 19:59:28,684 INFO L130 BoogieDeclarations]: Found specification of procedure flush_workqueue [2025-03-08 19:59:28,684 INFO L138 BoogieDeclarations]: Found implementation of procedure flush_workqueue [2025-03-08 19:59:28,684 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#0 [2025-03-08 19:59:28,684 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#1 [2025-03-08 19:59:28,684 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#2 [2025-03-08 19:59:28,684 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#3 [2025-03-08 19:59:28,684 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#4 [2025-03-08 19:59:28,684 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#5 [2025-03-08 19:59:28,684 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#6 [2025-03-08 19:59:28,684 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#7 [2025-03-08 19:59:28,684 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#8 [2025-03-08 19:59:28,684 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#9 [2025-03-08 19:59:28,684 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#10 [2025-03-08 19:59:28,684 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#11 [2025-03-08 19:59:28,684 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#12 [2025-03-08 19:59:28,684 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#13 [2025-03-08 19:59:28,684 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#14 [2025-03-08 19:59:28,684 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#15 [2025-03-08 19:59:28,684 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 19:59:28,684 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 19:59:28,684 INFO L130 BoogieDeclarations]: Found specification of procedure IS_ERR [2025-03-08 19:59:28,684 INFO L138 BoogieDeclarations]: Found implementation of procedure IS_ERR [2025-03-08 19:59:29,091 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 19:59:29,094 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 19:59:29,543 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2025-03-08 19:59:29,764 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4222: havoc list_empty_#t~mem24#1.base, list_empty_#t~mem24#1.offset; [2025-03-08 19:59:29,765 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5935: havoc scsi_normalize_sense_#t~nondet371#1; [2025-03-08 19:59:29,765 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4880: call ULTIMATE.dealloc(~#list~0#1.base, ~#list~0#1.offset);havoc ~#list~0#1.base, ~#list~0#1.offset; [2025-03-08 19:59:29,765 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4816: call ULTIMATE.dealloc(mode_select_handle_sense_~#sense_hdr~0#1.base, mode_select_handle_sense_~#sense_hdr~0#1.offset);havoc mode_select_handle_sense_~#sense_hdr~0#1.base, mode_select_handle_sense_~#sense_hdr~0#1.offset; [2025-03-08 19:59:30,248 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4474: havoc scsi_device_tpgs_#t~mem105#1.base, scsi_device_tpgs_#t~mem105#1.offset;havoc scsi_device_tpgs_#t~ite108#1;havoc scsi_device_tpgs_#t~mem106#1.base, scsi_device_tpgs_#t~mem106#1.offset;havoc scsi_device_tpgs_#t~mem107#1; [2025-03-08 19:59:30,256 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5885: havoc #t~nondet364; [2025-03-08 19:59:30,312 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5888: havoc blk_get_request_#t~ret365#1.base, blk_get_request_#t~ret365#1.offset; [2025-03-08 19:59:30,312 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5895: havoc blk_rq_map_kern_#t~nondet366#1; [2025-03-08 19:59:30,315 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5923: havoc #t~nondet368; [2025-03-08 19:59:30,320 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5931: havoc #t~nondet370; [2025-03-08 19:59:30,425 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5943: havoc #t~nondet373; [2025-03-08 19:59:35,020 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5189: call ULTIMATE.dealloc(rdac_bus_attach_~#array_name~0#1.base, rdac_bus_attach_~#array_name~0#1.offset);havoc rdac_bus_attach_~#array_name~0#1.base, rdac_bus_attach_~#array_name~0#1.offset;call ULTIMATE.dealloc(rdac_bus_attach_~#array_id~0#1.base, rdac_bus_attach_~#array_id~0#1.offset);havoc rdac_bus_attach_~#array_id~0#1.base, rdac_bus_attach_~#array_id~0#1.offset; [2025-03-08 19:59:35,020 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5265: call ULTIMATE.dealloc(rdac_init_~#__key~1#1.base, rdac_init_~#__key~1#1.offset);havoc rdac_init_~#__key~1#1.base, rdac_init_~#__key~1#1.offset; [2025-03-08 19:59:35,020 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5866: havoc __alloc_workqueue_key_#t~ret363#1.base, __alloc_workqueue_key_#t~ret363#1.offset; [2025-03-08 19:59:35,020 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5472: call ULTIMATE.dealloc(main_~#ldvarg3~0#1.base, main_~#ldvarg3~0#1.offset);havoc main_~#ldvarg3~0#1.base, main_~#ldvarg3~0#1.offset; [2025-03-08 19:59:35,020 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4615: call ULTIMATE.dealloc(get_controller_~#__key~0#1.base, get_controller_~#__key~0#1.offset);havoc get_controller_~#__key~0#1.base, get_controller_~#__key~0#1.offset;call ULTIMATE.dealloc(get_controller_~#__key___0~0#1.base, get_controller_~#__key___0~0#1.offset);havoc get_controller_~#__key___0~0#1.base, get_controller_~#__key___0~0#1.offset;call ULTIMATE.dealloc(get_controller_~#__constr_expr_0~0#1.base, get_controller_~#__constr_expr_0~0#1.offset);havoc get_controller_~#__constr_expr_0~0#1.base, get_controller_~#__constr_expr_0~0#1.offset; [2025-03-08 19:59:35,020 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5939: havoc scsi_register_device_handler_#t~nondet372#1; [2025-03-08 19:59:35,243 INFO L? ?]: Removed 1138 outVars from TransFormulas that were not future-live. [2025-03-08 19:59:35,244 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 19:59:35,281 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 19:59:35,282 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 19:59:35,282 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 07:59:35 BoogieIcfgContainer [2025-03-08 19:59:35,282 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 19:59:35,283 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 19:59:35,284 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 19:59:35,289 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 19:59:35,289 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 07:59:27" (1/3) ... [2025-03-08 19:59:35,290 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@157f9b53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 07:59:35, skipping insertion in model container [2025-03-08 19:59:35,290 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:59:28" (2/3) ... [2025-03-08 19:59:35,291 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@157f9b53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 07:59:35, skipping insertion in model container [2025-03-08 19:59:35,291 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 07:59:35" (3/3) ... [2025-03-08 19:59:35,291 INFO L128 eAbstractionObserver]: Analyzing ICFG linux-4.2-rc1.tar.xz-43_2a-drivers--scsi--device_handler--scsi_dh_rdac.ko-entry_point.cil.out.i [2025-03-08 19:59:35,306 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 19:59:35,308 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG linux-4.2-rc1.tar.xz-43_2a-drivers--scsi--device_handler--scsi_dh_rdac.ko-entry_point.cil.out.i that has 72 procedures, 767 locations, 1 initial locations, 49 loop locations, and 2 error locations. [2025-03-08 19:59:35,369 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 19:59:35,378 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;@4a3e66c9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 19:59:35,378 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-08 19:59:35,385 INFO L276 IsEmpty]: Start isEmpty. Operand has 635 states, 466 states have (on average 1.388412017167382) internal successors, (647), 487 states have internal predecessors, (647), 125 states have call successors, (125), 42 states have call predecessors, (125), 41 states have return successors, (121), 120 states have call predecessors, (121), 121 states have call successors, (121) [2025-03-08 19:59:35,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-08 19:59:35,392 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:59:35,393 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 19:59:35,393 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE] === [2025-03-08 19:59:35,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:59:35,398 INFO L85 PathProgramCache]: Analyzing trace with hash -807887131, now seen corresponding path program 1 times [2025-03-08 19:59:35,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:59:35,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231315624] [2025-03-08 19:59:35,404 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:59:35,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:59:36,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-08 19:59:36,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-08 19:59:36,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:59:36,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:59:36,417 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-03-08 19:59:36,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:59:36,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231315624] [2025-03-08 19:59:36,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231315624] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 19:59:36,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [537582407] [2025-03-08 19:59:36,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:59:36,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 19:59:36,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 19:59:36,420 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-08 19:59:36,422 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-08 19:59:37,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-08 19:59:37,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-08 19:59:37,346 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:59:37,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:59:37,353 INFO L256 TraceCheckSpWp]: Trace formula consists of 1833 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 19:59:37,358 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 19:59:37,366 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-08 19:59:37,366 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 19:59:37,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [537582407] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:59:37,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 19:59:37,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 19:59:37,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123205549] [2025-03-08 19:59:37,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:59:37,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 19:59:37,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:59:37,384 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 19:59:37,385 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 19:59:37,387 INFO L87 Difference]: Start difference. First operand has 635 states, 466 states have (on average 1.388412017167382) internal successors, (647), 487 states have internal predecessors, (647), 125 states have call successors, (125), 42 states have call predecessors, (125), 41 states have return successors, (121), 120 states have call predecessors, (121), 121 states have call successors, (121) Second operand has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 19:59:37,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:59:37,466 INFO L93 Difference]: Finished difference Result 1264 states and 1822 transitions. [2025-03-08 19:59:37,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 19:59:37,468 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 74 [2025-03-08 19:59:37,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:59:37,480 INFO L225 Difference]: With dead ends: 1264 [2025-03-08 19:59:37,480 INFO L226 Difference]: Without dead ends: 615 [2025-03-08 19:59:37,486 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 19:59:37,488 INFO L435 NwaCegarLoop]: 881 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 881 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 19:59:37,488 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 881 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 19:59:37,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2025-03-08 19:59:37,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 615. [2025-03-08 19:59:37,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 615 states, 454 states have (on average 1.3722466960352422) internal successors, (623), 469 states have internal predecessors, (623), 119 states have call successors, (119), 41 states have call predecessors, (119), 40 states have return successors, (118), 117 states have call predecessors, (118), 118 states have call successors, (118) [2025-03-08 19:59:37,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 615 states and 860 transitions. [2025-03-08 19:59:37,555 INFO L78 Accepts]: Start accepts. Automaton has 615 states and 860 transitions. Word has length 74 [2025-03-08 19:59:37,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:59:37,555 INFO L471 AbstractCegarLoop]: Abstraction has 615 states and 860 transitions. [2025-03-08 19:59:37,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 19:59:37,556 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 860 transitions. [2025-03-08 19:59:37,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-08 19:59:37,558 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:59:37,559 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 19:59:37,569 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 19:59:37,763 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-08 19:59:37,763 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE] === [2025-03-08 19:59:37,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:59:37,764 INFO L85 PathProgramCache]: Analyzing trace with hash 1305153960, now seen corresponding path program 1 times [2025-03-08 19:59:37,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:59:37,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355906765] [2025-03-08 19:59:37,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:59:37,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:59:38,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-08 19:59:38,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-08 19:59:38,305 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:59:38,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:59:38,465 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2025-03-08 19:59:38,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:59:38,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355906765] [2025-03-08 19:59:38,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355906765] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:59:38,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:59:38,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 19:59:38,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160359428] [2025-03-08 19:59:38,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:59:38,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 19:59:38,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:59:38,468 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 19:59:38,468 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:59:38,468 INFO L87 Difference]: Start difference. First operand 615 states and 860 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-08 19:59:38,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:59:38,580 INFO L93 Difference]: Finished difference Result 1448 states and 2004 transitions. [2025-03-08 19:59:38,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 19:59:38,580 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 74 [2025-03-08 19:59:38,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:59:38,587 INFO L225 Difference]: With dead ends: 1448 [2025-03-08 19:59:38,588 INFO L226 Difference]: Without dead ends: 850 [2025-03-08 19:59:38,591 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:59:38,592 INFO L435 NwaCegarLoop]: 860 mSDtfsCounter, 321 mSDsluCounter, 807 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 1667 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 19:59:38,592 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [321 Valid, 1667 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 19:59:38,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 850 states. [2025-03-08 19:59:38,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 850 to 845. [2025-03-08 19:59:38,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 845 states, 626 states have (on average 1.354632587859425) internal successors, (848), 643 states have internal predecessors, (848), 156 states have call successors, (156), 62 states have call predecessors, (156), 61 states have return successors, (155), 154 states have call predecessors, (155), 155 states have call successors, (155) [2025-03-08 19:59:38,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 845 states to 845 states and 1159 transitions. [2025-03-08 19:59:38,645 INFO L78 Accepts]: Start accepts. Automaton has 845 states and 1159 transitions. Word has length 74 [2025-03-08 19:59:38,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:59:38,646 INFO L471 AbstractCegarLoop]: Abstraction has 845 states and 1159 transitions. [2025-03-08 19:59:38,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-08 19:59:38,647 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 1159 transitions. [2025-03-08 19:59:38,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-08 19:59:38,653 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:59:38,654 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2025-03-08 19:59:38,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 19:59:38,655 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE] === [2025-03-08 19:59:38,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:59:38,655 INFO L85 PathProgramCache]: Analyzing trace with hash -1057115718, now seen corresponding path program 1 times [2025-03-08 19:59:38,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:59:38,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772087362] [2025-03-08 19:59:38,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:59:38,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:59:39,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-08 19:59:39,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-08 19:59:39,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:59:39,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:59:39,371 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-08 19:59:39,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:59:39,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772087362] [2025-03-08 19:59:39,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772087362] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:59:39,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:59:39,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 19:59:39,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136814696] [2025-03-08 19:59:39,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:59:39,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 19:59:39,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:59:39,373 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 19:59:39,373 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 19:59:39,374 INFO L87 Difference]: Start difference. First operand 845 states and 1159 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 3 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-08 19:59:39,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:59:39,471 INFO L93 Difference]: Finished difference Result 1668 states and 2293 transitions. [2025-03-08 19:59:39,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 19:59:39,472 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 3 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 112 [2025-03-08 19:59:39,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:59:39,477 INFO L225 Difference]: With dead ends: 1668 [2025-03-08 19:59:39,477 INFO L226 Difference]: Without dead ends: 850 [2025-03-08 19:59:39,480 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 19:59:39,481 INFO L435 NwaCegarLoop]: 857 mSDtfsCounter, 6 mSDsluCounter, 2543 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 3400 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 19:59:39,481 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 3400 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 19:59:39,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 850 states. [2025-03-08 19:59:39,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 850 to 848. [2025-03-08 19:59:39,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 848 states, 629 states have (on average 1.3529411764705883) internal successors, (851), 646 states have internal predecessors, (851), 156 states have call successors, (156), 62 states have call predecessors, (156), 61 states have return successors, (155), 154 states have call predecessors, (155), 155 states have call successors, (155) [2025-03-08 19:59:39,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 848 states to 848 states and 1162 transitions. [2025-03-08 19:59:39,513 INFO L78 Accepts]: Start accepts. Automaton has 848 states and 1162 transitions. Word has length 112 [2025-03-08 19:59:39,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:59:39,513 INFO L471 AbstractCegarLoop]: Abstraction has 848 states and 1162 transitions. [2025-03-08 19:59:39,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 3 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-08 19:59:39,513 INFO L276 IsEmpty]: Start isEmpty. Operand 848 states and 1162 transitions. [2025-03-08 19:59:39,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-08 19:59:39,516 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:59:39,516 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2025-03-08 19:59:39,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 19:59:39,516 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE] === [2025-03-08 19:59:39,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:59:39,517 INFO L85 PathProgramCache]: Analyzing trace with hash 767794507, now seen corresponding path program 1 times [2025-03-08 19:59:39,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:59:39,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408201096] [2025-03-08 19:59:39,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:59:39,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:59:39,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-08 19:59:39,978 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-08 19:59:39,978 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:59:39,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:59:40,098 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2025-03-08 19:59:40,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:59:40,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408201096] [2025-03-08 19:59:40,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408201096] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:59:40,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:59:40,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 19:59:40,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831486029] [2025-03-08 19:59:40,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:59:40,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 19:59:40,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:59:40,102 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 19:59:40,102 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:59:40,102 INFO L87 Difference]: Start difference. First operand 848 states and 1162 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-08 19:59:40,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:59:40,144 INFO L93 Difference]: Finished difference Result 852 states and 1166 transitions. [2025-03-08 19:59:40,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 19:59:40,144 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 115 [2025-03-08 19:59:40,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:59:40,154 INFO L225 Difference]: With dead ends: 852 [2025-03-08 19:59:40,155 INFO L226 Difference]: Without dead ends: 849 [2025-03-08 19:59:40,155 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:59:40,157 INFO L435 NwaCegarLoop]: 856 mSDtfsCounter, 0 mSDsluCounter, 850 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1706 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 19:59:40,157 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1706 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 19:59:40,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 849 states. [2025-03-08 19:59:40,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 849 to 849. [2025-03-08 19:59:40,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 849 states, 630 states have (on average 1.3523809523809525) internal successors, (852), 647 states have internal predecessors, (852), 156 states have call successors, (156), 62 states have call predecessors, (156), 61 states have return successors, (155), 154 states have call predecessors, (155), 155 states have call successors, (155) [2025-03-08 19:59:40,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 849 states to 849 states and 1163 transitions. [2025-03-08 19:59:40,197 INFO L78 Accepts]: Start accepts. Automaton has 849 states and 1163 transitions. Word has length 115 [2025-03-08 19:59:40,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:59:40,197 INFO L471 AbstractCegarLoop]: Abstraction has 849 states and 1163 transitions. [2025-03-08 19:59:40,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-08 19:59:40,197 INFO L276 IsEmpty]: Start isEmpty. Operand 849 states and 1163 transitions. [2025-03-08 19:59:40,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-08 19:59:40,200 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:59:40,200 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2025-03-08 19:59:40,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 19:59:40,201 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE] === [2025-03-08 19:59:40,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:59:40,201 INFO L85 PathProgramCache]: Analyzing trace with hash -934002771, now seen corresponding path program 1 times [2025-03-08 19:59:40,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:59:40,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620760253] [2025-03-08 19:59:40,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:59:40,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:59:40,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-08 19:59:40,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-08 19:59:40,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:59:40,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:59:40,854 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2025-03-08 19:59:40,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:59:40,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620760253] [2025-03-08 19:59:40,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620760253] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:59:40,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:59:40,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 19:59:40,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660623035] [2025-03-08 19:59:40,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:59:40,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 19:59:40,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:59:40,856 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 19:59:40,856 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 19:59:40,856 INFO L87 Difference]: Start difference. First operand 849 states and 1163 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 3 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 19:59:40,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:59:40,930 INFO L93 Difference]: Finished difference Result 1768 states and 2422 transitions. [2025-03-08 19:59:40,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 19:59:40,931 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 3 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 117 [2025-03-08 19:59:40,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:59:40,938 INFO L225 Difference]: With dead ends: 1768 [2025-03-08 19:59:40,938 INFO L226 Difference]: Without dead ends: 946 [2025-03-08 19:59:40,941 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-08 19:59:40,942 INFO L435 NwaCegarLoop]: 869 mSDtfsCounter, 651 mSDsluCounter, 1145 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 651 SdHoareTripleChecker+Valid, 2014 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 19:59:40,943 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [651 Valid, 2014 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 19:59:40,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 946 states. [2025-03-08 19:59:40,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 946 to 928. [2025-03-08 19:59:40,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 928 states, 679 states have (on average 1.346097201767305) internal successors, (914), 704 states have internal predecessors, (914), 173 states have call successors, (173), 77 states have call predecessors, (173), 74 states have return successors, (177), 165 states have call predecessors, (177), 172 states have call successors, (177) [2025-03-08 19:59:40,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 928 states to 928 states and 1264 transitions. [2025-03-08 19:59:40,976 INFO L78 Accepts]: Start accepts. Automaton has 928 states and 1264 transitions. Word has length 117 [2025-03-08 19:59:40,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:59:40,978 INFO L471 AbstractCegarLoop]: Abstraction has 928 states and 1264 transitions. [2025-03-08 19:59:40,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 3 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 19:59:40,978 INFO L276 IsEmpty]: Start isEmpty. Operand 928 states and 1264 transitions. [2025-03-08 19:59:40,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2025-03-08 19:59:40,986 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:59:40,986 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 19:59:40,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 19:59:40,987 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE] === [2025-03-08 19:59:40,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:59:40,988 INFO L85 PathProgramCache]: Analyzing trace with hash -58669337, now seen corresponding path program 1 times [2025-03-08 19:59:40,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:59:40,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715766989] [2025-03-08 19:59:40,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:59:40,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:59:41,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 217 statements into 1 equivalence classes. [2025-03-08 19:59:41,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 217 of 217 statements. [2025-03-08 19:59:41,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:59:41,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:59:41,766 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 134 trivial. 0 not checked. [2025-03-08 19:59:41,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:59:41,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715766989] [2025-03-08 19:59:41,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715766989] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 19:59:41,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1037134901] [2025-03-08 19:59:41,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:59:41,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 19:59:41,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 19:59:41,768 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-08 19:59:41,770 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-08 19:59:42,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 217 statements into 1 equivalence classes. [2025-03-08 19:59:42,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 217 of 217 statements. [2025-03-08 19:59:42,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:59:42,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:59:42,937 INFO L256 TraceCheckSpWp]: Trace formula consists of 2775 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-08 19:59:42,944 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 19:59:43,019 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2025-03-08 19:59:43,019 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 19:59:43,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1037134901] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:59:43,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 19:59:43,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2025-03-08 19:59:43,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443189740] [2025-03-08 19:59:43,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:59:43,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 19:59:43,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:59:43,020 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 19:59:43,020 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-08 19:59:43,021 INFO L87 Difference]: Start difference. First operand 928 states and 1264 transitions. Second operand has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 3 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (23), 4 states have call predecessors, (23), 3 states have call successors, (23) [2025-03-08 19:59:43,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:59:43,112 INFO L93 Difference]: Finished difference Result 1835 states and 2507 transitions. [2025-03-08 19:59:43,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 19:59:43,113 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 3 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (23), 4 states have call predecessors, (23), 3 states have call successors, (23) Word has length 217 [2025-03-08 19:59:43,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:59:43,120 INFO L225 Difference]: With dead ends: 1835 [2025-03-08 19:59:43,120 INFO L226 Difference]: Without dead ends: 934 [2025-03-08 19:59:43,124 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 214 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-08 19:59:43,125 INFO L435 NwaCegarLoop]: 853 mSDtfsCounter, 3 mSDsluCounter, 3396 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 4249 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 19:59:43,125 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 4249 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 19:59:43,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 934 states. [2025-03-08 19:59:43,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 934 to 933. [2025-03-08 19:59:43,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 933 states, 683 states have (on average 1.3440702781844802) internal successors, (918), 707 states have internal predecessors, (918), 173 states have call successors, (173), 77 states have call predecessors, (173), 75 states have return successors, (181), 166 states have call predecessors, (181), 172 states have call successors, (181) [2025-03-08 19:59:43,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 933 states to 933 states and 1272 transitions. [2025-03-08 19:59:43,163 INFO L78 Accepts]: Start accepts. Automaton has 933 states and 1272 transitions. Word has length 217 [2025-03-08 19:59:43,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:59:43,164 INFO L471 AbstractCegarLoop]: Abstraction has 933 states and 1272 transitions. [2025-03-08 19:59:43,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 3 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (23), 4 states have call predecessors, (23), 3 states have call successors, (23) [2025-03-08 19:59:43,164 INFO L276 IsEmpty]: Start isEmpty. Operand 933 states and 1272 transitions. [2025-03-08 19:59:43,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2025-03-08 19:59:43,169 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:59:43,169 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 19:59:43,181 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-08 19:59:43,374 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-08 19:59:43,374 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE] === [2025-03-08 19:59:43,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:59:43,375 INFO L85 PathProgramCache]: Analyzing trace with hash -1831802133, now seen corresponding path program 1 times [2025-03-08 19:59:43,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:59:43,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571049257] [2025-03-08 19:59:43,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:59:43,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:59:43,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 217 statements into 1 equivalence classes. [2025-03-08 19:59:43,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 217 of 217 statements. [2025-03-08 19:59:43,849 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:59:43,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:59:44,182 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 134 trivial. 0 not checked. [2025-03-08 19:59:44,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:59:44,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571049257] [2025-03-08 19:59:44,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571049257] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 19:59:44,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1786650324] [2025-03-08 19:59:44,182 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:59:44,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 19:59:44,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 19:59:44,185 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-08 19:59:44,187 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-08 19:59:45,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 217 statements into 1 equivalence classes. [2025-03-08 19:59:45,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 217 of 217 statements. [2025-03-08 19:59:45,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:59:45,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:59:45,231 INFO L256 TraceCheckSpWp]: Trace formula consists of 2767 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-08 19:59:45,236 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 19:59:45,328 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2025-03-08 19:59:45,328 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 19:59:45,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1786650324] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:59:45,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 19:59:45,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 14 [2025-03-08 19:59:45,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029179643] [2025-03-08 19:59:45,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:59:45,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 19:59:45,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:59:45,329 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 19:59:45,329 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2025-03-08 19:59:45,329 INFO L87 Difference]: Start difference. First operand 933 states and 1272 transitions. Second operand has 8 states, 8 states have (on average 15.25) internal successors, (122), 7 states have internal predecessors, (122), 3 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (23), 4 states have call predecessors, (23), 3 states have call successors, (23) [2025-03-08 19:59:45,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:59:45,448 INFO L93 Difference]: Finished difference Result 1842 states and 2517 transitions. [2025-03-08 19:59:45,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 19:59:45,450 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 15.25) internal successors, (122), 7 states have internal predecessors, (122), 3 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (23), 4 states have call predecessors, (23), 3 states have call successors, (23) Word has length 217 [2025-03-08 19:59:45,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:59:45,457 INFO L225 Difference]: With dead ends: 1842 [2025-03-08 19:59:45,457 INFO L226 Difference]: Without dead ends: 936 [2025-03-08 19:59:45,460 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2025-03-08 19:59:45,461 INFO L435 NwaCegarLoop]: 851 mSDtfsCounter, 2 mSDsluCounter, 5077 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 5928 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 19:59:45,462 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 5928 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 19:59:45,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 936 states. [2025-03-08 19:59:45,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 936 to 936. [2025-03-08 19:59:45,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 936 states, 686 states have (on average 1.3425655976676385) internal successors, (921), 710 states have internal predecessors, (921), 173 states have call successors, (173), 77 states have call predecessors, (173), 75 states have return successors, (181), 166 states have call predecessors, (181), 172 states have call successors, (181) [2025-03-08 19:59:45,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 936 states to 936 states and 1275 transitions. [2025-03-08 19:59:45,489 INFO L78 Accepts]: Start accepts. Automaton has 936 states and 1275 transitions. Word has length 217 [2025-03-08 19:59:45,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:59:45,490 INFO L471 AbstractCegarLoop]: Abstraction has 936 states and 1275 transitions. [2025-03-08 19:59:45,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.25) internal successors, (122), 7 states have internal predecessors, (122), 3 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (23), 4 states have call predecessors, (23), 3 states have call successors, (23) [2025-03-08 19:59:45,490 INFO L276 IsEmpty]: Start isEmpty. Operand 936 states and 1275 transitions. [2025-03-08 19:59:45,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2025-03-08 19:59:45,494 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:59:45,495 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 19:59:45,506 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-08 19:59:45,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 19:59:45,696 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE] === [2025-03-08 19:59:45,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:59:45,696 INFO L85 PathProgramCache]: Analyzing trace with hash 705497608, now seen corresponding path program 1 times [2025-03-08 19:59:45,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:59:45,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912214248] [2025-03-08 19:59:45,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:59:45,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:59:46,095 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 233 statements into 1 equivalence classes. [2025-03-08 19:59:46,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 233 of 233 statements. [2025-03-08 19:59:46,129 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:59:46,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:59:46,495 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2025-03-08 19:59:46,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:59:46,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912214248] [2025-03-08 19:59:46,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912214248] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 19:59:46,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1391810022] [2025-03-08 19:59:46,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:59:46,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 19:59:46,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 19:59:46,499 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-08 19:59:46,501 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-08 19:59:47,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 233 statements into 1 equivalence classes. [2025-03-08 19:59:47,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 233 of 233 statements. [2025-03-08 19:59:47,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:59:47,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:59:47,623 INFO L256 TraceCheckSpWp]: Trace formula consists of 2925 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-08 19:59:47,628 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 19:59:47,714 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2025-03-08 19:59:47,714 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 19:59:47,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1391810022] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:59:47,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 19:59:47,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 14 [2025-03-08 19:59:47,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028806826] [2025-03-08 19:59:47,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:59:47,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 19:59:47,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:59:47,715 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 19:59:47,718 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2025-03-08 19:59:47,718 INFO L87 Difference]: Start difference. First operand 936 states and 1275 transitions. Second operand has 8 states, 8 states have (on average 16.5) internal successors, (132), 7 states have internal predecessors, (132), 3 states have call successors, (28), 2 states have call predecessors, (28), 3 states have return successors, (26), 4 states have call predecessors, (26), 3 states have call successors, (26) [2025-03-08 19:59:47,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:59:47,845 INFO L93 Difference]: Finished difference Result 1854 states and 2534 transitions. [2025-03-08 19:59:47,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 19:59:47,845 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 16.5) internal successors, (132), 7 states have internal predecessors, (132), 3 states have call successors, (28), 2 states have call predecessors, (28), 3 states have return successors, (26), 4 states have call predecessors, (26), 3 states have call successors, (26) Word has length 233 [2025-03-08 19:59:47,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:59:47,853 INFO L225 Difference]: With dead ends: 1854 [2025-03-08 19:59:47,853 INFO L226 Difference]: Without dead ends: 945 [2025-03-08 19:59:47,857 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2025-03-08 19:59:47,858 INFO L435 NwaCegarLoop]: 852 mSDtfsCounter, 4 mSDsluCounter, 5082 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 5934 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 19:59:47,858 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 5934 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 19:59:47,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 945 states. [2025-03-08 19:59:47,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 945 to 937. [2025-03-08 19:59:47,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 937 states, 686 states have (on average 1.3425655976676385) internal successors, (921), 711 states have internal predecessors, (921), 174 states have call successors, (174), 77 states have call predecessors, (174), 75 states have return successors, (182), 167 states have call predecessors, (182), 173 states have call successors, (182) [2025-03-08 19:59:47,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 937 states to 937 states and 1277 transitions. [2025-03-08 19:59:47,896 INFO L78 Accepts]: Start accepts. Automaton has 937 states and 1277 transitions. Word has length 233 [2025-03-08 19:59:47,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:59:47,897 INFO L471 AbstractCegarLoop]: Abstraction has 937 states and 1277 transitions. [2025-03-08 19:59:47,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 16.5) internal successors, (132), 7 states have internal predecessors, (132), 3 states have call successors, (28), 2 states have call predecessors, (28), 3 states have return successors, (26), 4 states have call predecessors, (26), 3 states have call successors, (26) [2025-03-08 19:59:47,897 INFO L276 IsEmpty]: Start isEmpty. Operand 937 states and 1277 transitions. [2025-03-08 19:59:47,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2025-03-08 19:59:47,903 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:59:47,903 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 19:59:47,917 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-08 19:59:48,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 19:59:48,104 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE] === [2025-03-08 19:59:48,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:59:48,105 INFO L85 PathProgramCache]: Analyzing trace with hash 97420745, now seen corresponding path program 1 times [2025-03-08 19:59:48,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:59:48,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825547384] [2025-03-08 19:59:48,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:59:48,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:59:48,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 233 statements into 1 equivalence classes. [2025-03-08 19:59:48,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 233 of 233 statements. [2025-03-08 19:59:48,549 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:59:48,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:59:48,816 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 134 trivial. 0 not checked. [2025-03-08 19:59:48,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:59:48,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825547384] [2025-03-08 19:59:48,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825547384] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:59:48,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:59:48,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 19:59:48,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394925356] [2025-03-08 19:59:48,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:59:48,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 19:59:48,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:59:48,817 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 19:59:48,818 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 19:59:48,818 INFO L87 Difference]: Start difference. First operand 937 states and 1277 transitions. Second operand has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 5 states have internal predecessors, (115), 3 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (22), 4 states have call predecessors, (22), 3 states have call successors, (22) [2025-03-08 19:59:48,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:59:48,890 INFO L93 Difference]: Finished difference Result 1854 states and 2535 transitions. [2025-03-08 19:59:48,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 19:59:48,890 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 5 states have internal predecessors, (115), 3 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (22), 4 states have call predecessors, (22), 3 states have call successors, (22) Word has length 233 [2025-03-08 19:59:48,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:59:48,896 INFO L225 Difference]: With dead ends: 1854 [2025-03-08 19:59:48,897 INFO L226 Difference]: Without dead ends: 944 [2025-03-08 19:59:48,900 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 19:59:48,901 INFO L435 NwaCegarLoop]: 854 mSDtfsCounter, 3 mSDsluCounter, 3398 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 4252 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 19:59:48,901 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 4252 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 19:59:48,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 944 states. [2025-03-08 19:59:48,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 944 to 942. [2025-03-08 19:59:48,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 942 states, 690 states have (on average 1.3405797101449275) internal successors, (925), 714 states have internal predecessors, (925), 174 states have call successors, (174), 77 states have call predecessors, (174), 76 states have return successors, (186), 168 states have call predecessors, (186), 173 states have call successors, (186) [2025-03-08 19:59:48,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 942 states to 942 states and 1285 transitions. [2025-03-08 19:59:48,934 INFO L78 Accepts]: Start accepts. Automaton has 942 states and 1285 transitions. Word has length 233 [2025-03-08 19:59:48,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:59:48,936 INFO L471 AbstractCegarLoop]: Abstraction has 942 states and 1285 transitions. [2025-03-08 19:59:48,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 5 states have internal predecessors, (115), 3 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (22), 4 states have call predecessors, (22), 3 states have call successors, (22) [2025-03-08 19:59:48,937 INFO L276 IsEmpty]: Start isEmpty. Operand 942 states and 1285 transitions. [2025-03-08 19:59:48,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2025-03-08 19:59:48,943 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:59:48,943 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 19:59:48,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 19:59:48,943 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE] === [2025-03-08 19:59:48,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:59:48,943 INFO L85 PathProgramCache]: Analyzing trace with hash -165543604, now seen corresponding path program 1 times [2025-03-08 19:59:48,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:59:48,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165703302] [2025-03-08 19:59:48,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:59:48,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:59:49,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 249 statements into 1 equivalence classes. [2025-03-08 19:59:49,488 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 249 of 249 statements. [2025-03-08 19:59:49,488 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:59:49,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:59:49,734 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2025-03-08 19:59:49,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:59:49,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165703302] [2025-03-08 19:59:49,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165703302] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:59:49,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:59:49,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 19:59:49,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220232220] [2025-03-08 19:59:49,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:59:49,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 19:59:49,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:59:49,736 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 19:59:49,736 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 19:59:49,736 INFO L87 Difference]: Start difference. First operand 942 states and 1285 transitions. Second operand has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 5 states have internal predecessors, (113), 3 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (22), 4 states have call predecessors, (22), 3 states have call successors, (22) [2025-03-08 19:59:49,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:59:49,813 INFO L93 Difference]: Finished difference Result 1860 states and 2543 transitions. [2025-03-08 19:59:49,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 19:59:49,814 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 5 states have internal predecessors, (113), 3 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (22), 4 states have call predecessors, (22), 3 states have call successors, (22) Word has length 249 [2025-03-08 19:59:49,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:59:49,820 INFO L225 Difference]: With dead ends: 1860 [2025-03-08 19:59:49,821 INFO L226 Difference]: Without dead ends: 945 [2025-03-08 19:59:49,824 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 19:59:49,825 INFO L435 NwaCegarLoop]: 862 mSDtfsCounter, 1 mSDsluCounter, 3430 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 4292 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 19:59:49,825 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 4292 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 19:59:49,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 945 states. [2025-03-08 19:59:49,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 945 to 939. [2025-03-08 19:59:49,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 939 states, 688 states have (on average 1.3415697674418605) internal successors, (923), 712 states have internal predecessors, (923), 174 states have call successors, (174), 77 states have call predecessors, (174), 75 states have return successors, (182), 168 states have call predecessors, (182), 173 states have call successors, (182) [2025-03-08 19:59:49,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 939 states to 939 states and 1279 transitions. [2025-03-08 19:59:49,854 INFO L78 Accepts]: Start accepts. Automaton has 939 states and 1279 transitions. Word has length 249 [2025-03-08 19:59:49,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:59:49,855 INFO L471 AbstractCegarLoop]: Abstraction has 939 states and 1279 transitions. [2025-03-08 19:59:49,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 5 states have internal predecessors, (113), 3 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (22), 4 states have call predecessors, (22), 3 states have call successors, (22) [2025-03-08 19:59:49,855 INFO L276 IsEmpty]: Start isEmpty. Operand 939 states and 1279 transitions. [2025-03-08 19:59:49,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2025-03-08 19:59:49,860 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:59:49,861 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 19:59:49,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 19:59:49,861 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE] === [2025-03-08 19:59:49,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:59:49,862 INFO L85 PathProgramCache]: Analyzing trace with hash -420280149, now seen corresponding path program 1 times [2025-03-08 19:59:49,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:59:49,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742155491] [2025-03-08 19:59:49,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:59:49,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:59:50,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 249 statements into 1 equivalence classes. [2025-03-08 19:59:50,344 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 249 of 249 statements. [2025-03-08 19:59:50,344 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:59:50,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:59:51,003 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-03-08 19:59:51,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:59:51,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742155491] [2025-03-08 19:59:51,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742155491] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 19:59:51,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [99775641] [2025-03-08 19:59:51,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:59:51,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 19:59:51,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 19:59:51,005 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-08 19:59:51,007 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-08 19:59:51,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 249 statements into 1 equivalence classes. [2025-03-08 19:59:52,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 249 of 249 statements. [2025-03-08 19:59:52,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:59:52,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:59:52,180 INFO L256 TraceCheckSpWp]: Trace formula consists of 3077 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-08 19:59:52,185 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 19:59:52,221 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2025-03-08 19:59:52,221 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 19:59:52,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [99775641] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:59:52,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 19:59:52,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2025-03-08 19:59:52,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368529978] [2025-03-08 19:59:52,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:59:52,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 19:59:52,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:59:52,222 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 19:59:52,222 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 19:59:52,222 INFO L87 Difference]: Start difference. First operand 939 states and 1279 transitions. Second operand has 5 states, 5 states have (on average 28.4) internal successors, (142), 5 states have internal predecessors, (142), 2 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2025-03-08 19:59:52,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:59:52,299 INFO L93 Difference]: Finished difference Result 1854 states and 2531 transitions. [2025-03-08 19:59:52,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 19:59:52,299 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.4) internal successors, (142), 5 states have internal predecessors, (142), 2 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 249 [2025-03-08 19:59:52,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:59:52,306 INFO L225 Difference]: With dead ends: 1854 [2025-03-08 19:59:52,307 INFO L226 Difference]: Without dead ends: 942 [2025-03-08 19:59:52,310 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 247 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 19:59:52,311 INFO L435 NwaCegarLoop]: 854 mSDtfsCounter, 0 mSDsluCounter, 2543 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3397 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 19:59:52,312 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3397 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 19:59:52,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 942 states. [2025-03-08 19:59:52,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 942 to 939. [2025-03-08 19:59:52,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 939 states, 688 states have (on average 1.3415697674418605) internal successors, (923), 712 states have internal predecessors, (923), 174 states have call successors, (174), 77 states have call predecessors, (174), 75 states have return successors, (182), 168 states have call predecessors, (182), 173 states have call successors, (182) [2025-03-08 19:59:52,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 939 states to 939 states and 1279 transitions. [2025-03-08 19:59:52,348 INFO L78 Accepts]: Start accepts. Automaton has 939 states and 1279 transitions. Word has length 249 [2025-03-08 19:59:52,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:59:52,348 INFO L471 AbstractCegarLoop]: Abstraction has 939 states and 1279 transitions. [2025-03-08 19:59:52,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.4) internal successors, (142), 5 states have internal predecessors, (142), 2 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2025-03-08 19:59:52,349 INFO L276 IsEmpty]: Start isEmpty. Operand 939 states and 1279 transitions. [2025-03-08 19:59:52,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2025-03-08 19:59:52,356 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:59:52,356 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 19:59:52,371 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-08 19:59:52,557 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-08 19:59:52,558 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE] === [2025-03-08 19:59:52,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:59:52,559 INFO L85 PathProgramCache]: Analyzing trace with hash -1823941330, now seen corresponding path program 1 times [2025-03-08 19:59:52,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:59:52,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97205965] [2025-03-08 19:59:52,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:59:52,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:59:52,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 270 statements into 1 equivalence classes. [2025-03-08 19:59:53,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 270 of 270 statements. [2025-03-08 19:59:53,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:59:53,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:59:53,202 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2025-03-08 19:59:53,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:59:53,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97205965] [2025-03-08 19:59:53,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97205965] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:59:53,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:59:53,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 19:59:53,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943407735] [2025-03-08 19:59:53,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:59:53,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 19:59:53,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:59:53,204 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 19:59:53,205 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:59:53,206 INFO L87 Difference]: Start difference. First operand 939 states and 1279 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-08 19:59:53,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:59:53,247 INFO L93 Difference]: Finished difference Result 1853 states and 2530 transitions. [2025-03-08 19:59:53,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 19:59:53,247 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 270 [2025-03-08 19:59:53,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:59:53,255 INFO L225 Difference]: With dead ends: 1853 [2025-03-08 19:59:53,255 INFO L226 Difference]: Without dead ends: 941 [2025-03-08 19:59:53,260 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:59:53,261 INFO L435 NwaCegarLoop]: 855 mSDtfsCounter, 1 mSDsluCounter, 851 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1706 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 19:59:53,261 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1706 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 19:59:53,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 941 states. [2025-03-08 19:59:53,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 941 to 940. [2025-03-08 19:59:53,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 940 states, 689 states have (on average 1.3410740203193032) internal successors, (924), 713 states have internal predecessors, (924), 174 states have call successors, (174), 77 states have call predecessors, (174), 75 states have return successors, (182), 168 states have call predecessors, (182), 173 states have call successors, (182) [2025-03-08 19:59:53,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 940 states to 940 states and 1280 transitions. [2025-03-08 19:59:53,294 INFO L78 Accepts]: Start accepts. Automaton has 940 states and 1280 transitions. Word has length 270 [2025-03-08 19:59:53,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:59:53,294 INFO L471 AbstractCegarLoop]: Abstraction has 940 states and 1280 transitions. [2025-03-08 19:59:53,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-08 19:59:53,294 INFO L276 IsEmpty]: Start isEmpty. Operand 940 states and 1280 transitions. [2025-03-08 19:59:53,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2025-03-08 19:59:53,308 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:59:53,309 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 19:59:53,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 19:59:53,309 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE] === [2025-03-08 19:59:53,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:59:53,310 INFO L85 PathProgramCache]: Analyzing trace with hash -502371765, now seen corresponding path program 1 times [2025-03-08 19:59:53,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:59:53,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699684932] [2025-03-08 19:59:53,310 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:59:53,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:59:54,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 272 statements into 1 equivalence classes. [2025-03-08 19:59:54,151 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 272 of 272 statements. [2025-03-08 19:59:54,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:59:54,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:59:54,371 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2025-03-08 19:59:54,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:59:54,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699684932] [2025-03-08 19:59:54,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699684932] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 19:59:54,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [483055172] [2025-03-08 19:59:54,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:59:54,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 19:59:54,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 19:59:54,374 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-08 19:59:54,376 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-08 19:59:55,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 272 statements into 1 equivalence classes. [2025-03-08 19:59:55,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 272 of 272 statements. [2025-03-08 19:59:55,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:59:55,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:59:55,635 INFO L256 TraceCheckSpWp]: Trace formula consists of 3200 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 19:59:55,640 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 19:59:55,658 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 64 proven. 1 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2025-03-08 19:59:55,658 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 19:59:55,884 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2025-03-08 19:59:55,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [483055172] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 19:59:55,884 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 19:59:55,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-08 19:59:55,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365575366] [2025-03-08 19:59:55,885 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 19:59:55,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 19:59:55,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:59:55,886 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 19:59:55,886 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-08 19:59:55,886 INFO L87 Difference]: Start difference. First operand 940 states and 1280 transitions. Second operand has 7 states, 7 states have (on average 24.857142857142858) internal successors, (174), 7 states have internal predecessors, (174), 2 states have call successors, (37), 2 states have call predecessors, (37), 2 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2025-03-08 19:59:55,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:59:55,936 INFO L93 Difference]: Finished difference Result 1859 states and 2538 transitions. [2025-03-08 19:59:55,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 19:59:55,936 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.857142857142858) internal successors, (174), 7 states have internal predecessors, (174), 2 states have call successors, (37), 2 states have call predecessors, (37), 2 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) Word has length 272 [2025-03-08 19:59:55,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:59:55,945 INFO L225 Difference]: With dead ends: 1859 [2025-03-08 19:59:55,946 INFO L226 Difference]: Without dead ends: 946 [2025-03-08 19:59:55,949 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 546 GetRequests, 541 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-08 19:59:55,950 INFO L435 NwaCegarLoop]: 855 mSDtfsCounter, 2 mSDsluCounter, 1702 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2557 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 19:59:55,950 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2557 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 19:59:55,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 946 states. [2025-03-08 19:59:55,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 946 to 946. [2025-03-08 19:59:55,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 946 states, 695 states have (on average 1.3381294964028776) internal successors, (930), 719 states have internal predecessors, (930), 174 states have call successors, (174), 77 states have call predecessors, (174), 75 states have return successors, (182), 168 states have call predecessors, (182), 173 states have call successors, (182) [2025-03-08 19:59:55,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 946 states to 946 states and 1286 transitions. [2025-03-08 19:59:55,979 INFO L78 Accepts]: Start accepts. Automaton has 946 states and 1286 transitions. Word has length 272 [2025-03-08 19:59:55,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:59:55,980 INFO L471 AbstractCegarLoop]: Abstraction has 946 states and 1286 transitions. [2025-03-08 19:59:55,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.857142857142858) internal successors, (174), 7 states have internal predecessors, (174), 2 states have call successors, (37), 2 states have call predecessors, (37), 2 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2025-03-08 19:59:55,981 INFO L276 IsEmpty]: Start isEmpty. Operand 946 states and 1286 transitions. [2025-03-08 19:59:55,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2025-03-08 19:59:55,985 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:59:55,986 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 19:59:56,001 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-08 19:59:56,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 19:59:56,187 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE] === [2025-03-08 19:59:56,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:59:56,187 INFO L85 PathProgramCache]: Analyzing trace with hash -231645662, now seen corresponding path program 2 times [2025-03-08 19:59:56,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:59:56,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654125572] [2025-03-08 19:59:56,188 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 19:59:56,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:59:56,775 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 278 statements into 2 equivalence classes. [2025-03-08 19:59:56,834 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 88 of 278 statements. [2025-03-08 19:59:56,835 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 19:59:56,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:59:57,011 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-03-08 19:59:57,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:59:57,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654125572] [2025-03-08 19:59:57,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654125572] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:59:57,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:59:57,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 19:59:57,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890145728] [2025-03-08 19:59:57,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:59:57,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 19:59:57,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:59:57,014 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 19:59:57,014 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 19:59:57,014 INFO L87 Difference]: Start difference. First operand 946 states and 1286 transitions. Second operand has 4 states, 4 states have (on average 31.5) internal successors, (126), 3 states have internal predecessors, (126), 2 states have call successors, (25), 3 states have call predecessors, (25), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-08 19:59:57,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:59:57,058 INFO L93 Difference]: Finished difference Result 1866 states and 2543 transitions. [2025-03-08 19:59:57,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 19:59:57,059 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.5) internal successors, (126), 3 states have internal predecessors, (126), 2 states have call successors, (25), 3 states have call predecessors, (25), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 278 [2025-03-08 19:59:57,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:59:57,066 INFO L225 Difference]: With dead ends: 1866 [2025-03-08 19:59:57,066 INFO L226 Difference]: Without dead ends: 947 [2025-03-08 19:59:57,069 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 19:59:57,069 INFO L435 NwaCegarLoop]: 859 mSDtfsCounter, 18 mSDsluCounter, 1700 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 2559 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 19:59:57,070 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 2559 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 19:59:57,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 947 states. [2025-03-08 19:59:57,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 947 to 946. [2025-03-08 19:59:57,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 946 states, 695 states have (on average 1.3352517985611512) internal successors, (928), 719 states have internal predecessors, (928), 174 states have call successors, (174), 77 states have call predecessors, (174), 75 states have return successors, (182), 168 states have call predecessors, (182), 173 states have call successors, (182) [2025-03-08 19:59:57,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 946 states to 946 states and 1284 transitions. [2025-03-08 19:59:57,097 INFO L78 Accepts]: Start accepts. Automaton has 946 states and 1284 transitions. Word has length 278 [2025-03-08 19:59:57,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:59:57,098 INFO L471 AbstractCegarLoop]: Abstraction has 946 states and 1284 transitions. [2025-03-08 19:59:57,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.5) internal successors, (126), 3 states have internal predecessors, (126), 2 states have call successors, (25), 3 states have call predecessors, (25), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-08 19:59:57,098 INFO L276 IsEmpty]: Start isEmpty. Operand 946 states and 1284 transitions. [2025-03-08 19:59:57,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2025-03-08 19:59:57,103 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:59:57,103 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 19:59:57,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 19:59:57,103 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE] === [2025-03-08 19:59:57,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:59:57,104 INFO L85 PathProgramCache]: Analyzing trace with hash 1897892761, now seen corresponding path program 1 times [2025-03-08 19:59:57,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:59:57,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959398739] [2025-03-08 19:59:57,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:59:57,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:59:57,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 280 statements into 1 equivalence classes. [2025-03-08 19:59:57,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 280 of 280 statements. [2025-03-08 19:59:57,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:59:57,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:59:57,869 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 3 proven. 16 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2025-03-08 19:59:57,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:59:57,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959398739] [2025-03-08 19:59:57,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959398739] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 19:59:57,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [644060318] [2025-03-08 19:59:57,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:59:57,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 19:59:57,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 19:59:57,872 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-08 19:59:57,873 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-08 19:59:58,886 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 280 statements into 1 equivalence classes. [2025-03-08 19:59:59,127 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 280 of 280 statements. [2025-03-08 19:59:59,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:59:59,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:59:59,141 INFO L256 TraceCheckSpWp]: Trace formula consists of 3251 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 19:59:59,147 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 19:59:59,172 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 64 proven. 16 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2025-03-08 19:59:59,172 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 19:59:59,411 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 3 proven. 16 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2025-03-08 19:59:59,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [644060318] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 19:59:59,412 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 19:59:59,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-03-08 19:59:59,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723201374] [2025-03-08 19:59:59,412 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 19:59:59,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 19:59:59,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:59:59,413 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 19:59:59,413 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-08 19:59:59,413 INFO L87 Difference]: Start difference. First operand 946 states and 1284 transitions. Second operand has 13 states, 13 states have (on average 14.461538461538462) internal successors, (188), 13 states have internal predecessors, (188), 2 states have call successors, (37), 2 states have call predecessors, (37), 2 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2025-03-08 19:59:59,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:59:59,504 INFO L93 Difference]: Finished difference Result 1877 states and 2555 transitions. [2025-03-08 19:59:59,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 19:59:59,505 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 14.461538461538462) internal successors, (188), 13 states have internal predecessors, (188), 2 states have call successors, (37), 2 states have call predecessors, (37), 2 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) Word has length 280 [2025-03-08 19:59:59,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:59:59,511 INFO L225 Difference]: With dead ends: 1877 [2025-03-08 19:59:59,511 INFO L226 Difference]: Without dead ends: 958 [2025-03-08 19:59:59,515 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 565 GetRequests, 554 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-08 19:59:59,515 INFO L435 NwaCegarLoop]: 853 mSDtfsCounter, 2 mSDsluCounter, 4245 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 5098 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 19:59:59,515 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 5098 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 19:59:59,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 958 states. [2025-03-08 19:59:59,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 958 to 958. [2025-03-08 19:59:59,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 958 states, 707 states have (on average 1.3295615275813295) internal successors, (940), 731 states have internal predecessors, (940), 174 states have call successors, (174), 77 states have call predecessors, (174), 75 states have return successors, (182), 168 states have call predecessors, (182), 173 states have call successors, (182) [2025-03-08 19:59:59,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 958 states to 958 states and 1296 transitions. [2025-03-08 19:59:59,542 INFO L78 Accepts]: Start accepts. Automaton has 958 states and 1296 transitions. Word has length 280 [2025-03-08 19:59:59,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:59:59,542 INFO L471 AbstractCegarLoop]: Abstraction has 958 states and 1296 transitions. [2025-03-08 19:59:59,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 14.461538461538462) internal successors, (188), 13 states have internal predecessors, (188), 2 states have call successors, (37), 2 states have call predecessors, (37), 2 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2025-03-08 19:59:59,542 INFO L276 IsEmpty]: Start isEmpty. Operand 958 states and 1296 transitions. [2025-03-08 19:59:59,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2025-03-08 19:59:59,548 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:59:59,548 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 19:59:59,562 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-08 19:59:59,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 19:59:59,748 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE] === [2025-03-08 19:59:59,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:59:59,749 INFO L85 PathProgramCache]: Analyzing trace with hash -1545820153, now seen corresponding path program 2 times [2025-03-08 19:59:59,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:59:59,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162576480] [2025-03-08 19:59:59,749 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 19:59:59,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 20:00:00,297 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 292 statements into 2 equivalence classes. [2025-03-08 20:00:00,317 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 90 of 292 statements. [2025-03-08 20:00:00,318 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 20:00:00,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 20:00:00,633 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 251 trivial. 0 not checked. [2025-03-08 20:00:00,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 20:00:00,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162576480] [2025-03-08 20:00:00,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162576480] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 20:00:00,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 20:00:00,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 20:00:00,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714510970] [2025-03-08 20:00:00,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 20:00:00,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 20:00:00,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 20:00:00,635 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 20:00:00,636 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 20:00:00,636 INFO L87 Difference]: Start difference. First operand 958 states and 1296 transitions. Second operand has 5 states, 5 states have (on average 27.4) internal successors, (137), 4 states have internal predecessors, (137), 2 states have call successors, (28), 2 states have call predecessors, (28), 3 states have return successors, (27), 3 states have call predecessors, (27), 2 states have call successors, (27) [2025-03-08 20:00:00,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 20:00:00,775 INFO L93 Difference]: Finished difference Result 1895 states and 2579 transitions. [2025-03-08 20:00:00,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 20:00:00,776 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.4) internal successors, (137), 4 states have internal predecessors, (137), 2 states have call successors, (28), 2 states have call predecessors, (28), 3 states have return successors, (27), 3 states have call predecessors, (27), 2 states have call successors, (27) Word has length 292 [2025-03-08 20:00:00,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 20:00:00,782 INFO L225 Difference]: With dead ends: 1895 [2025-03-08 20:00:00,782 INFO L226 Difference]: Without dead ends: 964 [2025-03-08 20:00:00,785 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 20:00:00,786 INFO L435 NwaCegarLoop]: 856 mSDtfsCounter, 0 mSDsluCounter, 2558 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3414 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 20:00:00,786 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3414 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 20:00:00,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 964 states. [2025-03-08 20:00:00,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 964 to 962. [2025-03-08 20:00:00,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 962 states, 710 states have (on average 1.328169014084507) internal successors, (943), 734 states have internal predecessors, (943), 174 states have call successors, (174), 77 states have call predecessors, (174), 76 states have return successors, (184), 169 states have call predecessors, (184), 173 states have call successors, (184) [2025-03-08 20:00:00,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 962 states to 962 states and 1301 transitions. [2025-03-08 20:00:00,812 INFO L78 Accepts]: Start accepts. Automaton has 962 states and 1301 transitions. Word has length 292 [2025-03-08 20:00:00,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 20:00:00,812 INFO L471 AbstractCegarLoop]: Abstraction has 962 states and 1301 transitions. [2025-03-08 20:00:00,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.4) internal successors, (137), 4 states have internal predecessors, (137), 2 states have call successors, (28), 2 states have call predecessors, (28), 3 states have return successors, (27), 3 states have call predecessors, (27), 2 states have call successors, (27) [2025-03-08 20:00:00,813 INFO L276 IsEmpty]: Start isEmpty. Operand 962 states and 1301 transitions. [2025-03-08 20:00:00,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2025-03-08 20:00:00,818 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 20:00:00,818 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 20:00:00,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 20:00:00,819 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE] === [2025-03-08 20:00:00,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 20:00:00,819 INFO L85 PathProgramCache]: Analyzing trace with hash -1219668121, now seen corresponding path program 1 times [2025-03-08 20:00:00,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 20:00:00,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419562951] [2025-03-08 20:00:00,820 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 20:00:00,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 20:00:01,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 292 statements into 1 equivalence classes. [2025-03-08 20:00:01,294 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 292 of 292 statements. [2025-03-08 20:00:01,294 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 20:00:01,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 20:00:01,871 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 3 proven. 100 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2025-03-08 20:00:01,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 20:00:01,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419562951] [2025-03-08 20:00:01,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419562951] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 20:00:01,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [917530937] [2025-03-08 20:00:01,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 20:00:01,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 20:00:01,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 20:00:01,875 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-08 20:00:01,877 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-08 20:00:02,953 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 292 statements into 1 equivalence classes. [2025-03-08 20:00:03,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 292 of 292 statements. [2025-03-08 20:00:03,216 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 20:00:03,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 20:00:03,234 INFO L256 TraceCheckSpWp]: Trace formula consists of 3379 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-08 20:00:03,244 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 20:00:03,301 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 64 proven. 100 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2025-03-08 20:00:03,301 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 20:00:03,672 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 3 proven. 100 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2025-03-08 20:00:03,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [917530937] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 20:00:03,673 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 20:00:03,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2025-03-08 20:00:03,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817423052] [2025-03-08 20:00:03,673 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 20:00:03,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-08 20:00:03,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 20:00:03,674 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-08 20:00:03,674 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2025-03-08 20:00:03,675 INFO L87 Difference]: Start difference. First operand 962 states and 1301 transitions. Second operand has 25 states, 25 states have (on average 8.64) internal successors, (216), 25 states have internal predecessors, (216), 2 states have call successors, (35), 2 states have call predecessors, (35), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2025-03-08 20:00:03,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 20:00:03,817 INFO L93 Difference]: Finished difference Result 1921 states and 2607 transitions. [2025-03-08 20:00:03,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-08 20:00:03,818 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 8.64) internal successors, (216), 25 states have internal predecessors, (216), 2 states have call successors, (35), 2 states have call predecessors, (35), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) Word has length 292 [2025-03-08 20:00:03,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 20:00:03,824 INFO L225 Difference]: With dead ends: 1921 [2025-03-08 20:00:03,824 INFO L226 Difference]: Without dead ends: 986 [2025-03-08 20:00:03,827 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 595 GetRequests, 572 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2025-03-08 20:00:03,828 INFO L435 NwaCegarLoop]: 853 mSDtfsCounter, 2 mSDsluCounter, 6792 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 7645 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 20:00:03,828 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 7645 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 20:00:03,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 986 states. [2025-03-08 20:00:03,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 986 to 986. [2025-03-08 20:00:03,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 986 states, 734 states have (on average 1.3174386920980927) internal successors, (967), 758 states have internal predecessors, (967), 174 states have call successors, (174), 77 states have call predecessors, (174), 76 states have return successors, (184), 169 states have call predecessors, (184), 173 states have call successors, (184) [2025-03-08 20:00:03,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 986 states to 986 states and 1325 transitions. [2025-03-08 20:00:03,853 INFO L78 Accepts]: Start accepts. Automaton has 986 states and 1325 transitions. Word has length 292 [2025-03-08 20:00:03,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 20:00:03,853 INFO L471 AbstractCegarLoop]: Abstraction has 986 states and 1325 transitions. [2025-03-08 20:00:03,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 8.64) internal successors, (216), 25 states have internal predecessors, (216), 2 states have call successors, (35), 2 states have call predecessors, (35), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2025-03-08 20:00:03,853 INFO L276 IsEmpty]: Start isEmpty. Operand 986 states and 1325 transitions. [2025-03-08 20:00:03,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2025-03-08 20:00:03,858 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 20:00:03,858 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 20:00:03,874 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-08 20:00:04,058 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,SelfDestructingSolverStorable16 [2025-03-08 20:00:04,059 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE] === [2025-03-08 20:00:04,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 20:00:04,059 INFO L85 PathProgramCache]: Analyzing trace with hash -1841864381, now seen corresponding path program 2 times [2025-03-08 20:00:04,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 20:00:04,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789389930] [2025-03-08 20:00:04,060 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 20:00:04,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 20:00:04,502 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 316 statements into 2 equivalence classes. [2025-03-08 20:00:04,541 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 90 of 316 statements. [2025-03-08 20:00:04,541 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 20:00:04,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 20:00:05,178 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 619 trivial. 0 not checked. [2025-03-08 20:00:05,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 20:00:05,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789389930] [2025-03-08 20:00:05,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789389930] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 20:00:05,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 20:00:05,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 20:00:05,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738293175] [2025-03-08 20:00:05,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 20:00:05,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 20:00:05,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 20:00:05,180 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 20:00:05,180 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 20:00:05,180 INFO L87 Difference]: Start difference. First operand 986 states and 1325 transitions. Second operand has 9 states, 9 states have (on average 16.555555555555557) internal successors, (149), 7 states have internal predecessors, (149), 3 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (28), 5 states have call predecessors, (28), 3 states have call successors, (28) [2025-03-08 20:00:05,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 20:00:05,438 INFO L93 Difference]: Finished difference Result 1999 states and 2705 transitions. [2025-03-08 20:00:05,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 20:00:05,438 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 16.555555555555557) internal successors, (149), 7 states have internal predecessors, (149), 3 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (28), 5 states have call predecessors, (28), 3 states have call successors, (28) Word has length 316 [2025-03-08 20:00:05,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 20:00:05,444 INFO L225 Difference]: With dead ends: 1999 [2025-03-08 20:00:05,444 INFO L226 Difference]: Without dead ends: 1040 [2025-03-08 20:00:05,447 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-08 20:00:05,447 INFO L435 NwaCegarLoop]: 848 mSDtfsCounter, 11 mSDsluCounter, 5925 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 6773 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 20:00:05,447 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 6773 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 20:00:05,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1040 states. [2025-03-08 20:00:05,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1040 to 1002. [2025-03-08 20:00:05,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1002 states, 748 states have (on average 1.3168449197860963) internal successors, (985), 772 states have internal predecessors, (985), 175 states have call successors, (175), 77 states have call predecessors, (175), 77 states have return successors, (188), 171 states have call predecessors, (188), 174 states have call successors, (188) [2025-03-08 20:00:05,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1002 states to 1002 states and 1348 transitions. [2025-03-08 20:00:05,480 INFO L78 Accepts]: Start accepts. Automaton has 1002 states and 1348 transitions. Word has length 316 [2025-03-08 20:00:05,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 20:00:05,481 INFO L471 AbstractCegarLoop]: Abstraction has 1002 states and 1348 transitions. [2025-03-08 20:00:05,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 16.555555555555557) internal successors, (149), 7 states have internal predecessors, (149), 3 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (28), 5 states have call predecessors, (28), 3 states have call successors, (28) [2025-03-08 20:00:05,482 INFO L276 IsEmpty]: Start isEmpty. Operand 1002 states and 1348 transitions. [2025-03-08 20:00:05,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 357 [2025-03-08 20:00:05,487 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 20:00:05,487 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 8, 8, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 20:00:05,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 20:00:05,487 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE] === [2025-03-08 20:00:05,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 20:00:05,488 INFO L85 PathProgramCache]: Analyzing trace with hash 120636323, now seen corresponding path program 1 times [2025-03-08 20:00:05,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 20:00:05,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188308727] [2025-03-08 20:00:05,488 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 20:00:05,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 20:00:05,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 356 statements into 1 equivalence classes. [2025-03-08 20:00:05,991 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 356 of 356 statements. [2025-03-08 20:00:05,991 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 20:00:05,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 20:00:07,269 INFO L134 CoverageAnalysis]: Checked inductivity of 783 backedges. 3 proven. 484 refuted. 0 times theorem prover too weak. 296 trivial. 0 not checked. [2025-03-08 20:00:07,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 20:00:07,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188308727] [2025-03-08 20:00:07,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188308727] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 20:00:07,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [537804261] [2025-03-08 20:00:07,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 20:00:07,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 20:00:07,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 20:00:07,272 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-08 20:00:07,274 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-08 20:00:08,435 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 356 statements into 1 equivalence classes. [2025-03-08 20:00:08,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 356 of 356 statements. [2025-03-08 20:00:08,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 20:00:08,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 20:00:08,792 INFO L256 TraceCheckSpWp]: Trace formula consists of 3717 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-08 20:00:08,798 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 20:00:08,879 INFO L134 CoverageAnalysis]: Checked inductivity of 783 backedges. 140 proven. 484 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2025-03-08 20:00:08,879 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 20:00:09,551 INFO L134 CoverageAnalysis]: Checked inductivity of 783 backedges. 3 proven. 484 refuted. 0 times theorem prover too weak. 296 trivial. 0 not checked. [2025-03-08 20:00:09,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [537804261] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 20:00:09,551 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 20:00:09,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 33 [2025-03-08 20:00:09,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846644649] [2025-03-08 20:00:09,552 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 20:00:09,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-03-08 20:00:09,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 20:00:09,554 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-03-08 20:00:09,554 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2025-03-08 20:00:09,554 INFO L87 Difference]: Start difference. First operand 1002 states and 1348 transitions. Second operand has 33 states, 33 states have (on average 7.2727272727272725) internal successors, (240), 33 states have internal predecessors, (240), 2 states have call successors, (41), 2 states have call predecessors, (41), 2 states have return successors, (39), 2 states have call predecessors, (39), 2 states have call successors, (39) [2025-03-08 20:00:09,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 20:00:09,735 INFO L93 Difference]: Finished difference Result 1993 states and 2689 transitions. [2025-03-08 20:00:09,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-03-08 20:00:09,735 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 7.2727272727272725) internal successors, (240), 33 states have internal predecessors, (240), 2 states have call successors, (41), 2 states have call predecessors, (41), 2 states have return successors, (39), 2 states have call predecessors, (39), 2 states have call successors, (39) Word has length 356 [2025-03-08 20:00:09,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 20:00:09,741 INFO L225 Difference]: With dead ends: 1993 [2025-03-08 20:00:09,741 INFO L226 Difference]: Without dead ends: 1018 [2025-03-08 20:00:09,744 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 735 GetRequests, 688 SyntacticMatches, 16 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 320 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2025-03-08 20:00:09,745 INFO L435 NwaCegarLoop]: 853 mSDtfsCounter, 1 mSDsluCounter, 2547 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 3400 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 20:00:09,745 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 3400 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 20:00:09,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1018 states. [2025-03-08 20:00:09,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1018 to 1018. [2025-03-08 20:00:09,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1018 states, 764 states have (on average 1.3102094240837696) internal successors, (1001), 788 states have internal predecessors, (1001), 175 states have call successors, (175), 77 states have call predecessors, (175), 77 states have return successors, (188), 171 states have call predecessors, (188), 174 states have call successors, (188) [2025-03-08 20:00:09,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1018 states to 1018 states and 1364 transitions. [2025-03-08 20:00:09,774 INFO L78 Accepts]: Start accepts. Automaton has 1018 states and 1364 transitions. Word has length 356 [2025-03-08 20:00:09,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 20:00:09,776 INFO L471 AbstractCegarLoop]: Abstraction has 1018 states and 1364 transitions. [2025-03-08 20:00:09,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 7.2727272727272725) internal successors, (240), 33 states have internal predecessors, (240), 2 states have call successors, (41), 2 states have call predecessors, (41), 2 states have return successors, (39), 2 states have call predecessors, (39), 2 states have call successors, (39) [2025-03-08 20:00:09,776 INFO L276 IsEmpty]: Start isEmpty. Operand 1018 states and 1364 transitions. [2025-03-08 20:00:09,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2025-03-08 20:00:09,781 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 20:00:09,782 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 8, 8, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 20:00:09,800 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-08 20:00:09,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 20:00:09,982 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE] === [2025-03-08 20:00:09,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 20:00:09,983 INFO L85 PathProgramCache]: Analyzing trace with hash 714225547, now seen corresponding path program 2 times [2025-03-08 20:00:09,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 20:00:09,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44167823] [2025-03-08 20:00:09,983 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 20:00:09,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 20:00:10,399 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 372 statements into 2 equivalence classes. [2025-03-08 20:00:10,495 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 80 of 372 statements. [2025-03-08 20:00:10,495 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 20:00:10,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 20:00:10,710 INFO L134 CoverageAnalysis]: Checked inductivity of 1199 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 1182 trivial. 0 not checked. [2025-03-08 20:00:10,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 20:00:10,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44167823] [2025-03-08 20:00:10,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44167823] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 20:00:10,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 20:00:10,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 20:00:10,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344429869] [2025-03-08 20:00:10,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 20:00:10,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 20:00:10,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 20:00:10,711 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 20:00:10,711 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 20:00:10,711 INFO L87 Difference]: Start difference. First operand 1018 states and 1364 transitions. Second operand has 4 states, 4 states have (on average 35.0) internal successors, (140), 4 states have internal predecessors, (140), 2 states have call successors, (29), 2 states have call predecessors, (29), 3 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-03-08 20:00:10,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 20:00:10,774 INFO L93 Difference]: Finished difference Result 2018 states and 2758 transitions. [2025-03-08 20:00:10,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 20:00:10,775 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.0) internal successors, (140), 4 states have internal predecessors, (140), 2 states have call successors, (29), 2 states have call predecessors, (29), 3 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 372 [2025-03-08 20:00:10,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 20:00:10,782 INFO L225 Difference]: With dead ends: 2018 [2025-03-08 20:00:10,782 INFO L226 Difference]: Without dead ends: 1027 [2025-03-08 20:00:10,786 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-08 20:00:10,787 INFO L435 NwaCegarLoop]: 851 mSDtfsCounter, 4 mSDsluCounter, 1694 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2545 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 20:00:10,787 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2545 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 20:00:10,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1027 states. [2025-03-08 20:00:10,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1027 to 1026. [2025-03-08 20:00:10,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1026 states, 770 states have (on average 1.3116883116883118) internal successors, (1010), 795 states have internal predecessors, (1010), 175 states have call successors, (175), 78 states have call predecessors, (175), 79 states have return successors, (192), 171 states have call predecessors, (192), 174 states have call successors, (192) [2025-03-08 20:00:10,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1026 states to 1026 states and 1377 transitions. [2025-03-08 20:00:10,813 INFO L78 Accepts]: Start accepts. Automaton has 1026 states and 1377 transitions. Word has length 372 [2025-03-08 20:00:10,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 20:00:10,814 INFO L471 AbstractCegarLoop]: Abstraction has 1026 states and 1377 transitions. [2025-03-08 20:00:10,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.0) internal successors, (140), 4 states have internal predecessors, (140), 2 states have call successors, (29), 2 states have call predecessors, (29), 3 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-03-08 20:00:10,814 INFO L276 IsEmpty]: Start isEmpty. Operand 1026 states and 1377 transitions. [2025-03-08 20:00:10,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 375 [2025-03-08 20:00:10,818 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 20:00:10,818 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 8, 8, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 20:00:10,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 20:00:10,818 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE] === [2025-03-08 20:00:10,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 20:00:10,818 INFO L85 PathProgramCache]: Analyzing trace with hash -1297962511, now seen corresponding path program 1 times [2025-03-08 20:00:10,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 20:00:10,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773499682] [2025-03-08 20:00:10,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 20:00:10,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 20:00:11,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 374 statements into 1 equivalence classes. [2025-03-08 20:00:11,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 374 of 374 statements. [2025-03-08 20:00:11,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 20:00:11,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 20:00:12,434 INFO L134 CoverageAnalysis]: Checked inductivity of 1206 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 1194 trivial. 0 not checked. [2025-03-08 20:00:12,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 20:00:12,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773499682] [2025-03-08 20:00:12,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773499682] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 20:00:12,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2065424961] [2025-03-08 20:00:12,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 20:00:12,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 20:00:12,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 20:00:12,436 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 20:00:12,438 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-08 20:00:13,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 374 statements into 1 equivalence classes. [2025-03-08 20:00:14,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 374 of 374 statements. [2025-03-08 20:00:14,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 20:00:14,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 20:00:14,035 INFO L256 TraceCheckSpWp]: Trace formula consists of 3883 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-08 20:00:14,043 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 20:00:14,127 INFO L134 CoverageAnalysis]: Checked inductivity of 1206 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 1178 trivial. 0 not checked. [2025-03-08 20:00:14,127 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 20:00:14,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2065424961] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 20:00:14,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 20:00:14,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2025-03-08 20:00:14,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118309] [2025-03-08 20:00:14,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 20:00:14,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 20:00:14,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 20:00:14,129 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 20:00:14,129 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-08 20:00:14,130 INFO L87 Difference]: Start difference. First operand 1026 states and 1377 transitions. Second operand has 6 states, 5 states have (on average 30.4) internal successors, (152), 6 states have internal predecessors, (152), 5 states have call successors, (33), 2 states have call predecessors, (33), 4 states have return successors, (31), 4 states have call predecessors, (31), 5 states have call successors, (31) [2025-03-08 20:00:14,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 20:00:14,490 INFO L93 Difference]: Finished difference Result 2073 states and 2797 transitions. [2025-03-08 20:00:14,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 20:00:14,491 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 30.4) internal successors, (152), 6 states have internal predecessors, (152), 5 states have call successors, (33), 2 states have call predecessors, (33), 4 states have return successors, (31), 4 states have call predecessors, (31), 5 states have call successors, (31) Word has length 374 [2025-03-08 20:00:14,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 20:00:14,498 INFO L225 Difference]: With dead ends: 2073 [2025-03-08 20:00:14,498 INFO L226 Difference]: Without dead ends: 1054 [2025-03-08 20:00:14,501 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 381 GetRequests, 372 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2025-03-08 20:00:14,503 INFO L435 NwaCegarLoop]: 856 mSDtfsCounter, 16 mSDsluCounter, 3383 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 4239 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 20:00:14,503 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 4239 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 20:00:14,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1054 states. [2025-03-08 20:00:14,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1054 to 1033. [2025-03-08 20:00:14,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1033 states, 776 states have (on average 1.3105670103092784) internal successors, (1017), 802 states have internal predecessors, (1017), 175 states have call successors, (175), 78 states have call predecessors, (175), 80 states have return successors, (193), 171 states have call predecessors, (193), 174 states have call successors, (193) [2025-03-08 20:00:14,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1033 states to 1033 states and 1385 transitions. [2025-03-08 20:00:14,531 INFO L78 Accepts]: Start accepts. Automaton has 1033 states and 1385 transitions. Word has length 374 [2025-03-08 20:00:14,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 20:00:14,532 INFO L471 AbstractCegarLoop]: Abstraction has 1033 states and 1385 transitions. [2025-03-08 20:00:14,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 30.4) internal successors, (152), 6 states have internal predecessors, (152), 5 states have call successors, (33), 2 states have call predecessors, (33), 4 states have return successors, (31), 4 states have call predecessors, (31), 5 states have call successors, (31) [2025-03-08 20:00:14,532 INFO L276 IsEmpty]: Start isEmpty. Operand 1033 states and 1385 transitions. [2025-03-08 20:00:14,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 379 [2025-03-08 20:00:14,537 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 20:00:14,537 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 8, 8, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 20:00:14,556 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-08 20:00:14,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-03-08 20:00:14,738 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE] === [2025-03-08 20:00:14,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 20:00:14,739 INFO L85 PathProgramCache]: Analyzing trace with hash 2076027697, now seen corresponding path program 1 times [2025-03-08 20:00:14,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 20:00:14,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55823923] [2025-03-08 20:00:14,739 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 20:00:14,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 20:00:15,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 378 statements into 1 equivalence classes. [2025-03-08 20:00:15,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 378 of 378 statements. [2025-03-08 20:00:15,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 20:00:15,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 20:00:16,139 INFO L134 CoverageAnalysis]: Checked inductivity of 1208 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 1196 trivial. 0 not checked. [2025-03-08 20:00:16,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 20:00:16,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55823923] [2025-03-08 20:00:16,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55823923] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 20:00:16,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [554429810] [2025-03-08 20:00:16,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 20:00:16,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 20:00:16,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 20:00:16,141 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 20:00:16,142 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-08 20:00:17,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 378 statements into 1 equivalence classes. [2025-03-08 20:00:18,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 378 of 378 statements. [2025-03-08 20:00:18,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 20:00:18,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 20:00:18,272 INFO L256 TraceCheckSpWp]: Trace formula consists of 3961 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-08 20:00:18,279 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 20:00:18,303 INFO L134 CoverageAnalysis]: Checked inductivity of 1208 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 1129 trivial. 0 not checked. [2025-03-08 20:00:18,304 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 20:00:18,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [554429810] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 20:00:18,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 20:00:18,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 6 [2025-03-08 20:00:18,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043467807] [2025-03-08 20:00:18,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 20:00:18,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 20:00:18,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 20:00:18,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 20:00:18,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 20:00:18,305 INFO L87 Difference]: Start difference. First operand 1033 states and 1385 transitions. Second operand has 6 states, 6 states have (on average 23.666666666666668) internal successors, (142), 5 states have internal predecessors, (142), 2 states have call successors, (27), 2 states have call predecessors, (27), 3 states have return successors, (25), 3 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-08 20:00:18,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 20:00:18,400 INFO L93 Difference]: Finished difference Result 2326 states and 3104 transitions. [2025-03-08 20:00:18,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 20:00:18,401 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 23.666666666666668) internal successors, (142), 5 states have internal predecessors, (142), 2 states have call successors, (27), 2 states have call predecessors, (27), 3 states have return successors, (25), 3 states have call predecessors, (25), 2 states have call successors, (25) Word has length 378 [2025-03-08 20:00:18,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 20:00:18,408 INFO L225 Difference]: With dead ends: 2326 [2025-03-08 20:00:18,408 INFO L226 Difference]: Without dead ends: 1320 [2025-03-08 20:00:18,411 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 386 GetRequests, 379 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-08 20:00:18,414 INFO L435 NwaCegarLoop]: 852 mSDtfsCounter, 332 mSDsluCounter, 3380 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 334 SdHoareTripleChecker+Valid, 4232 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 20:00:18,414 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [334 Valid, 4232 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 20:00:18,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1320 states. [2025-03-08 20:00:18,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1320 to 1307. [2025-03-08 20:00:18,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1307 states, 975 states have (on average 1.3025641025641026) internal successors, (1270), 1008 states have internal predecessors, (1270), 220 states have call successors, (220), 104 states have call predecessors, (220), 110 states have return successors, (245), 215 states have call predecessors, (245), 219 states have call successors, (245) [2025-03-08 20:00:18,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1307 states to 1307 states and 1735 transitions. [2025-03-08 20:00:18,447 INFO L78 Accepts]: Start accepts. Automaton has 1307 states and 1735 transitions. Word has length 378 [2025-03-08 20:00:18,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 20:00:18,448 INFO L471 AbstractCegarLoop]: Abstraction has 1307 states and 1735 transitions. [2025-03-08 20:00:18,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.666666666666668) internal successors, (142), 5 states have internal predecessors, (142), 2 states have call successors, (27), 2 states have call predecessors, (27), 3 states have return successors, (25), 3 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-08 20:00:18,448 INFO L276 IsEmpty]: Start isEmpty. Operand 1307 states and 1735 transitions. [2025-03-08 20:00:18,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 399 [2025-03-08 20:00:18,453 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 20:00:18,453 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 10, 10, 10, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 20:00:18,475 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-08 20:00:18,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-03-08 20:00:18,654 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE] === [2025-03-08 20:00:18,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 20:00:18,655 INFO L85 PathProgramCache]: Analyzing trace with hash 692529057, now seen corresponding path program 2 times [2025-03-08 20:00:18,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 20:00:18,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819079792] [2025-03-08 20:00:18,655 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 20:00:18,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 20:00:19,091 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 398 statements into 2 equivalence classes. [2025-03-08 20:00:19,269 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 398 of 398 statements. [2025-03-08 20:00:19,269 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 20:00:19,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 20:00:20,346 INFO L134 CoverageAnalysis]: Checked inductivity of 1316 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 1307 trivial. 0 not checked. [2025-03-08 20:00:20,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 20:00:20,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819079792] [2025-03-08 20:00:20,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819079792] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 20:00:20,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1377893717] [2025-03-08 20:00:20,346 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 20:00:20,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 20:00:20,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 20:00:20,348 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 20:00:20,350 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-08 20:00:21,672 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 398 statements into 2 equivalence classes.