./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 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-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-?-798a7b3-m [2025-03-04 04:47:41,732 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 04:47:41,781 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-04 04:47:41,785 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 04:47:41,785 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 04:47:41,802 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 04:47:41,803 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 04:47:41,803 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 04:47:41,803 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 04:47:41,803 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 04:47:41,803 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 04:47:41,803 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 04:47:41,804 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 04:47:41,804 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 04:47:41,804 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 04:47:41,804 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 04:47:41,804 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 04:47:41,804 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 04:47:41,804 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 04:47:41,804 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 04:47:41,805 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 04:47:41,805 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 04:47:41,805 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 04:47:41,805 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 04:47:41,805 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 04:47:41,805 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 04:47:41,805 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 04:47:41,805 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 04:47:41,805 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 04:47:41,805 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 04:47:41,806 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 04:47:41,806 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 04:47:41,806 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 04:47:41,806 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 04:47:41,806 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 04:47:41,806 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 04:47:41,806 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 04:47:41,806 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 04:47:41,806 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 04:47:41,806 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 04:47:41,806 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-04 04:47:42,045 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 04:47:42,052 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 04:47:42,055 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 04:47:42,056 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 04:47:42,056 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 04:47:42,057 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-04 04:47:43,287 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50a846bd6/718bce743f7940f3b794abebafb11802/FLAGfea96fc0a [2025-03-04 04:47:43,747 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 04:47:43,749 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-04 04:47:43,774 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50a846bd6/718bce743f7940f3b794abebafb11802/FLAGfea96fc0a [2025-03-04 04:47:43,863 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50a846bd6/718bce743f7940f3b794abebafb11802 [2025-03-04 04:47:43,865 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 04:47:43,866 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 04:47:43,867 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 04:47:43,867 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 04:47:43,870 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 04:47:43,871 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 04:47:43" (1/1) ... [2025-03-04 04:47:43,871 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4bdb535f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:47:43, skipping insertion in model container [2025-03-04 04:47:43,871 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 04:47:43" (1/1) ... [2025-03-04 04:47:43,928 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 04:47:44,806 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-04 04:47:44,851 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 04:47:44,878 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 04:47:44,954 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-04 04:47:44,956 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-04 04:47:44,957 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-04 04:47:44,957 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-04 04:47:44,957 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-04 04:47:45,065 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-04 04:47:45,074 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 04:47:45,109 WARN L1212 FunctionHandler]: The following functions are not defined or handled internally: __xadd_wrong_size [2025-03-04 04:47:45,114 INFO L204 MainTranslator]: Completed translation [2025-03-04 04:47:45,115 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:47:45 WrapperNode [2025-03-04 04:47:45,116 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 04:47:45,117 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 04:47:45,117 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 04:47:45,117 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 04:47:45,121 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:47:45" (1/1) ... [2025-03-04 04:47:45,162 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:47:45" (1/1) ... [2025-03-04 04:47:45,222 INFO L138 Inliner]: procedures = 147, calls = 882, calls flagged for inlining = 62, calls inlined = 60, statements flattened = 2112 [2025-03-04 04:47:45,223 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 04:47:45,223 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 04:47:45,224 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 04:47:45,224 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 04:47:45,231 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:47:45" (1/1) ... [2025-03-04 04:47:45,231 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:47:45" (1/1) ... [2025-03-04 04:47:45,243 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:47:45" (1/1) ... [2025-03-04 04:47:45,438 INFO L175 MemorySlicer]: Split 543 memory accesses to 16 slices as follows [2, 14, 14, 182, 2, 2, 5, 218, 3, 16, 2, 4, 3, 56, 12, 8]. 40 percent of accesses are in the largest equivalence class. The 258 initializations are split as follows [2, 14, 14, 182, 0, 0, 5, 17, 3, 16, 0, 3, 2, 0, 0, 0]. The 146 writes are split as follows [0, 0, 0, 0, 1, 1, 0, 81, 0, 0, 0, 0, 0, 51, 12, 0]. [2025-03-04 04:47:45,440 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:47:45" (1/1) ... [2025-03-04 04:47:45,440 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:47:45" (1/1) ... [2025-03-04 04:47:45,513 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:47:45" (1/1) ... [2025-03-04 04:47:45,519 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:47:45" (1/1) ... [2025-03-04 04:47:45,536 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:47:45" (1/1) ... [2025-03-04 04:47:45,550 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:47:45" (1/1) ... [2025-03-04 04:47:45,571 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 04:47:45,572 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 04:47:45,572 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 04:47:45,572 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 04:47:45,573 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:47:45" (1/1) ... [2025-03-04 04:47:45,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 04:47:45,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 04:47:45,600 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 04:47:45,603 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 04:47:45,620 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-03-04 04:47:45,620 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-03-04 04:47:45,620 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-03-04 04:47:45,620 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-03-04 04:47:45,620 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-03-04 04:47:45,620 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-03-04 04:47:45,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2025-03-04 04:47:45,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2025-03-04 04:47:45,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#8 [2025-03-04 04:47:45,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#9 [2025-03-04 04:47:45,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#10 [2025-03-04 04:47:45,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#11 [2025-03-04 04:47:45,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#12 [2025-03-04 04:47:45,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#13 [2025-03-04 04:47:45,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#14 [2025-03-04 04:47:45,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#15 [2025-03-04 04:47:45,622 INFO L130 BoogieDeclarations]: Found specification of procedure kref_sub [2025-03-04 04:47:45,622 INFO L138 BoogieDeclarations]: Found implementation of procedure kref_sub [2025-03-04 04:47:45,622 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#0 [2025-03-04 04:47:45,622 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#1 [2025-03-04 04:47:45,623 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#2 [2025-03-04 04:47:45,623 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#3 [2025-03-04 04:47:45,623 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#4 [2025-03-04 04:47:45,623 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#5 [2025-03-04 04:47:45,623 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#6 [2025-03-04 04:47:45,623 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#7 [2025-03-04 04:47:45,623 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#8 [2025-03-04 04:47:45,623 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#9 [2025-03-04 04:47:45,623 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#10 [2025-03-04 04:47:45,623 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#11 [2025-03-04 04:47:45,623 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#12 [2025-03-04 04:47:45,623 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#13 [2025-03-04 04:47:45,623 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#14 [2025-03-04 04:47:45,623 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#15 [2025-03-04 04:47:45,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-03-04 04:47:45,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-03-04 04:47:45,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-03-04 04:47:45,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-03-04 04:47:45,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-03-04 04:47:45,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2025-03-04 04:47:45,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2025-03-04 04:47:45,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#7 [2025-03-04 04:47:45,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#8 [2025-03-04 04:47:45,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#9 [2025-03-04 04:47:45,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#10 [2025-03-04 04:47:45,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#11 [2025-03-04 04:47:45,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#12 [2025-03-04 04:47:45,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#13 [2025-03-04 04:47:45,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#14 [2025-03-04 04:47:45,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#15 [2025-03-04 04:47:45,624 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2025-03-04 04:47:45,624 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2025-03-04 04:47:45,624 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 04:47:45,624 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 04:47:45,624 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 04:47:45,624 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-04 04:47:45,624 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-04 04:47:45,624 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-04 04:47:45,624 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-04 04:47:45,624 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-04 04:47:45,624 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-03-04 04:47:45,624 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-03-04 04:47:45,624 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-03-04 04:47:45,624 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-03-04 04:47:45,624 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-03-04 04:47:45,624 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-03-04 04:47:45,624 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-03-04 04:47:45,624 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2025-03-04 04:47:45,624 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2025-03-04 04:47:45,624 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2025-03-04 04:47:45,624 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#0 [2025-03-04 04:47:45,625 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#1 [2025-03-04 04:47:45,625 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#2 [2025-03-04 04:47:45,625 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#3 [2025-03-04 04:47:45,625 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#4 [2025-03-04 04:47:45,625 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#5 [2025-03-04 04:47:45,625 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#6 [2025-03-04 04:47:45,625 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#7 [2025-03-04 04:47:45,625 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#8 [2025-03-04 04:47:45,625 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#9 [2025-03-04 04:47:45,625 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#10 [2025-03-04 04:47:45,625 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#11 [2025-03-04 04:47:45,625 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#12 [2025-03-04 04:47:45,625 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#13 [2025-03-04 04:47:45,625 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#14 [2025-03-04 04:47:45,625 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#15 [2025-03-04 04:47:45,625 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#0 [2025-03-04 04:47:45,625 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#1 [2025-03-04 04:47:45,625 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#2 [2025-03-04 04:47:45,625 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#3 [2025-03-04 04:47:45,625 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#4 [2025-03-04 04:47:45,628 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#5 [2025-03-04 04:47:45,628 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#6 [2025-03-04 04:47:45,628 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#7 [2025-03-04 04:47:45,628 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#8 [2025-03-04 04:47:45,628 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#9 [2025-03-04 04:47:45,628 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#10 [2025-03-04 04:47:45,628 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#11 [2025-03-04 04:47:45,628 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#12 [2025-03-04 04:47:45,628 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#13 [2025-03-04 04:47:45,628 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#14 [2025-03-04 04:47:45,629 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#15 [2025-03-04 04:47:45,629 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2025-03-04 04:47:45,629 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2025-03-04 04:47:45,629 INFO L130 BoogieDeclarations]: Found specification of procedure get_rdac_data [2025-03-04 04:47:45,629 INFO L138 BoogieDeclarations]: Found implementation of procedure get_rdac_data [2025-03-04 04:47:45,629 INFO L130 BoogieDeclarations]: Found specification of procedure blk_put_request [2025-03-04 04:47:45,629 INFO L138 BoogieDeclarations]: Found implementation of procedure blk_put_request [2025-03-04 04:47:45,631 INFO L130 BoogieDeclarations]: Found specification of procedure activate_work_1 [2025-03-04 04:47:45,631 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_work_1 [2025-03-04 04:47:45,631 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2025-03-04 04:47:45,631 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2025-03-04 04:47:45,631 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 04:47:45,631 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 04:47:45,631 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 04:47:45,631 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-04 04:47:45,631 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-04 04:47:45,631 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-04 04:47:45,631 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-04 04:47:45,631 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-04 04:47:45,631 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-03-04 04:47:45,631 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-03-04 04:47:45,631 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-03-04 04:47:45,632 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-03-04 04:47:45,632 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-03-04 04:47:45,632 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-03-04 04:47:45,632 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-03-04 04:47:45,632 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2025-03-04 04:47:45,632 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2025-03-04 04:47:45,632 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2025-03-04 04:47:45,632 INFO L130 BoogieDeclarations]: Found specification of procedure send_mode_select [2025-03-04 04:47:45,632 INFO L138 BoogieDeclarations]: Found implementation of procedure send_mode_select [2025-03-04 04:47:45,632 INFO L130 BoogieDeclarations]: Found specification of procedure kref_put [2025-03-04 04:47:45,632 INFO L138 BoogieDeclarations]: Found implementation of procedure kref_put [2025-03-04 04:47:45,632 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2025-03-04 04:47:45,632 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2025-03-04 04:47:45,632 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-03-04 04:47:45,632 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-03-04 04:47:45,632 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-03-04 04:47:45,632 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#3 [2025-03-04 04:47:45,632 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#4 [2025-03-04 04:47:45,632 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#5 [2025-03-04 04:47:45,632 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#6 [2025-03-04 04:47:45,632 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#7 [2025-03-04 04:47:45,632 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#8 [2025-03-04 04:47:45,632 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#9 [2025-03-04 04:47:45,632 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#10 [2025-03-04 04:47:45,632 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#11 [2025-03-04 04:47:45,632 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#12 [2025-03-04 04:47:45,632 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#13 [2025-03-04 04:47:45,632 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#14 [2025-03-04 04:47:45,632 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#15 [2025-03-04 04:47:45,632 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-03-04 04:47:45,632 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-03-04 04:47:45,632 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-03-04 04:47:45,633 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#3 [2025-03-04 04:47:45,633 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#4 [2025-03-04 04:47:45,633 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#5 [2025-03-04 04:47:45,633 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#6 [2025-03-04 04:47:45,633 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#7 [2025-03-04 04:47:45,633 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#8 [2025-03-04 04:47:45,633 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#9 [2025-03-04 04:47:45,633 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#10 [2025-03-04 04:47:45,633 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#11 [2025-03-04 04:47:45,633 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#12 [2025-03-04 04:47:45,633 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#13 [2025-03-04 04:47:45,633 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#14 [2025-03-04 04:47:45,633 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#15 [2025-03-04 04:47:45,633 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_zalloc [2025-03-04 04:47:45,633 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_zalloc [2025-03-04 04:47:45,633 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 04:47:45,633 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 04:47:45,633 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 04:47:45,633 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~int~TO~VOID [2025-03-04 04:47:45,633 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~int~TO~VOID [2025-03-04 04:47:45,633 INFO L130 BoogieDeclarations]: Found specification of procedure scsi_unregister_device_handler [2025-03-04 04:47:45,633 INFO L138 BoogieDeclarations]: Found implementation of procedure scsi_unregister_device_handler [2025-03-04 04:47:45,633 INFO L130 BoogieDeclarations]: Found specification of procedure ERR_PTR [2025-03-04 04:47:45,633 INFO L138 BoogieDeclarations]: Found implementation of procedure ERR_PTR [2025-03-04 04:47:45,633 INFO L130 BoogieDeclarations]: Found specification of procedure __list_add [2025-03-04 04:47:45,633 INFO L138 BoogieDeclarations]: Found implementation of procedure __list_add [2025-03-04 04:47:45,633 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 04:47:45,633 INFO L130 BoogieDeclarations]: Found specification of procedure submit_inquiry [2025-03-04 04:47:45,633 INFO L138 BoogieDeclarations]: Found implementation of procedure submit_inquiry [2025-03-04 04:47:45,633 INFO L130 BoogieDeclarations]: Found specification of procedure rdac_bus_detach [2025-03-04 04:47:45,633 INFO L138 BoogieDeclarations]: Found implementation of procedure rdac_bus_detach [2025-03-04 04:47:45,633 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 04:47:45,633 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 04:47:45,633 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 04:47:45,633 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-04 04:47:45,633 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-04 04:47:45,633 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-03-04 04:47:45,633 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-03-04 04:47:45,633 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-03-04 04:47:45,633 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-03-04 04:47:45,634 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-03-04 04:47:45,634 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-03-04 04:47:45,634 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-03-04 04:47:45,634 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-03-04 04:47:45,636 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-03-04 04:47:45,636 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-03-04 04:47:45,636 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2025-03-04 04:47:45,637 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#15 [2025-03-04 04:47:45,637 INFO L130 BoogieDeclarations]: Found specification of procedure rdac_match [2025-03-04 04:47:45,637 INFO L138 BoogieDeclarations]: Found implementation of procedure rdac_match [2025-03-04 04:47:45,637 INFO L130 BoogieDeclarations]: Found specification of procedure INIT_LIST_HEAD [2025-03-04 04:47:45,637 INFO L138 BoogieDeclarations]: Found implementation of procedure INIT_LIST_HEAD [2025-03-04 04:47:45,637 INFO L130 BoogieDeclarations]: Found specification of procedure blk_execute_rq [2025-03-04 04:47:45,637 INFO L138 BoogieDeclarations]: Found implementation of procedure blk_execute_rq [2025-03-04 04:47:45,637 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2025-03-04 04:47:45,637 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2025-03-04 04:47:45,637 INFO L130 BoogieDeclarations]: Found specification of procedure sdev_prefix_printk [2025-03-04 04:47:45,637 INFO L138 BoogieDeclarations]: Found implementation of procedure sdev_prefix_printk [2025-03-04 04:47:45,637 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 04:47:45,637 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 04:47:45,637 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-04 04:47:45,637 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-04 04:47:45,637 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-03-04 04:47:45,637 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-03-04 04:47:45,637 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-03-04 04:47:45,637 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-03-04 04:47:45,637 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-03-04 04:47:45,637 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-03-04 04:47:45,637 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-03-04 04:47:45,637 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-03-04 04:47:45,637 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-03-04 04:47:45,637 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-03-04 04:47:45,637 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2025-03-04 04:47:45,637 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#15 [2025-03-04 04:47:45,637 INFO L130 BoogieDeclarations]: Found specification of procedure call_and_disable_work_1 [2025-03-04 04:47:45,637 INFO L138 BoogieDeclarations]: Found implementation of procedure call_and_disable_work_1 [2025-03-04 04:47:45,637 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2025-03-04 04:47:45,637 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2025-03-04 04:47:45,637 INFO L130 BoogieDeclarations]: Found specification of procedure check_ownership [2025-03-04 04:47:45,637 INFO L138 BoogieDeclarations]: Found implementation of procedure check_ownership [2025-03-04 04:47:45,637 INFO L130 BoogieDeclarations]: Found specification of procedure call_and_disable_all_1 [2025-03-04 04:47:45,637 INFO L138 BoogieDeclarations]: Found implementation of procedure call_and_disable_all_1 [2025-03-04 04:47:45,637 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 04:47:45,637 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-04 04:47:45,637 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-04 04:47:45,637 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-04 04:47:45,637 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-03-04 04:47:45,637 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-03-04 04:47:45,637 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-03-04 04:47:45,637 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-03-04 04:47:45,637 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2025-03-04 04:47:45,637 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2025-03-04 04:47:45,637 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2025-03-04 04:47:45,637 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2025-03-04 04:47:45,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2025-03-04 04:47:45,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2025-03-04 04:47:45,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2025-03-04 04:47:45,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#14 [2025-03-04 04:47:45,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#15 [2025-03-04 04:47:45,638 INFO L130 BoogieDeclarations]: Found specification of procedure get_rdac_req [2025-03-04 04:47:45,638 INFO L138 BoogieDeclarations]: Found implementation of procedure get_rdac_req [2025-03-04 04:47:45,638 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2025-03-04 04:47:45,638 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2025-03-04 04:47:45,638 INFO L130 BoogieDeclarations]: Found specification of procedure warn_slowpath_null [2025-03-04 04:47:45,638 INFO L138 BoogieDeclarations]: Found implementation of procedure warn_slowpath_null [2025-03-04 04:47:45,638 INFO L130 BoogieDeclarations]: Found specification of procedure list_del [2025-03-04 04:47:45,638 INFO L138 BoogieDeclarations]: Found implementation of procedure list_del [2025-03-04 04:47:45,638 INFO L130 BoogieDeclarations]: Found specification of procedure queue_work_on [2025-03-04 04:47:45,638 INFO L138 BoogieDeclarations]: Found implementation of procedure queue_work_on [2025-03-04 04:47:45,638 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2025-03-04 04:47:45,638 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2025-03-04 04:47:45,638 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock [2025-03-04 04:47:45,638 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock [2025-03-04 04:47:45,638 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock [2025-03-04 04:47:45,638 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock [2025-03-04 04:47:45,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 04:47:45,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 04:47:45,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 04:47:45,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-04 04:47:45,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-04 04:47:45,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-04 04:47:45,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-04 04:47:45,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-04 04:47:45,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-04 04:47:45,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-04 04:47:45,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-04 04:47:45,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-04 04:47:45,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-04 04:47:45,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-03-04 04:47:45,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-03-04 04:47:45,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-03-04 04:47:45,638 INFO L130 BoogieDeclarations]: Found specification of procedure flush_workqueue [2025-03-04 04:47:45,638 INFO L138 BoogieDeclarations]: Found implementation of procedure flush_workqueue [2025-03-04 04:47:45,638 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#0 [2025-03-04 04:47:45,638 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#1 [2025-03-04 04:47:45,638 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#2 [2025-03-04 04:47:45,638 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#3 [2025-03-04 04:47:45,638 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#4 [2025-03-04 04:47:45,638 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#5 [2025-03-04 04:47:45,638 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#6 [2025-03-04 04:47:45,638 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#7 [2025-03-04 04:47:45,639 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#8 [2025-03-04 04:47:45,639 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#9 [2025-03-04 04:47:45,639 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#10 [2025-03-04 04:47:45,639 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#11 [2025-03-04 04:47:45,639 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#12 [2025-03-04 04:47:45,639 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#13 [2025-03-04 04:47:45,639 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#14 [2025-03-04 04:47:45,639 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#15 [2025-03-04 04:47:45,639 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 04:47:45,639 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 04:47:45,639 INFO L130 BoogieDeclarations]: Found specification of procedure IS_ERR [2025-03-04 04:47:45,639 INFO L138 BoogieDeclarations]: Found implementation of procedure IS_ERR [2025-03-04 04:47:46,074 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 04:47:46,077 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 04:47:46,465 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2025-03-04 04:47:46,683 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4222: havoc list_empty_#t~mem24#1.base, list_empty_#t~mem24#1.offset; [2025-03-04 04:47:46,683 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5935: havoc scsi_normalize_sense_#t~nondet371#1; [2025-03-04 04:47:46,683 INFO L1325 $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-04 04:47:46,683 INFO L1325 $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-04 04:47:47,127 INFO L1325 $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-04 04:47:47,134 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5885: havoc #t~nondet364; [2025-03-04 04:47:47,194 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5888: havoc blk_get_request_#t~ret365#1.base, blk_get_request_#t~ret365#1.offset; [2025-03-04 04:47:47,194 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5895: havoc blk_rq_map_kern_#t~nondet366#1; [2025-03-04 04:47:47,196 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5923: havoc #t~nondet368; [2025-03-04 04:47:47,199 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5931: havoc #t~nondet370; [2025-03-04 04:47:47,299 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5943: havoc #t~nondet373; [2025-03-04 04:47:51,944 INFO L1325 $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-04 04:47:51,944 INFO L1325 $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-04 04:47:51,945 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5866: havoc __alloc_workqueue_key_#t~ret363#1.base, __alloc_workqueue_key_#t~ret363#1.offset; [2025-03-04 04:47:51,945 INFO L1325 $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-04 04:47:51,945 INFO L1325 $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-04 04:47:51,945 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5939: havoc scsi_register_device_handler_#t~nondet372#1; [2025-03-04 04:47:52,229 INFO L? ?]: Removed 1138 outVars from TransFormulas that were not future-live. [2025-03-04 04:47:52,230 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 04:47:52,256 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 04:47:52,256 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 04:47:52,256 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 04:47:52 BoogieIcfgContainer [2025-03-04 04:47:52,256 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 04:47:52,260 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 04:47:52,260 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 04:47:52,264 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 04:47:52,264 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 04:47:43" (1/3) ... [2025-03-04 04:47:52,265 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72a8ba9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 04:47:52, skipping insertion in model container [2025-03-04 04:47:52,265 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:47:45" (2/3) ... [2025-03-04 04:47:52,265 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72a8ba9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 04:47:52, skipping insertion in model container [2025-03-04 04:47:52,265 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 04:47:52" (3/3) ... [2025-03-04 04:47:52,267 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-04 04:47:52,279 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 04:47:52,282 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-04 04:47:52,350 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 04:47:52,365 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;@55e32eb2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 04:47:52,366 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-04 04:47:52,370 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-04 04:47:52,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-04 04:47:52,378 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:47:52,379 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-04 04:47:52,379 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE] === [2025-03-04 04:47:52,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:47:52,384 INFO L85 PathProgramCache]: Analyzing trace with hash -700556777, now seen corresponding path program 1 times [2025-03-04 04:47:52,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:47:52,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590022402] [2025-03-04 04:47:52,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:47:52,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:47:53,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-04 04:47:53,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-04 04:47:53,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:47:53,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:47:53,331 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-04 04:47:53,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:47:53,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590022402] [2025-03-04 04:47:53,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590022402] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 04:47:53,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [827304358] [2025-03-04 04:47:53,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:47:53,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 04:47:53,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 04:47:53,334 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 04:47:53,336 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 04:47:54,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-04 04:47:54,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-04 04:47:54,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:47:54,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:47:54,398 INFO L256 TraceCheckSpWp]: Trace formula consists of 1833 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 04:47:54,404 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 04:47:54,417 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-04 04:47:54,417 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 04:47:54,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [827304358] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:47:54,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 04:47:54,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 04:47:54,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126849941] [2025-03-04 04:47:54,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:47:54,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 04:47:54,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:47:54,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 04:47:54,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 04:47:54,442 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-04 04:47:54,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:47:54,549 INFO L93 Difference]: Finished difference Result 1264 states and 1822 transitions. [2025-03-04 04:47:54,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 04:47:54,552 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-04 04:47:54,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:47:54,568 INFO L225 Difference]: With dead ends: 1264 [2025-03-04 04:47:54,569 INFO L226 Difference]: Without dead ends: 615 [2025-03-04 04:47:54,576 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-04 04:47:54,578 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-04 04:47:54,579 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-04 04:47:54,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2025-03-04 04:47:54,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 615. [2025-03-04 04:47:54,640 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-04 04:47:54,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 615 states and 860 transitions. [2025-03-04 04:47:54,654 INFO L78 Accepts]: Start accepts. Automaton has 615 states and 860 transitions. Word has length 74 [2025-03-04 04:47:54,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:47:54,654 INFO L471 AbstractCegarLoop]: Abstraction has 615 states and 860 transitions. [2025-03-04 04:47:54,655 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-04 04:47:54,655 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 860 transitions. [2025-03-04 04:47:54,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-04 04:47:54,657 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:47:54,657 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-04 04:47:54,671 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 04:47:54,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-04 04:47:54,862 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE] === [2025-03-04 04:47:54,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:47:54,862 INFO L85 PathProgramCache]: Analyzing trace with hash 1412484314, now seen corresponding path program 1 times [2025-03-04 04:47:54,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:47:54,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930676074] [2025-03-04 04:47:54,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:47:54,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:47:55,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-04 04:47:55,367 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-04 04:47:55,368 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:47:55,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:47:55,540 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-04 04:47:55,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:47:55,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930676074] [2025-03-04 04:47:55,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930676074] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:47:55,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:47:55,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 04:47:55,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834479678] [2025-03-04 04:47:55,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:47:55,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 04:47:55,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:47:55,543 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 04:47:55,543 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 04:47:55,544 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-04 04:47:55,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:47:55,685 INFO L93 Difference]: Finished difference Result 1448 states and 2004 transitions. [2025-03-04 04:47:55,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 04:47:55,685 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-04 04:47:55,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:47:55,691 INFO L225 Difference]: With dead ends: 1448 [2025-03-04 04:47:55,691 INFO L226 Difference]: Without dead ends: 850 [2025-03-04 04:47:55,695 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 04:47:55,696 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-04 04:47:55,696 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-04 04:47:55,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 850 states. [2025-03-04 04:47:55,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 850 to 845. [2025-03-04 04:47:55,735 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-04 04:47:55,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 845 states to 845 states and 1159 transitions. [2025-03-04 04:47:55,744 INFO L78 Accepts]: Start accepts. Automaton has 845 states and 1159 transitions. Word has length 74 [2025-03-04 04:47:55,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:47:55,745 INFO L471 AbstractCegarLoop]: Abstraction has 845 states and 1159 transitions. [2025-03-04 04:47:55,745 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-04 04:47:55,745 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 1159 transitions. [2025-03-04 04:47:55,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-04 04:47:55,751 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:47:55,751 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-04 04:47:55,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 04:47:55,753 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE] === [2025-03-04 04:47:55,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:47:55,754 INFO L85 PathProgramCache]: Analyzing trace with hash -898664596, now seen corresponding path program 1 times [2025-03-04 04:47:55,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:47:55,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911415478] [2025-03-04 04:47:55,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:47:55,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:47:56,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-04 04:47:56,290 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-04 04:47:56,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:47:56,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:47:56,621 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-04 04:47:56,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:47:56,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911415478] [2025-03-04 04:47:56,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911415478] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:47:56,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:47:56,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 04:47:56,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825585047] [2025-03-04 04:47:56,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:47:56,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 04:47:56,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:47:56,623 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 04:47:56,623 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 04:47:56,623 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-04 04:47:56,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:47:56,746 INFO L93 Difference]: Finished difference Result 1668 states and 2293 transitions. [2025-03-04 04:47:56,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 04:47:56,748 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-04 04:47:56,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:47:56,755 INFO L225 Difference]: With dead ends: 1668 [2025-03-04 04:47:56,755 INFO L226 Difference]: Without dead ends: 850 [2025-03-04 04:47:56,760 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-04 04:47:56,762 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-04 04:47:56,763 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-04 04:47:56,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 850 states. [2025-03-04 04:47:56,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 850 to 848. [2025-03-04 04:47:56,806 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-04 04:47:56,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 848 states to 848 states and 1162 transitions. [2025-03-04 04:47:56,813 INFO L78 Accepts]: Start accepts. Automaton has 848 states and 1162 transitions. Word has length 112 [2025-03-04 04:47:56,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:47:56,814 INFO L471 AbstractCegarLoop]: Abstraction has 848 states and 1162 transitions. [2025-03-04 04:47:56,814 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-04 04:47:56,815 INFO L276 IsEmpty]: Start isEmpty. Operand 848 states and 1162 transitions. [2025-03-04 04:47:56,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-04 04:47:56,817 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:47:56,817 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-04 04:47:56,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 04:47:56,817 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE] === [2025-03-04 04:47:56,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:47:56,818 INFO L85 PathProgramCache]: Analyzing trace with hash 1016111705, now seen corresponding path program 1 times [2025-03-04 04:47:56,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:47:56,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781341214] [2025-03-04 04:47:56,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:47:56,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:47:57,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-04 04:47:57,335 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-04 04:47:57,335 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:47:57,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:47:57,433 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-04 04:47:57,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:47:57,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781341214] [2025-03-04 04:47:57,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781341214] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:47:57,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:47:57,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 04:47:57,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541123005] [2025-03-04 04:47:57,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:47:57,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 04:47:57,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:47:57,434 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 04:47:57,434 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 04:47:57,434 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-04 04:47:57,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:47:57,469 INFO L93 Difference]: Finished difference Result 852 states and 1166 transitions. [2025-03-04 04:47:57,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 04:47:57,469 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-04 04:47:57,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:47:57,477 INFO L225 Difference]: With dead ends: 852 [2025-03-04 04:47:57,477 INFO L226 Difference]: Without dead ends: 849 [2025-03-04 04:47:57,477 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 04:47:57,479 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-04 04:47:57,480 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-04 04:47:57,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 849 states. [2025-03-04 04:47:57,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 849 to 849. [2025-03-04 04:47:57,512 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-04 04:47:57,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 849 states to 849 states and 1163 transitions. [2025-03-04 04:47:57,517 INFO L78 Accepts]: Start accepts. Automaton has 849 states and 1163 transitions. Word has length 115 [2025-03-04 04:47:57,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:47:57,518 INFO L471 AbstractCegarLoop]: Abstraction has 849 states and 1163 transitions. [2025-03-04 04:47:57,518 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-04 04:47:57,518 INFO L276 IsEmpty]: Start isEmpty. Operand 849 states and 1163 transitions. [2025-03-04 04:47:57,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-04 04:47:57,520 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:47:57,520 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-04 04:47:57,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 04:47:57,521 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE] === [2025-03-04 04:47:57,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:47:57,521 INFO L85 PathProgramCache]: Analyzing trace with hash 1475623227, now seen corresponding path program 1 times [2025-03-04 04:47:57,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:47:57,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663038062] [2025-03-04 04:47:57,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:47:57,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:47:58,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-04 04:47:58,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-04 04:47:58,052 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:47:58,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:47:58,280 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-04 04:47:58,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:47:58,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663038062] [2025-03-04 04:47:58,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663038062] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:47:58,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:47:58,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 04:47:58,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587302535] [2025-03-04 04:47:58,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:47:58,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 04:47:58,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:47:58,282 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 04:47:58,282 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 04:47:58,282 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-04 04:47:58,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:47:58,354 INFO L93 Difference]: Finished difference Result 1768 states and 2422 transitions. [2025-03-04 04:47:58,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 04:47:58,355 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-04 04:47:58,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:47:58,362 INFO L225 Difference]: With dead ends: 1768 [2025-03-04 04:47:58,363 INFO L226 Difference]: Without dead ends: 946 [2025-03-04 04:47:58,366 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 04:47:58,367 INFO L435 NwaCegarLoop]: 867 mSDtfsCounter, 650 mSDsluCounter, 1143 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 650 SdHoareTripleChecker+Valid, 2010 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-04 04:47:58,367 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [650 Valid, 2010 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 04:47:58,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 946 states. [2025-03-04 04:47:58,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 946 to 928. [2025-03-04 04:47:58,402 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-04 04:47:58,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 928 states to 928 states and 1264 transitions. [2025-03-04 04:47:58,410 INFO L78 Accepts]: Start accepts. Automaton has 928 states and 1264 transitions. Word has length 117 [2025-03-04 04:47:58,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:47:58,411 INFO L471 AbstractCegarLoop]: Abstraction has 928 states and 1264 transitions. [2025-03-04 04:47:58,411 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-04 04:47:58,412 INFO L276 IsEmpty]: Start isEmpty. Operand 928 states and 1264 transitions. [2025-03-04 04:47:58,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2025-03-04 04:47:58,421 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:47:58,422 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-04 04:47:58,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 04:47:58,422 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE] === [2025-03-04 04:47:58,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:47:58,423 INFO L85 PathProgramCache]: Analyzing trace with hash 1364468085, now seen corresponding path program 1 times [2025-03-04 04:47:58,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:47:58,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137256857] [2025-03-04 04:47:58,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:47:58,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:47:58,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 217 statements into 1 equivalence classes. [2025-03-04 04:47:58,911 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 217 of 217 statements. [2025-03-04 04:47:58,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:47:58,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:47:59,302 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-04 04:47:59,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:47:59,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137256857] [2025-03-04 04:47:59,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137256857] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 04:47:59,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [182250717] [2025-03-04 04:47:59,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:47:59,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 04:47:59,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 04:47:59,304 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 04:47:59,306 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 04:48:00,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 217 statements into 1 equivalence classes. [2025-03-04 04:48:00,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 217 of 217 statements. [2025-03-04 04:48:00,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:48:00,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:48:00,585 INFO L256 TraceCheckSpWp]: Trace formula consists of 2775 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 04:48:00,594 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 04:48:00,661 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-04 04:48:00,661 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 04:48:00,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [182250717] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:48:00,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 04:48:00,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2025-03-04 04:48:00,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738778044] [2025-03-04 04:48:00,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:48:00,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 04:48:00,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:48:00,663 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 04:48:00,663 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-04 04:48:00,664 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-04 04:48:00,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:48:00,759 INFO L93 Difference]: Finished difference Result 1835 states and 2507 transitions. [2025-03-04 04:48:00,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 04:48:00,760 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-04 04:48:00,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:48:00,767 INFO L225 Difference]: With dead ends: 1835 [2025-03-04 04:48:00,767 INFO L226 Difference]: Without dead ends: 934 [2025-03-04 04:48:00,771 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-04 04:48:00,772 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-04 04:48:00,772 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-04 04:48:00,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 934 states. [2025-03-04 04:48:00,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 934 to 933. [2025-03-04 04:48:00,803 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-04 04:48:00,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 933 states to 933 states and 1272 transitions. [2025-03-04 04:48:00,811 INFO L78 Accepts]: Start accepts. Automaton has 933 states and 1272 transitions. Word has length 217 [2025-03-04 04:48:00,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:48:00,812 INFO L471 AbstractCegarLoop]: Abstraction has 933 states and 1272 transitions. [2025-03-04 04:48:00,812 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-04 04:48:00,812 INFO L276 IsEmpty]: Start isEmpty. Operand 933 states and 1272 transitions. [2025-03-04 04:48:00,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2025-03-04 04:48:00,818 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:48:00,818 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-04 04:48:00,830 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 04:48:01,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-04 04:48:01,021 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE] === [2025-03-04 04:48:01,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:48:01,022 INFO L85 PathProgramCache]: Analyzing trace with hash -408664711, now seen corresponding path program 1 times [2025-03-04 04:48:01,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:48:01,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829540438] [2025-03-04 04:48:01,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:48:01,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:48:01,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 217 statements into 1 equivalence classes. [2025-03-04 04:48:01,506 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 217 of 217 statements. [2025-03-04 04:48:01,506 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:48:01,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:48:01,835 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-04 04:48:01,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:48:01,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829540438] [2025-03-04 04:48:01,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829540438] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 04:48:01,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [523187550] [2025-03-04 04:48:01,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:48:01,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 04:48:01,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 04:48:01,837 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 04:48:01,839 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 04:48:02,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 217 statements into 1 equivalence classes. [2025-03-04 04:48:02,976 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 217 of 217 statements. [2025-03-04 04:48:02,976 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:48:02,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:48:02,986 INFO L256 TraceCheckSpWp]: Trace formula consists of 2767 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 04:48:02,991 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 04:48:03,079 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-04 04:48:03,080 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 04:48:03,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [523187550] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:48:03,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 04:48:03,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 14 [2025-03-04 04:48:03,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379617331] [2025-03-04 04:48:03,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:48:03,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 04:48:03,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:48:03,081 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 04:48:03,081 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2025-03-04 04:48:03,081 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-04 04:48:03,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:48:03,200 INFO L93 Difference]: Finished difference Result 1842 states and 2517 transitions. [2025-03-04 04:48:03,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 04:48:03,200 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-04 04:48:03,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:48:03,206 INFO L225 Difference]: With dead ends: 1842 [2025-03-04 04:48:03,207 INFO L226 Difference]: Without dead ends: 936 [2025-03-04 04:48:03,210 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-04 04:48:03,211 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-04 04:48:03,211 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-04 04:48:03,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 936 states. [2025-03-04 04:48:03,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 936 to 936. [2025-03-04 04:48:03,234 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-04 04:48:03,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 936 states to 936 states and 1275 transitions. [2025-03-04 04:48:03,240 INFO L78 Accepts]: Start accepts. Automaton has 936 states and 1275 transitions. Word has length 217 [2025-03-04 04:48:03,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:48:03,241 INFO L471 AbstractCegarLoop]: Abstraction has 936 states and 1275 transitions. [2025-03-04 04:48:03,241 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-04 04:48:03,241 INFO L276 IsEmpty]: Start isEmpty. Operand 936 states and 1275 transitions. [2025-03-04 04:48:03,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2025-03-04 04:48:03,246 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:48:03,246 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-04 04:48:03,258 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 04:48:03,446 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-04 04:48:03,446 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE] === [2025-03-04 04:48:03,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:48:03,447 INFO L85 PathProgramCache]: Analyzing trace with hash 296151068, now seen corresponding path program 1 times [2025-03-04 04:48:03,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:48:03,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469038443] [2025-03-04 04:48:03,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:48:03,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:48:03,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 233 statements into 1 equivalence classes. [2025-03-04 04:48:03,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 233 of 233 statements. [2025-03-04 04:48:03,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:48:03,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:48:04,427 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-04 04:48:04,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:48:04,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469038443] [2025-03-04 04:48:04,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469038443] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 04:48:04,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [700764071] [2025-03-04 04:48:04,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:48:04,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 04:48:04,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 04:48:04,430 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 04:48:04,431 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 04:48:05,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 233 statements into 1 equivalence classes. [2025-03-04 04:48:05,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 233 of 233 statements. [2025-03-04 04:48:05,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:48:05,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:48:05,614 INFO L256 TraceCheckSpWp]: Trace formula consists of 2925 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 04:48:05,619 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 04:48:05,713 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-04 04:48:05,715 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 04:48:05,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [700764071] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:48:05,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 04:48:05,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 14 [2025-03-04 04:48:05,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119790088] [2025-03-04 04:48:05,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:48:05,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 04:48:05,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:48:05,717 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 04:48:05,717 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2025-03-04 04:48:05,717 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-04 04:48:05,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:48:05,848 INFO L93 Difference]: Finished difference Result 1854 states and 2534 transitions. [2025-03-04 04:48:05,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 04:48:05,849 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-04 04:48:05,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:48:05,855 INFO L225 Difference]: With dead ends: 1854 [2025-03-04 04:48:05,855 INFO L226 Difference]: Without dead ends: 945 [2025-03-04 04:48:05,859 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-04 04:48:05,860 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-04 04:48:05,860 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-04 04:48:05,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 945 states. [2025-03-04 04:48:05,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 945 to 937. [2025-03-04 04:48:05,885 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-04 04:48:05,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 937 states to 937 states and 1277 transitions. [2025-03-04 04:48:05,891 INFO L78 Accepts]: Start accepts. Automaton has 937 states and 1277 transitions. Word has length 233 [2025-03-04 04:48:05,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:48:05,891 INFO L471 AbstractCegarLoop]: Abstraction has 937 states and 1277 transitions. [2025-03-04 04:48:05,892 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-04 04:48:05,893 INFO L276 IsEmpty]: Start isEmpty. Operand 937 states and 1277 transitions. [2025-03-04 04:48:05,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2025-03-04 04:48:05,899 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:48:05,899 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-04 04:48:05,916 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 04:48:06,100 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-04 04:48:06,100 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE] === [2025-03-04 04:48:06,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:48:06,100 INFO L85 PathProgramCache]: Analyzing trace with hash -311925795, now seen corresponding path program 1 times [2025-03-04 04:48:06,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:48:06,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825547384] [2025-03-04 04:48:06,101 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:48:06,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:48:06,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 233 statements into 1 equivalence classes. [2025-03-04 04:48:06,556 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 233 of 233 statements. [2025-03-04 04:48:06,556 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:48:06,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:48:06,873 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-04 04:48:06,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:48:06,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825547384] [2025-03-04 04:48:06,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825547384] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:48:06,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:48:06,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 04:48:06,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394925356] [2025-03-04 04:48:06,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:48:06,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 04:48:06,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:48:06,874 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 04:48:06,874 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 04:48:06,874 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-04 04:48:06,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:48:06,948 INFO L93 Difference]: Finished difference Result 1854 states and 2535 transitions. [2025-03-04 04:48:06,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 04:48:06,949 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-04 04:48:06,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:48:06,955 INFO L225 Difference]: With dead ends: 1854 [2025-03-04 04:48:06,955 INFO L226 Difference]: Without dead ends: 944 [2025-03-04 04:48:06,959 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-04 04:48:06,960 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-04 04:48:06,960 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-04 04:48:06,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 944 states. [2025-03-04 04:48:06,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 944 to 942. [2025-03-04 04:48:06,986 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-04 04:48:06,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 942 states to 942 states and 1285 transitions. [2025-03-04 04:48:06,992 INFO L78 Accepts]: Start accepts. Automaton has 942 states and 1285 transitions. Word has length 233 [2025-03-04 04:48:06,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:48:06,992 INFO L471 AbstractCegarLoop]: Abstraction has 942 states and 1285 transitions. [2025-03-04 04:48:06,992 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-04 04:48:06,994 INFO L276 IsEmpty]: Start isEmpty. Operand 942 states and 1285 transitions. [2025-03-04 04:48:07,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2025-03-04 04:48:07,001 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:48:07,001 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-04 04:48:07,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 04:48:07,001 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE] === [2025-03-04 04:48:07,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:48:07,001 INFO L85 PathProgramCache]: Analyzing trace with hash 1349847706, now seen corresponding path program 1 times [2025-03-04 04:48:07,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:48:07,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366196261] [2025-03-04 04:48:07,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:48:07,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:48:07,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 249 statements into 1 equivalence classes. [2025-03-04 04:48:07,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 249 of 249 statements. [2025-03-04 04:48:07,476 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:48:07,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:48:07,732 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-04 04:48:07,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:48:07,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366196261] [2025-03-04 04:48:07,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366196261] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:48:07,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:48:07,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 04:48:07,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103916380] [2025-03-04 04:48:07,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:48:07,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 04:48:07,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:48:07,734 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 04:48:07,734 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 04:48:07,734 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-04 04:48:07,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:48:07,816 INFO L93 Difference]: Finished difference Result 1860 states and 2543 transitions. [2025-03-04 04:48:07,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 04:48:07,817 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-04 04:48:07,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:48:07,823 INFO L225 Difference]: With dead ends: 1860 [2025-03-04 04:48:07,824 INFO L226 Difference]: Without dead ends: 945 [2025-03-04 04:48:07,826 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-04 04:48:07,827 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-04 04:48:07,827 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-04 04:48:07,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 945 states. [2025-03-04 04:48:07,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 945 to 939. [2025-03-04 04:48:07,850 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-04 04:48:07,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 939 states to 939 states and 1279 transitions. [2025-03-04 04:48:07,855 INFO L78 Accepts]: Start accepts. Automaton has 939 states and 1279 transitions. Word has length 249 [2025-03-04 04:48:07,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:48:07,856 INFO L471 AbstractCegarLoop]: Abstraction has 939 states and 1279 transitions. [2025-03-04 04:48:07,856 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-04 04:48:07,856 INFO L276 IsEmpty]: Start isEmpty. Operand 939 states and 1279 transitions. [2025-03-04 04:48:07,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2025-03-04 04:48:07,862 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:48:07,862 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-04 04:48:07,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 04:48:07,862 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE] === [2025-03-04 04:48:07,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:48:07,863 INFO L85 PathProgramCache]: Analyzing trace with hash 1095111161, now seen corresponding path program 1 times [2025-03-04 04:48:07,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:48:07,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339419243] [2025-03-04 04:48:07,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:48:07,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:48:08,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 249 statements into 1 equivalence classes. [2025-03-04 04:48:08,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 249 of 249 statements. [2025-03-04 04:48:08,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:48:08,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:48:09,082 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-04 04:48:09,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:48:09,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339419243] [2025-03-04 04:48:09,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339419243] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 04:48:09,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1039361772] [2025-03-04 04:48:09,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:48:09,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 04:48:09,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 04:48:09,086 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 04:48:09,088 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 04:48:10,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 249 statements into 1 equivalence classes. [2025-03-04 04:48:10,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 249 of 249 statements. [2025-03-04 04:48:10,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:48:10,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:48:10,526 INFO L256 TraceCheckSpWp]: Trace formula consists of 3077 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 04:48:10,531 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 04:48:10,563 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-04 04:48:10,563 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 04:48:10,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1039361772] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:48:10,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 04:48:10,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2025-03-04 04:48:10,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99775641] [2025-03-04 04:48:10,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:48:10,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 04:48:10,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:48:10,565 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 04:48:10,565 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-04 04:48:10,565 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-04 04:48:10,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:48:10,648 INFO L93 Difference]: Finished difference Result 1854 states and 2531 transitions. [2025-03-04 04:48:10,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 04:48:10,649 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-04 04:48:10,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:48:10,656 INFO L225 Difference]: With dead ends: 1854 [2025-03-04 04:48:10,656 INFO L226 Difference]: Without dead ends: 942 [2025-03-04 04:48:10,660 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-04 04:48:10,661 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-04 04:48:10,661 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-04 04:48:10,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 942 states. [2025-03-04 04:48:10,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 942 to 939. [2025-03-04 04:48:10,685 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-04 04:48:10,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 939 states to 939 states and 1279 transitions. [2025-03-04 04:48:10,691 INFO L78 Accepts]: Start accepts. Automaton has 939 states and 1279 transitions. Word has length 249 [2025-03-04 04:48:10,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:48:10,692 INFO L471 AbstractCegarLoop]: Abstraction has 939 states and 1279 transitions. [2025-03-04 04:48:10,692 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-04 04:48:10,692 INFO L276 IsEmpty]: Start isEmpty. Operand 939 states and 1279 transitions. [2025-03-04 04:48:10,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2025-03-04 04:48:10,699 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:48:10,699 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-04 04:48:10,713 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-04 04:48:10,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-04 04:48:10,900 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE] === [2025-03-04 04:48:10,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:48:10,901 INFO L85 PathProgramCache]: Analyzing trace with hash -1401362918, now seen corresponding path program 1 times [2025-03-04 04:48:10,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:48:10,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745414055] [2025-03-04 04:48:10,902 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:48:10,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:48:11,390 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 270 statements into 1 equivalence classes. [2025-03-04 04:48:11,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 270 of 270 statements. [2025-03-04 04:48:11,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:48:11,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:48:11,590 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-04 04:48:11,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:48:11,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745414055] [2025-03-04 04:48:11,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745414055] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:48:11,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:48:11,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 04:48:11,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854236697] [2025-03-04 04:48:11,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:48:11,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 04:48:11,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:48:11,591 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 04:48:11,591 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 04:48:11,592 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-04 04:48:11,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:48:11,636 INFO L93 Difference]: Finished difference Result 1853 states and 2530 transitions. [2025-03-04 04:48:11,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 04:48:11,636 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-04 04:48:11,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:48:11,644 INFO L225 Difference]: With dead ends: 1853 [2025-03-04 04:48:11,645 INFO L226 Difference]: Without dead ends: 941 [2025-03-04 04:48:11,650 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 04:48:11,650 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-04 04:48:11,651 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-04 04:48:11,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 941 states. [2025-03-04 04:48:11,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 941 to 940. [2025-03-04 04:48:11,673 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-04 04:48:11,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 940 states to 940 states and 1280 transitions. [2025-03-04 04:48:11,678 INFO L78 Accepts]: Start accepts. Automaton has 940 states and 1280 transitions. Word has length 270 [2025-03-04 04:48:11,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:48:11,679 INFO L471 AbstractCegarLoop]: Abstraction has 940 states and 1280 transitions. [2025-03-04 04:48:11,679 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-04 04:48:11,679 INFO L276 IsEmpty]: Start isEmpty. Operand 940 states and 1280 transitions. [2025-03-04 04:48:11,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2025-03-04 04:48:11,685 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:48:11,685 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-04 04:48:11,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 04:48:11,685 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE] === [2025-03-04 04:48:11,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:48:11,686 INFO L85 PathProgramCache]: Analyzing trace with hash -1670346697, now seen corresponding path program 1 times [2025-03-04 04:48:11,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:48:11,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980947631] [2025-03-04 04:48:11,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:48:11,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:48:12,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 272 statements into 1 equivalence classes. [2025-03-04 04:48:12,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 272 of 272 statements. [2025-03-04 04:48:12,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:48:12,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:48:12,410 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-04 04:48:12,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:48:12,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980947631] [2025-03-04 04:48:12,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980947631] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 04:48:12,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2036786936] [2025-03-04 04:48:12,410 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:48:12,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 04:48:12,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 04:48:12,412 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 04:48:12,414 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 04:48:13,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 272 statements into 1 equivalence classes. [2025-03-04 04:48:13,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 272 of 272 statements. [2025-03-04 04:48:13,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:48:13,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:48:13,865 INFO L256 TraceCheckSpWp]: Trace formula consists of 3200 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 04:48:13,870 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 04:48:13,885 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-04 04:48:13,886 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 04:48:14,144 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-04 04:48:14,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2036786936] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 04:48:14,144 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 04:48:14,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-04 04:48:14,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815032652] [2025-03-04 04:48:14,145 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 04:48:14,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 04:48:14,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:48:14,146 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 04:48:14,146 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 04:48:14,146 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-04 04:48:14,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:48:14,202 INFO L93 Difference]: Finished difference Result 1859 states and 2538 transitions. [2025-03-04 04:48:14,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 04:48:14,203 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-04 04:48:14,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:48:14,212 INFO L225 Difference]: With dead ends: 1859 [2025-03-04 04:48:14,212 INFO L226 Difference]: Without dead ends: 946 [2025-03-04 04:48:14,216 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-04 04:48:14,216 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-04 04:48:14,217 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-04 04:48:14,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 946 states. [2025-03-04 04:48:14,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 946 to 946. [2025-03-04 04:48:14,242 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-04 04:48:14,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 946 states to 946 states and 1286 transitions. [2025-03-04 04:48:14,247 INFO L78 Accepts]: Start accepts. Automaton has 946 states and 1286 transitions. Word has length 272 [2025-03-04 04:48:14,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:48:14,248 INFO L471 AbstractCegarLoop]: Abstraction has 946 states and 1286 transitions. [2025-03-04 04:48:14,248 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-04 04:48:14,248 INFO L276 IsEmpty]: Start isEmpty. Operand 946 states and 1286 transitions. [2025-03-04 04:48:14,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2025-03-04 04:48:14,253 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:48:14,254 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-04 04:48:14,270 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-04 04:48:14,454 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-04 04:48:14,456 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE] === [2025-03-04 04:48:14,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:48:14,457 INFO L85 PathProgramCache]: Analyzing trace with hash 4340494, now seen corresponding path program 2 times [2025-03-04 04:48:14,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:48:14,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088843813] [2025-03-04 04:48:14,457 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 04:48:14,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:48:15,086 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 278 statements into 2 equivalence classes. [2025-03-04 04:48:15,110 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 88 of 278 statements. [2025-03-04 04:48:15,110 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 04:48:15,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:48:15,303 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-04 04:48:15,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:48:15,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088843813] [2025-03-04 04:48:15,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088843813] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:48:15,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:48:15,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 04:48:15,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710283731] [2025-03-04 04:48:15,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:48:15,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 04:48:15,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:48:15,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 04:48:15,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 04:48:15,305 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-04 04:48:15,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:48:15,360 INFO L93 Difference]: Finished difference Result 1866 states and 2543 transitions. [2025-03-04 04:48:15,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 04:48:15,361 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-04 04:48:15,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:48:15,368 INFO L225 Difference]: With dead ends: 1866 [2025-03-04 04:48:15,368 INFO L226 Difference]: Without dead ends: 947 [2025-03-04 04:48:15,371 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-04 04:48:15,372 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-04 04:48:15,372 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-04 04:48:15,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 947 states. [2025-03-04 04:48:15,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 947 to 946. [2025-03-04 04:48:15,395 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-04 04:48:15,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 946 states to 946 states and 1284 transitions. [2025-03-04 04:48:15,400 INFO L78 Accepts]: Start accepts. Automaton has 946 states and 1284 transitions. Word has length 278 [2025-03-04 04:48:15,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:48:15,400 INFO L471 AbstractCegarLoop]: Abstraction has 946 states and 1284 transitions. [2025-03-04 04:48:15,400 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-04 04:48:15,400 INFO L276 IsEmpty]: Start isEmpty. Operand 946 states and 1284 transitions. [2025-03-04 04:48:15,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2025-03-04 04:48:15,405 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:48:15,406 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-04 04:48:15,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 04:48:15,406 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE] === [2025-03-04 04:48:15,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:48:15,406 INFO L85 PathProgramCache]: Analyzing trace with hash 1047321989, now seen corresponding path program 1 times [2025-03-04 04:48:15,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:48:15,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568940880] [2025-03-04 04:48:15,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:48:15,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:48:15,880 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 280 statements into 1 equivalence classes. [2025-03-04 04:48:15,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 280 of 280 statements. [2025-03-04 04:48:15,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:48:15,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:48:16,290 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-04 04:48:16,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:48:16,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568940880] [2025-03-04 04:48:16,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568940880] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 04:48:16,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [193298141] [2025-03-04 04:48:16,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:48:16,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 04:48:16,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 04:48:16,293 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 04:48:16,295 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 04:48:17,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 280 statements into 1 equivalence classes. [2025-03-04 04:48:17,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 280 of 280 statements. [2025-03-04 04:48:17,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:48:17,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:48:17,789 INFO L256 TraceCheckSpWp]: Trace formula consists of 3251 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 04:48:17,795 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 04:48:17,822 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-04 04:48:17,822 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 04:48:18,117 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-04 04:48:18,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [193298141] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 04:48:18,118 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 04:48:18,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-03-04 04:48:18,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136364502] [2025-03-04 04:48:18,118 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 04:48:18,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 04:48:18,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:48:18,119 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 04:48:18,119 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-04 04:48:18,120 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-04 04:48:18,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:48:18,225 INFO L93 Difference]: Finished difference Result 1877 states and 2555 transitions. [2025-03-04 04:48:18,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 04:48:18,226 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-04 04:48:18,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:48:18,232 INFO L225 Difference]: With dead ends: 1877 [2025-03-04 04:48:18,232 INFO L226 Difference]: Without dead ends: 958 [2025-03-04 04:48:18,237 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-04 04:48:18,238 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-04 04:48:18,238 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-04 04:48:18,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 958 states. [2025-03-04 04:48:18,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 958 to 958. [2025-03-04 04:48:18,263 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-04 04:48:18,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 958 states to 958 states and 1296 transitions. [2025-03-04 04:48:18,268 INFO L78 Accepts]: Start accepts. Automaton has 958 states and 1296 transitions. Word has length 280 [2025-03-04 04:48:18,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:48:18,269 INFO L471 AbstractCegarLoop]: Abstraction has 958 states and 1296 transitions. [2025-03-04 04:48:18,269 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-04 04:48:18,269 INFO L276 IsEmpty]: Start isEmpty. Operand 958 states and 1296 transitions. [2025-03-04 04:48:18,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2025-03-04 04:48:18,275 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:48:18,275 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-04 04:48:18,290 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-04 04:48:18,476 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-04 04:48:18,476 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE] === [2025-03-04 04:48:18,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:48:18,477 INFO L85 PathProgramCache]: Analyzing trace with hash 1159608307, now seen corresponding path program 2 times [2025-03-04 04:48:18,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:48:18,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162576480] [2025-03-04 04:48:18,477 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 04:48:18,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:48:18,951 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 292 statements into 2 equivalence classes. [2025-03-04 04:48:18,973 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 90 of 292 statements. [2025-03-04 04:48:18,973 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 04:48:18,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:48:19,317 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-04 04:48:19,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:48:19,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162576480] [2025-03-04 04:48:19,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162576480] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:48:19,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:48:19,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 04:48:19,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714510970] [2025-03-04 04:48:19,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:48:19,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 04:48:19,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:48:19,318 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 04:48:19,318 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 04:48:19,318 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-04 04:48:19,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:48:19,429 INFO L93 Difference]: Finished difference Result 1895 states and 2579 transitions. [2025-03-04 04:48:19,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 04:48:19,430 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-04 04:48:19,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:48:19,436 INFO L225 Difference]: With dead ends: 1895 [2025-03-04 04:48:19,436 INFO L226 Difference]: Without dead ends: 964 [2025-03-04 04:48:19,439 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-04 04:48:19,440 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-04 04:48:19,440 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-04 04:48:19,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 964 states. [2025-03-04 04:48:19,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 964 to 962. [2025-03-04 04:48:19,464 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-04 04:48:19,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 962 states to 962 states and 1301 transitions. [2025-03-04 04:48:19,469 INFO L78 Accepts]: Start accepts. Automaton has 962 states and 1301 transitions. Word has length 292 [2025-03-04 04:48:19,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:48:19,469 INFO L471 AbstractCegarLoop]: Abstraction has 962 states and 1301 transitions. [2025-03-04 04:48:19,470 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-04 04:48:19,470 INFO L276 IsEmpty]: Start isEmpty. Operand 962 states and 1301 transitions. [2025-03-04 04:48:19,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2025-03-04 04:48:19,475 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:48:19,475 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-04 04:48:19,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 04:48:19,475 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE] === [2025-03-04 04:48:19,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:48:19,477 INFO L85 PathProgramCache]: Analyzing trace with hash 1485760339, now seen corresponding path program 1 times [2025-03-04 04:48:19,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:48:19,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765008134] [2025-03-04 04:48:19,477 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:48:19,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:48:19,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 292 statements into 1 equivalence classes. [2025-03-04 04:48:19,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 292 of 292 statements. [2025-03-04 04:48:19,997 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:48:19,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:48:20,543 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-04 04:48:20,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:48:20,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765008134] [2025-03-04 04:48:20,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765008134] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 04:48:20,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1621844642] [2025-03-04 04:48:20,544 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:48:20,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 04:48:20,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 04:48:20,546 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 04:48:20,547 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 04:48:21,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 292 statements into 1 equivalence classes. [2025-03-04 04:48:22,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 292 of 292 statements. [2025-03-04 04:48:22,073 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:48:22,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:48:22,087 INFO L256 TraceCheckSpWp]: Trace formula consists of 3379 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 04:48:22,093 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 04:48:22,141 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-04 04:48:22,142 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 04:48:22,550 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-04 04:48:22,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1621844642] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 04:48:22,550 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 04:48:22,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2025-03-04 04:48:22,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471248194] [2025-03-04 04:48:22,550 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 04:48:22,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-04 04:48:22,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:48:22,551 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-04 04:48:22,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2025-03-04 04:48:22,552 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-04 04:48:22,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:48:22,740 INFO L93 Difference]: Finished difference Result 1921 states and 2607 transitions. [2025-03-04 04:48:22,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-04 04:48:22,742 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-04 04:48:22,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:48:22,749 INFO L225 Difference]: With dead ends: 1921 [2025-03-04 04:48:22,750 INFO L226 Difference]: Without dead ends: 986 [2025-03-04 04:48:22,753 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-04 04:48:22,754 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-04 04:48:22,754 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-04 04:48:22,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 986 states. [2025-03-04 04:48:22,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 986 to 986. [2025-03-04 04:48:22,779 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-04 04:48:22,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 986 states to 986 states and 1325 transitions. [2025-03-04 04:48:22,790 INFO L78 Accepts]: Start accepts. Automaton has 986 states and 1325 transitions. Word has length 292 [2025-03-04 04:48:22,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:48:22,790 INFO L471 AbstractCegarLoop]: Abstraction has 986 states and 1325 transitions. [2025-03-04 04:48:22,791 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-04 04:48:22,791 INFO L276 IsEmpty]: Start isEmpty. Operand 986 states and 1325 transitions. [2025-03-04 04:48:22,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2025-03-04 04:48:22,796 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:48:22,797 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-04 04:48:22,814 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-04 04:48:22,997 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-04 04:48:22,997 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE] === [2025-03-04 04:48:22,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:48:22,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1603956015, now seen corresponding path program 2 times [2025-03-04 04:48:22,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:48:22,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035905889] [2025-03-04 04:48:22,999 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 04:48:22,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:48:23,479 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 316 statements into 2 equivalence classes. [2025-03-04 04:48:23,572 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 90 of 316 statements. [2025-03-04 04:48:23,572 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 04:48:23,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:48:23,787 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 634 trivial. 0 not checked. [2025-03-04 04:48:23,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:48:23,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035905889] [2025-03-04 04:48:23,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035905889] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:48:23,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:48:23,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 04:48:23,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645579983] [2025-03-04 04:48:23,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:48:23,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 04:48:23,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:48:23,792 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 04:48:23,792 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 04:48:23,792 INFO L87 Difference]: Start difference. First operand 986 states and 1325 transitions. Second operand has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 2 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-04 04:48:23,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:48:23,863 INFO L93 Difference]: Finished difference Result 1954 states and 2680 transitions. [2025-03-04 04:48:23,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 04:48:23,864 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 2 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 316 [2025-03-04 04:48:23,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:48:23,872 INFO L225 Difference]: With dead ends: 1954 [2025-03-04 04:48:23,873 INFO L226 Difference]: Without dead ends: 995 [2025-03-04 04:48:23,877 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 04:48:23,877 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-04 04:48:23,877 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-04 04:48:23,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 995 states. [2025-03-04 04:48:23,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 995 to 994. [2025-03-04 04:48:23,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 994 states, 740 states have (on average 1.318918918918919) internal successors, (976), 765 states have internal predecessors, (976), 174 states have call successors, (174), 78 states have call predecessors, (174), 78 states have return successors, (188), 169 states have call predecessors, (188), 173 states have call successors, (188) [2025-03-04 04:48:23,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 994 states to 994 states and 1338 transitions. [2025-03-04 04:48:23,915 INFO L78 Accepts]: Start accepts. Automaton has 994 states and 1338 transitions. Word has length 316 [2025-03-04 04:48:23,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:48:23,915 INFO L471 AbstractCegarLoop]: Abstraction has 994 states and 1338 transitions. [2025-03-04 04:48:23,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 2 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-04 04:48:23,917 INFO L276 IsEmpty]: Start isEmpty. Operand 994 states and 1338 transitions. [2025-03-04 04:48:23,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2025-03-04 04:48:23,922 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:48:23,922 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, 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-04 04:48:23,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 04:48:23,923 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE] === [2025-03-04 04:48:23,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:48:23,923 INFO L85 PathProgramCache]: Analyzing trace with hash 1327475461, now seen corresponding path program 1 times [2025-03-04 04:48:23,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:48:23,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887210859] [2025-03-04 04:48:23,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:48:23,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:48:24,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 318 statements into 1 equivalence classes. [2025-03-04 04:48:24,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 318 of 318 statements. [2025-03-04 04:48:24,476 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:48:24,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:48:25,783 INFO L134 CoverageAnalysis]: Checked inductivity of 658 backedges. 3 proven. 484 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2025-03-04 04:48:25,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:48:25,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887210859] [2025-03-04 04:48:25,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887210859] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 04:48:25,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1602875669] [2025-03-04 04:48:25,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:48:25,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 04:48:25,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 04:48:25,787 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 04:48:25,788 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 04:48:27,128 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 318 statements into 1 equivalence classes. [2025-03-04 04:48:27,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 318 of 318 statements. [2025-03-04 04:48:27,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:48:27,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:48:27,455 INFO L256 TraceCheckSpWp]: Trace formula consists of 3613 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-04 04:48:27,460 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 04:48:27,586 INFO L134 CoverageAnalysis]: Checked inductivity of 658 backedges. 68 proven. 484 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2025-03-04 04:48:27,586 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 04:48:28,214 INFO L134 CoverageAnalysis]: Checked inductivity of 658 backedges. 3 proven. 484 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2025-03-04 04:48:28,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1602875669] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 04:48:28,215 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 04:48:28,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 33 [2025-03-04 04:48:28,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759127023] [2025-03-04 04:48:28,215 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 04:48:28,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-03-04 04:48:28,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:48:28,217 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-03-04 04:48:28,217 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2025-03-04 04:48:28,217 INFO L87 Difference]: Start difference. First operand 994 states and 1338 transitions. Second operand has 33 states, 33 states have (on average 7.151515151515151) internal successors, (236), 33 states have internal predecessors, (236), 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-04 04:48:28,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:48:28,354 INFO L93 Difference]: Finished difference Result 1977 states and 2669 transitions. [2025-03-04 04:48:28,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-03-04 04:48:28,354 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 7.151515151515151) internal successors, (236), 33 states have internal predecessors, (236), 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 318 [2025-03-04 04:48:28,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:48:28,361 INFO L225 Difference]: With dead ends: 1977 [2025-03-04 04:48:28,362 INFO L226 Difference]: Without dead ends: 1010 [2025-03-04 04:48:28,365 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 659 GetRequests, 612 SyntacticMatches, 16 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 320 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2025-03-04 04:48:28,366 INFO L435 NwaCegarLoop]: 853 mSDtfsCounter, 1 mSDsluCounter, 3396 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 4249 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 04:48:28,366 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 4249 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 04:48:28,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1010 states. [2025-03-04 04:48:28,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1010 to 1010. [2025-03-04 04:48:28,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1010 states, 756 states have (on average 1.312169312169312) internal successors, (992), 781 states have internal predecessors, (992), 174 states have call successors, (174), 78 states have call predecessors, (174), 78 states have return successors, (188), 169 states have call predecessors, (188), 173 states have call successors, (188) [2025-03-04 04:48:28,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1010 states to 1010 states and 1354 transitions. [2025-03-04 04:48:28,398 INFO L78 Accepts]: Start accepts. Automaton has 1010 states and 1354 transitions. Word has length 318 [2025-03-04 04:48:28,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:48:28,399 INFO L471 AbstractCegarLoop]: Abstraction has 1010 states and 1354 transitions. [2025-03-04 04:48:28,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 7.151515151515151) internal successors, (236), 33 states have internal predecessors, (236), 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-04 04:48:28,400 INFO L276 IsEmpty]: Start isEmpty. Operand 1010 states and 1354 transitions. [2025-03-04 04:48:28,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2025-03-04 04:48:28,404 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:48:28,404 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 04:48:28,422 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-04 04:48:28,605 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-04 04:48:28,608 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE] === [2025-03-04 04:48:28,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:48:28,608 INFO L85 PathProgramCache]: Analyzing trace with hash 1657740829, now seen corresponding path program 2 times [2025-03-04 04:48:28,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:48:28,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816562569] [2025-03-04 04:48:28,608 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 04:48:28,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:48:29,112 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 334 statements into 2 equivalence classes. [2025-03-04 04:48:29,132 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 90 of 334 statements. [2025-03-04 04:48:29,132 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 04:48:29,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:48:29,544 INFO L134 CoverageAnalysis]: Checked inductivity of 1074 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 1042 trivial. 0 not checked. [2025-03-04 04:48:29,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:48:29,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816562569] [2025-03-04 04:48:29,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816562569] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:48:29,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:48:29,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 04:48:29,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342108819] [2025-03-04 04:48:29,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:48:29,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 04:48:29,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:48:29,546 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 04:48:29,546 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-04 04:48:29,546 INFO L87 Difference]: Start difference. First operand 1010 states and 1354 transitions. Second operand has 9 states, 9 states have (on average 16.666666666666668) internal successors, (150), 7 states have internal predecessors, (150), 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-04 04:48:29,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:48:29,710 INFO L93 Difference]: Finished difference Result 2047 states and 2763 transitions. [2025-03-04 04:48:29,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 04:48:29,711 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 16.666666666666668) internal successors, (150), 7 states have internal predecessors, (150), 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 334 [2025-03-04 04:48:29,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:48:29,717 INFO L225 Difference]: With dead ends: 2047 [2025-03-04 04:48:29,717 INFO L226 Difference]: Without dead ends: 1064 [2025-03-04 04:48:29,719 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-04 04:48:29,720 INFO L435 NwaCegarLoop]: 848 mSDtfsCounter, 11 mSDsluCounter, 5925 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2025-03-04 04:48:29,722 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.1s Time] [2025-03-04 04:48:29,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1064 states. [2025-03-04 04:48:29,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1064 to 1026. [2025-03-04 04:48:29,739 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-04 04:48:29,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1026 states to 1026 states and 1377 transitions. [2025-03-04 04:48:29,744 INFO L78 Accepts]: Start accepts. Automaton has 1026 states and 1377 transitions. Word has length 334 [2025-03-04 04:48:29,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:48:29,744 INFO L471 AbstractCegarLoop]: Abstraction has 1026 states and 1377 transitions. [2025-03-04 04:48:29,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 16.666666666666668) internal successors, (150), 7 states have internal predecessors, (150), 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-04 04:48:29,744 INFO L276 IsEmpty]: Start isEmpty. Operand 1026 states and 1377 transitions. [2025-03-04 04:48:29,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 375 [2025-03-04 04:48:29,748 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:48:29,748 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-04 04:48:29,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-04 04:48:29,749 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE] === [2025-03-04 04:48:29,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:48:29,750 INFO L85 PathProgramCache]: Analyzing trace with hash -203666403, now seen corresponding path program 1 times [2025-03-04 04:48:29,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:48:29,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852082101] [2025-03-04 04:48:29,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:48:29,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:48:30,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 374 statements into 1 equivalence classes. [2025-03-04 04:48:30,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 374 of 374 statements. [2025-03-04 04:48:30,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:48:30,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:48:31,091 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-04 04:48:31,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:48:31,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852082101] [2025-03-04 04:48:31,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852082101] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 04:48:31,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1993471493] [2025-03-04 04:48:31,092 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:48:31,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 04:48:31,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 04:48:31,094 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-04 04:48:31,096 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-04 04:48:32,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 374 statements into 1 equivalence classes. [2025-03-04 04:48:32,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 374 of 374 statements. [2025-03-04 04:48:32,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:48:32,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:48:32,962 INFO L256 TraceCheckSpWp]: Trace formula consists of 3883 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-04 04:48:32,969 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 04:48:33,062 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-04 04:48:33,062 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 04:48:33,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1993471493] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:48:33,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 04:48:33,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2025-03-04 04:48:33,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095336745] [2025-03-04 04:48:33,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:48:33,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 04:48:33,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:48:33,064 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 04:48:33,064 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-04 04:48:33,064 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-04 04:48:33,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:48:33,421 INFO L93 Difference]: Finished difference Result 2073 states and 2797 transitions. [2025-03-04 04:48:33,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 04:48:33,421 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-04 04:48:33,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:48:33,429 INFO L225 Difference]: With dead ends: 2073 [2025-03-04 04:48:33,429 INFO L226 Difference]: Without dead ends: 1054 [2025-03-04 04:48:33,432 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-04 04:48:33,433 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-04 04:48:33,433 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-04 04:48:33,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1054 states. [2025-03-04 04:48:33,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1054 to 1033. [2025-03-04 04:48:33,460 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-04 04:48:33,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1033 states to 1033 states and 1385 transitions. [2025-03-04 04:48:33,466 INFO L78 Accepts]: Start accepts. Automaton has 1033 states and 1385 transitions. Word has length 374 [2025-03-04 04:48:33,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:48:33,466 INFO L471 AbstractCegarLoop]: Abstraction has 1033 states and 1385 transitions. [2025-03-04 04:48:33,466 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-04 04:48:33,467 INFO L276 IsEmpty]: Start isEmpty. Operand 1033 states and 1385 transitions. [2025-03-04 04:48:33,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 379 [2025-03-04 04:48:33,472 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:48:33,472 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-04 04:48:33,490 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-04 04:48:33,677 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-04 04:48:33,677 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE] === [2025-03-04 04:48:33,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:48:33,678 INFO L85 PathProgramCache]: Analyzing trace with hash -1798640163, now seen corresponding path program 1 times [2025-03-04 04:48:33,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:48:33,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534634814] [2025-03-04 04:48:33,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:48:33,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:48:34,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 378 statements into 1 equivalence classes. [2025-03-04 04:48:34,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 378 of 378 statements. [2025-03-04 04:48:34,216 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:48:34,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:48:34,990 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-04 04:48:34,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:48:34,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534634814] [2025-03-04 04:48:34,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534634814] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 04:48:34,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1064534640] [2025-03-04 04:48:34,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:48:34,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 04:48:34,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 04:48:34,992 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-04 04:48:34,994 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-04 04:48:36,395 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 378 statements into 1 equivalence classes. [2025-03-04 04:48:37,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 378 of 378 statements. [2025-03-04 04:48:37,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:48:37,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:48:37,559 INFO L256 TraceCheckSpWp]: Trace formula consists of 3961 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-04 04:48:37,566 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 04:48:37,594 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-04 04:48:37,594 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 04:48:37,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1064534640] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:48:37,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 04:48:37,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 6 [2025-03-04 04:48:37,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421481347] [2025-03-04 04:48:37,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:48:37,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 04:48:37,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:48:37,595 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 04:48:37,596 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 04:48:37,596 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-04 04:48:37,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:48:37,711 INFO L93 Difference]: Finished difference Result 2326 states and 3104 transitions. [2025-03-04 04:48:37,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 04:48:37,714 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-04 04:48:37,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:48:37,722 INFO L225 Difference]: With dead ends: 2326 [2025-03-04 04:48:37,722 INFO L226 Difference]: Without dead ends: 1320 [2025-03-04 04:48:37,725 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-04 04:48:37,726 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.1s IncrementalHoareTripleChecker+Time [2025-03-04 04:48:37,727 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.1s Time] [2025-03-04 04:48:37,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1320 states. [2025-03-04 04:48:37,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1320 to 1307. [2025-03-04 04:48:37,752 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-04 04:48:37,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1307 states to 1307 states and 1735 transitions. [2025-03-04 04:48:37,757 INFO L78 Accepts]: Start accepts. Automaton has 1307 states and 1735 transitions. Word has length 378 [2025-03-04 04:48:37,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:48:37,757 INFO L471 AbstractCegarLoop]: Abstraction has 1307 states and 1735 transitions. [2025-03-04 04:48:37,757 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-04 04:48:37,758 INFO L276 IsEmpty]: Start isEmpty. Operand 1307 states and 1735 transitions. [2025-03-04 04:48:37,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 399 [2025-03-04 04:48:37,763 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:48:37,763 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-04 04:48:37,785 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-04 04:48:37,963 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-04 04:48:37,964 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE] === [2025-03-04 04:48:37,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:48:37,964 INFO L85 PathProgramCache]: Analyzing trace with hash -1294541491, now seen corresponding path program 2 times [2025-03-04 04:48:37,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:48:37,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656177940] [2025-03-04 04:48:37,964 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 04:48:37,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:48:38,467 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 398 statements into 2 equivalence classes. [2025-03-04 04:48:38,646 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 398 of 398 statements. [2025-03-04 04:48:38,646 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 04:48:38,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:48:39,692 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-04 04:48:39,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:48:39,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656177940] [2025-03-04 04:48:39,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656177940] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 04:48:39,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [669776752] [2025-03-04 04:48:39,692 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 04:48:39,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 04:48:39,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 04:48:39,695 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-04 04:48:39,696 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-04 04:48:41,296 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 398 statements into 2 equivalence classes.