./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--net--usb--cdc_mbim.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-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--net--usb--cdc_mbim.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 938b60b21c972fc7f556d0694990fba352b46bfd03cbdeaa77f40e339f6c8deb --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 03:58:50,536 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 03:58:50,590 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-04 03:58:50,595 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 03:58:50,595 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 03:58:50,614 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 03:58:50,615 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 03:58:50,615 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 03:58:50,615 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 03:58:50,616 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 03:58:50,616 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 03:58:50,616 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 03:58:50,617 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 03:58:50,617 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 03:58:50,617 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 03:58:50,617 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 03:58:50,617 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 03:58:50,618 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 03:58:50,618 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 03:58:50,618 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 03:58:50,618 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 03:58:50,618 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 03:58:50,618 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 03:58:50,618 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 03:58:50,618 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 03:58:50,618 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 03:58:50,618 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 03:58:50,618 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 03:58:50,618 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 03:58:50,619 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 03:58:50,619 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 03:58:50,619 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 03:58:50,619 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 03:58:50,619 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 03:58:50,619 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 03:58:50,620 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 03:58:50,620 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 03:58:50,620 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 03:58:50,620 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 03:58:50,620 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 03:58:50,620 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 -> 938b60b21c972fc7f556d0694990fba352b46bfd03cbdeaa77f40e339f6c8deb [2025-03-04 03:58:50,860 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 03:58:50,867 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 03:58:50,869 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 03:58:50,870 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 03:58:50,871 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 03:58:50,872 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--net--usb--cdc_mbim.ko-entry_point.cil.out.i [2025-03-04 03:58:52,054 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57dfb3256/3dd8b01b25654840b3357d25cb5e6731/FLAG6a8278d30 [2025-03-04 03:58:52,549 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 03:58:52,550 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--net--usb--cdc_mbim.ko-entry_point.cil.out.i [2025-03-04 03:58:52,584 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57dfb3256/3dd8b01b25654840b3357d25cb5e6731/FLAG6a8278d30 [2025-03-04 03:58:52,598 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57dfb3256/3dd8b01b25654840b3357d25cb5e6731 [2025-03-04 03:58:52,601 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 03:58:52,602 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 03:58:52,604 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 03:58:52,604 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 03:58:52,608 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 03:58:52,609 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:58:52" (1/1) ... [2025-03-04 03:58:52,609 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d43779c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:58:52, skipping insertion in model container [2025-03-04 03:58:52,610 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:58:52" (1/1) ... [2025-03-04 03:58:52,676 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 03:58:53,300 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-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--net--usb--cdc_mbim.ko-entry_point.cil.out.i[161908,161921] [2025-03-04 03:58:53,653 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 03:58:53,673 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 03:58:53,820 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; decl %0; sete %1": "+m" (v->counter), "=qm" (c): : "memory"); [5496-5497] [2025-03-04 03:58:53,822 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"); [5508-5509] [2025-03-04 03:58:53,822 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"); [5512-5513] [2025-03-04 03:58:53,823 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"); [5516-5517] [2025-03-04 03:58:53,823 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"); [5520-5521] [2025-03-04 03:58:53,827 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-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--net--usb--cdc_mbim.ko-entry_point.cil.out.i[161908,161921] [2025-03-04 03:58:53,913 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 03:58:53,951 INFO L204 MainTranslator]: Completed translation [2025-03-04 03:58:53,952 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:58:53 WrapperNode [2025-03-04 03:58:53,953 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 03:58:53,954 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 03:58:53,954 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 03:58:53,954 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 03:58:53,959 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:58:53" (1/1) ... [2025-03-04 03:58:54,000 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:58:53" (1/1) ... [2025-03-04 03:58:54,089 INFO L138 Inliner]: procedures = 138, calls = 566, calls flagged for inlining = 62, calls inlined = 62, statements flattened = 1911 [2025-03-04 03:58:54,090 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 03:58:54,091 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 03:58:54,091 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 03:58:54,091 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 03:58:54,098 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:58:53" (1/1) ... [2025-03-04 03:58:54,099 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:58:53" (1/1) ... [2025-03-04 03:58:54,118 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:58:53" (1/1) ... [2025-03-04 03:58:54,271 INFO L175 MemorySlicer]: Split 326 memory accesses to 17 slices as follows [2, 3, 7, 8, 10, 14, 5, 3, 3, 2, 124, 2, 19, 19, 44, 53, 8]. 38 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]. The 199 writes are split as follows [0, 1, 6, 0, 0, 12, 4, 1, 1, 1, 33, 1, 19, 19, 44, 53, 4]. [2025-03-04 03:58:54,276 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:58:53" (1/1) ... [2025-03-04 03:58:54,276 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:58:53" (1/1) ... [2025-03-04 03:58:54,346 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:58:53" (1/1) ... [2025-03-04 03:58:54,352 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:58:53" (1/1) ... [2025-03-04 03:58:54,374 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:58:53" (1/1) ... [2025-03-04 03:58:54,384 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:58:53" (1/1) ... [2025-03-04 03:58:54,415 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 03:58:54,416 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 03:58:54,416 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 03:58:54,416 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 03:58:54,417 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:58:53" (1/1) ... [2025-03-04 03:58:54,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 03:58:54,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 03:58:54,456 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 03:58:54,469 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 03:58:54,484 INFO L130 BoogieDeclarations]: Found specification of procedure usbnet_resume [2025-03-04 03:58:54,485 INFO L138 BoogieDeclarations]: Found implementation of procedure usbnet_resume [2025-03-04 03:58:54,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-03-04 03:58:54,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-03-04 03:58:54,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-03-04 03:58:54,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-03-04 03:58:54,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-03-04 03:58:54,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-03-04 03:58:54,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2025-03-04 03:58:54,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2025-03-04 03:58:54,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#8 [2025-03-04 03:58:54,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#9 [2025-03-04 03:58:54,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#10 [2025-03-04 03:58:54,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#11 [2025-03-04 03:58:54,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#12 [2025-03-04 03:58:54,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#13 [2025-03-04 03:58:54,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#14 [2025-03-04 03:58:54,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#15 [2025-03-04 03:58:54,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#16 [2025-03-04 03:58:54,487 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#0 [2025-03-04 03:58:54,487 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#1 [2025-03-04 03:58:54,488 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#2 [2025-03-04 03:58:54,488 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#3 [2025-03-04 03:58:54,488 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#4 [2025-03-04 03:58:54,488 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#5 [2025-03-04 03:58:54,488 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#6 [2025-03-04 03:58:54,488 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#7 [2025-03-04 03:58:54,489 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#8 [2025-03-04 03:58:54,489 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#9 [2025-03-04 03:58:54,489 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#10 [2025-03-04 03:58:54,489 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#11 [2025-03-04 03:58:54,490 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#12 [2025-03-04 03:58:54,490 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#13 [2025-03-04 03:58:54,490 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#14 [2025-03-04 03:58:54,490 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#15 [2025-03-04 03:58:54,490 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#16 [2025-03-04 03:58:54,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-03-04 03:58:54,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-03-04 03:58:54,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-03-04 03:58:54,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-03-04 03:58:54,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-03-04 03:58:54,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2025-03-04 03:58:54,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2025-03-04 03:58:54,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#7 [2025-03-04 03:58:54,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#8 [2025-03-04 03:58:54,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#9 [2025-03-04 03:58:54,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#10 [2025-03-04 03:58:54,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#11 [2025-03-04 03:58:54,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#12 [2025-03-04 03:58:54,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#13 [2025-03-04 03:58:54,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#14 [2025-03-04 03:58:54,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#15 [2025-03-04 03:58:54,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#16 [2025-03-04 03:58:54,490 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2025-03-04 03:58:54,491 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2025-03-04 03:58:54,491 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 03:58:54,491 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 03:58:54,491 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 03:58:54,491 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-04 03:58:54,491 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-04 03:58:54,491 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-04 03:58:54,491 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-04 03:58:54,491 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-04 03:58:54,491 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-03-04 03:58:54,491 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-03-04 03:58:54,491 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-03-04 03:58:54,491 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-03-04 03:58:54,491 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-03-04 03:58:54,491 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-03-04 03:58:54,491 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-03-04 03:58:54,491 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2025-03-04 03:58:54,491 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2025-03-04 03:58:54,491 INFO L130 BoogieDeclarations]: Found specification of procedure skb_headroom [2025-03-04 03:58:54,491 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_headroom [2025-03-04 03:58:54,491 INFO L130 BoogieDeclarations]: Found specification of procedure usbnet_disconnect [2025-03-04 03:58:54,491 INFO L138 BoogieDeclarations]: Found implementation of procedure usbnet_disconnect [2025-03-04 03:58:54,491 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#0 [2025-03-04 03:58:54,491 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#1 [2025-03-04 03:58:54,491 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#2 [2025-03-04 03:58:54,491 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#3 [2025-03-04 03:58:54,491 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#4 [2025-03-04 03:58:54,491 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#5 [2025-03-04 03:58:54,491 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#6 [2025-03-04 03:58:54,491 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#7 [2025-03-04 03:58:54,491 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#8 [2025-03-04 03:58:54,491 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#9 [2025-03-04 03:58:54,491 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#10 [2025-03-04 03:58:54,494 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#11 [2025-03-04 03:58:54,494 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#12 [2025-03-04 03:58:54,494 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#13 [2025-03-04 03:58:54,494 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#14 [2025-03-04 03:58:54,494 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#15 [2025-03-04 03:58:54,495 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#16 [2025-03-04 03:58:54,495 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#0 [2025-03-04 03:58:54,495 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#1 [2025-03-04 03:58:54,495 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#2 [2025-03-04 03:58:54,495 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#3 [2025-03-04 03:58:54,495 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#4 [2025-03-04 03:58:54,495 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#5 [2025-03-04 03:58:54,495 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#6 [2025-03-04 03:58:54,495 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#7 [2025-03-04 03:58:54,495 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#8 [2025-03-04 03:58:54,495 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#9 [2025-03-04 03:58:54,495 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#10 [2025-03-04 03:58:54,495 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#11 [2025-03-04 03:58:54,495 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#12 [2025-03-04 03:58:54,495 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#13 [2025-03-04 03:58:54,495 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#14 [2025-03-04 03:58:54,495 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#15 [2025-03-04 03:58:54,495 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#16 [2025-03-04 03:58:54,495 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2025-03-04 03:58:54,495 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2025-03-04 03:58:54,495 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~~pm_message_t~0~TO~int [2025-03-04 03:58:54,495 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~~pm_message_t~0~TO~int [2025-03-04 03:58:54,495 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 03:58:54,495 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 03:58:54,495 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 03:58:54,495 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-04 03:58:54,495 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-04 03:58:54,495 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-04 03:58:54,495 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-04 03:58:54,495 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-04 03:58:54,495 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-03-04 03:58:54,495 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-03-04 03:58:54,495 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-03-04 03:58:54,495 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-03-04 03:58:54,495 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-03-04 03:58:54,495 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-03-04 03:58:54,495 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-03-04 03:58:54,495 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2025-03-04 03:58:54,495 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2025-03-04 03:58:54,495 INFO L130 BoogieDeclarations]: Found specification of procedure cdc_mbim_suspend [2025-03-04 03:58:54,496 INFO L138 BoogieDeclarations]: Found implementation of procedure cdc_mbim_suspend [2025-03-04 03:58:54,496 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2025-03-04 03:58:54,496 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2025-03-04 03:58:54,496 INFO L130 BoogieDeclarations]: Found specification of procedure cdc_mbim_resume [2025-03-04 03:58:54,496 INFO L138 BoogieDeclarations]: Found implementation of procedure cdc_mbim_resume [2025-03-04 03:58:54,496 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2025-03-04 03:58:54,496 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2025-03-04 03:58:54,496 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_read [2025-03-04 03:58:54,496 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_read [2025-03-04 03:58:54,496 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-03-04 03:58:54,496 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-03-04 03:58:54,496 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-03-04 03:58:54,496 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#3 [2025-03-04 03:58:54,496 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#4 [2025-03-04 03:58:54,496 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#5 [2025-03-04 03:58:54,496 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#6 [2025-03-04 03:58:54,496 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#7 [2025-03-04 03:58:54,496 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#8 [2025-03-04 03:58:54,496 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#9 [2025-03-04 03:58:54,496 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#10 [2025-03-04 03:58:54,496 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#11 [2025-03-04 03:58:54,496 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#12 [2025-03-04 03:58:54,496 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#13 [2025-03-04 03:58:54,496 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#14 [2025-03-04 03:58:54,496 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#15 [2025-03-04 03:58:54,496 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#16 [2025-03-04 03:58:54,496 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-03-04 03:58:54,496 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-03-04 03:58:54,496 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-03-04 03:58:54,496 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#3 [2025-03-04 03:58:54,498 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#4 [2025-03-04 03:58:54,498 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#5 [2025-03-04 03:58:54,498 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#6 [2025-03-04 03:58:54,498 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#7 [2025-03-04 03:58:54,498 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#8 [2025-03-04 03:58:54,498 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#9 [2025-03-04 03:58:54,498 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#10 [2025-03-04 03:58:54,498 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#11 [2025-03-04 03:58:54,499 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#12 [2025-03-04 03:58:54,499 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#13 [2025-03-04 03:58:54,499 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#14 [2025-03-04 03:58:54,499 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#15 [2025-03-04 03:58:54,499 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#16 [2025-03-04 03:58:54,499 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 03:58:54,499 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 03:58:54,499 INFO L130 BoogieDeclarations]: Found specification of procedure cdc_mbim_tx_fixup [2025-03-04 03:58:54,499 INFO L138 BoogieDeclarations]: Found implementation of procedure cdc_mbim_tx_fixup [2025-03-04 03:58:54,499 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 03:58:54,499 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop___0 [2025-03-04 03:58:54,499 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop___0 [2025-03-04 03:58:54,499 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_get_intfdata_4 [2025-03-04 03:58:54,499 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_get_intfdata_4 [2025-03-04 03:58:54,499 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 03:58:54,499 INFO L130 BoogieDeclarations]: Found specification of procedure __dynamic_netdev_dbg [2025-03-04 03:58:54,499 INFO L138 BoogieDeclarations]: Found implementation of procedure __dynamic_netdev_dbg [2025-03-04 03:58:54,499 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2025-03-04 03:58:54,499 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2025-03-04 03:58:54,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 03:58:54,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 03:58:54,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-04 03:58:54,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-04 03:58:54,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-03-04 03:58:54,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-03-04 03:58:54,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-03-04 03:58:54,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-03-04 03:58:54,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-03-04 03:58:54,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-03-04 03:58:54,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-03-04 03:58:54,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-03-04 03:58:54,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-03-04 03:58:54,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-03-04 03:58:54,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2025-03-04 03:58:54,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#15 [2025-03-04 03:58:54,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#16 [2025-03-04 03:58:54,500 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 03:58:54,500 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2025-03-04 03:58:54,500 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2025-03-04 03:58:54,500 INFO L130 BoogieDeclarations]: Found specification of procedure cdc_mbim_bind [2025-03-04 03:58:54,500 INFO L138 BoogieDeclarations]: Found implementation of procedure cdc_mbim_bind [2025-03-04 03:58:54,500 INFO L130 BoogieDeclarations]: Found specification of procedure cdc_mbim_manage_power [2025-03-04 03:58:54,500 INFO L138 BoogieDeclarations]: Found implementation of procedure cdc_mbim_manage_power [2025-03-04 03:58:54,500 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~int [2025-03-04 03:58:54,500 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~int [2025-03-04 03:58:54,500 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 03:58:54,500 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 03:58:54,500 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-04 03:58:54,500 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-04 03:58:54,500 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-03-04 03:58:54,500 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-03-04 03:58:54,500 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-03-04 03:58:54,500 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-03-04 03:58:54,500 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-03-04 03:58:54,500 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-03-04 03:58:54,500 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-03-04 03:58:54,500 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-03-04 03:58:54,500 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-03-04 03:58:54,500 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-03-04 03:58:54,500 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2025-03-04 03:58:54,500 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#15 [2025-03-04 03:58:54,500 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#16 [2025-03-04 03:58:54,500 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 03:58:54,500 INFO L130 BoogieDeclarations]: Found specification of procedure skb_put [2025-03-04 03:58:54,500 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_put [2025-03-04 03:58:54,500 INFO L130 BoogieDeclarations]: Found specification of procedure cdc_mbim_rx_fixup [2025-03-04 03:58:54,500 INFO L138 BoogieDeclarations]: Found implementation of procedure cdc_mbim_rx_fixup [2025-03-04 03:58:54,500 INFO L130 BoogieDeclarations]: Found specification of procedure __fswab16 [2025-03-04 03:58:54,500 INFO L138 BoogieDeclarations]: Found implementation of procedure __fswab16 [2025-03-04 03:58:54,500 INFO L130 BoogieDeclarations]: Found specification of procedure cdc_ncm_unbind [2025-03-04 03:58:54,500 INFO L138 BoogieDeclarations]: Found implementation of procedure cdc_ncm_unbind [2025-03-04 03:58:54,500 INFO L130 BoogieDeclarations]: Found specification of procedure cdc_mbim_unbind [2025-03-04 03:58:54,500 INFO L138 BoogieDeclarations]: Found implementation of procedure cdc_mbim_unbind [2025-03-04 03:58:54,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 03:58:54,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 03:58:54,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 03:58:54,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-04 03:58:54,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-04 03:58:54,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-04 03:58:54,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-04 03:58:54,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-04 03:58:54,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-04 03:58:54,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-04 03:58:54,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-04 03:58:54,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-04 03:58:54,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-04 03:58:54,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-03-04 03:58:54,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-03-04 03:58:54,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-03-04 03:58:54,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-03-04 03:58:54,502 INFO L130 BoogieDeclarations]: Found specification of procedure skb_reset_mac_header [2025-03-04 03:58:54,502 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_reset_mac_header [2025-03-04 03:58:54,502 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#0 [2025-03-04 03:58:54,502 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#1 [2025-03-04 03:58:54,502 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#2 [2025-03-04 03:58:54,502 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#3 [2025-03-04 03:58:54,502 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#4 [2025-03-04 03:58:54,502 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#5 [2025-03-04 03:58:54,503 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#6 [2025-03-04 03:58:54,503 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#7 [2025-03-04 03:58:54,503 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#8 [2025-03-04 03:58:54,503 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#9 [2025-03-04 03:58:54,503 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#10 [2025-03-04 03:58:54,503 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#11 [2025-03-04 03:58:54,503 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#12 [2025-03-04 03:58:54,503 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#13 [2025-03-04 03:58:54,503 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#14 [2025-03-04 03:58:54,503 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#15 [2025-03-04 03:58:54,503 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#16 [2025-03-04 03:58:54,503 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2025-03-04 03:58:54,503 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2025-03-04 03:58:54,503 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 03:58:54,504 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 03:58:54,504 INFO L130 BoogieDeclarations]: Found specification of procedure eth_hdr [2025-03-04 03:58:54,504 INFO L138 BoogieDeclarations]: Found implementation of procedure eth_hdr [2025-03-04 03:58:54,504 INFO L130 BoogieDeclarations]: Found specification of procedure IS_ERR [2025-03-04 03:58:54,504 INFO L138 BoogieDeclarations]: Found implementation of procedure IS_ERR [2025-03-04 03:58:54,915 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 03:58:54,917 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 03:58:55,389 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2025-03-04 03:58:55,438 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7163: havoc usbnet_suspend_#t~nondet375#1; [2025-03-04 03:58:55,439 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6317: call ULTIMATE.dealloc(~#message#1.base, ~#message#1.offset);havoc ~#message#1.base, ~#message#1.offset; [2025-03-04 03:58:55,445 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5489: havoc #t~mem18; [2025-03-04 03:58:55,591 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stop___0FINAL: assume true; [2025-03-04 03:58:55,773 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7069: havoc #t~nondet355; [2025-03-04 03:58:56,161 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5669: havoc skb_end_pointer_#t~mem39#1.base, skb_end_pointer_#t~mem39#1.offset;havoc skb_end_pointer_#t~mem40#1; [2025-03-04 03:58:56,161 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6199: call ULTIMATE.dealloc(~#descriptor~1#1.base, ~#descriptor~1#1.offset);havoc ~#descriptor~1#1.base, ~#descriptor~1#1.offset;call ULTIMATE.dealloc(~#descriptor___0~0#1.base, ~#descriptor___0~0#1.offset);havoc ~#descriptor___0~0#1.base, ~#descriptor___0~0#1.offset; [2025-03-04 03:58:56,162 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7124: havoc pskb_expand_head_#t~nondet365#1; [2025-03-04 03:58:56,162 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7096: havoc cdc_ncm_rx_verify_ndp16_#t~nondet361#1; [2025-03-04 03:58:56,162 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7130: havoc skb_push_#t~ret367#1.base, skb_push_#t~ret367#1.offset; [2025-03-04 03:58:56,162 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7100: havoc cdc_ncm_rx_verify_nth16_#t~nondet362#1; [2025-03-04 03:58:56,187 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5457: havoc #t~bitwise10; [2025-03-04 03:58:56,218 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7156: havoc #t~nondet374; [2025-03-04 03:58:56,222 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5693: havoc #t~mem50.base, #t~mem50.offset;havoc #t~mem51.base, #t~mem51.offset; [2025-03-04 03:58:56,299 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6361: call ULTIMATE.dealloc(~#__constr_expr_0~0.base, ~#__constr_expr_0~0.offset);havoc ~#__constr_expr_0~0.base, ~#__constr_expr_0~0.offset; [2025-03-04 03:58:56,462 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7092: havoc cdc_ncm_fill_tx_frame_#t~ret360#1.base, cdc_ncm_fill_tx_frame_#t~ret360#1.offset; [2025-03-04 03:58:56,463 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7127: havoc skb_pull_#t~ret366#1.base, skb_pull_#t~ret366#1.offset; [2025-03-04 03:58:56,463 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6054: call ULTIMATE.dealloc(~#sign~0#1.base, ~#sign~0#1.offset);havoc ~#sign~0#1.base, ~#sign~0#1.offset;call ULTIMATE.dealloc(~#tci~0#1.base, ~#tci~0#1.offset);havoc ~#tci~0#1.base, ~#tci~0#1.offset; [2025-03-04 03:58:56,463 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7120: havoc netdev_err_#t~nondet364#1; [2025-03-04 03:58:56,519 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7104: havoc cdc_ncm_select_altsetting_#t~nondet363#1; [2025-03-04 03:58:56,519 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7138: havoc usb_cdc_wdm_register_#t~ret371#1.base, usb_cdc_wdm_register_#t~ret371#1.offset; [2025-03-04 03:58:56,519 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7089: havoc cdc_ncm_bind_common_#t~nondet359#1; [2025-03-04 03:58:56,578 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7065: havoc __dynamic_dev_dbg_#t~nondet354#1; [2025-03-04 03:58:56,578 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5918: call ULTIMATE.dealloc(~#descriptor~0#1.base, ~#descriptor~0#1.offset);havoc ~#descriptor~0#1.base, ~#descriptor~0#1.offset; [2025-03-04 03:59:01,706 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7145: havoc usb_register_driver_#t~nondet372#1; [2025-03-04 03:59:01,707 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6489: call ULTIMATE.dealloc(main_~#ldvarg0~0#1.base, main_~#ldvarg0~0#1.offset);havoc main_~#ldvarg0~0#1.base, main_~#ldvarg0~0#1.offset;call ULTIMATE.dealloc(main_~#ldvarg3~0#1.base, main_~#ldvarg3~0#1.offset);havoc main_~#ldvarg3~0#1.base, main_~#ldvarg3~0#1.offset;call ULTIMATE.dealloc(main_~#ldvarg5~0#1.base, main_~#ldvarg5~0#1.offset);havoc main_~#ldvarg5~0#1.base, main_~#ldvarg5~0#1.offset; [2025-03-04 03:59:01,707 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7152: havoc usbnet_probe_#t~nondet373#1; [2025-03-04 03:59:01,740 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5699: havoc skb_mac_header_#t~mem52#1.base, skb_mac_header_#t~mem52#1.offset;havoc skb_mac_header_#t~mem53#1; [2025-03-04 03:59:02,061 INFO L? ?]: Removed 1202 outVars from TransFormulas that were not future-live. [2025-03-04 03:59:02,061 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 03:59:02,089 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 03:59:02,089 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 03:59:02,090 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:59:02 BoogieIcfgContainer [2025-03-04 03:59:02,090 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 03:59:02,095 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 03:59:02,095 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 03:59:02,099 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 03:59:02,099 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 03:58:52" (1/3) ... [2025-03-04 03:59:02,100 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d54410c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:59:02, skipping insertion in model container [2025-03-04 03:59:02,100 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:58:53" (2/3) ... [2025-03-04 03:59:02,100 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d54410c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:59:02, skipping insertion in model container [2025-03-04 03:59:02,100 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:59:02" (3/3) ... [2025-03-04 03:59:02,101 INFO L128 eAbstractionObserver]: Analyzing ICFG linux-3.12-rc1.tar.xz-144_2a-drivers--net--usb--cdc_mbim.ko-entry_point.cil.out.i [2025-03-04 03:59:02,114 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 03:59:02,117 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG linux-3.12-rc1.tar.xz-144_2a-drivers--net--usb--cdc_mbim.ko-entry_point.cil.out.i that has 65 procedures, 733 locations, 1 initial locations, 53 loop locations, and 1 error locations. [2025-03-04 03:59:02,171 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 03:59:02,181 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;@5fcbd163, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 03:59:02,182 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 03:59:02,186 INFO L276 IsEmpty]: Start isEmpty. Operand has 599 states, 468 states have (on average 1.4166666666666667) internal successors, (663), 482 states have internal predecessors, (663), 96 states have call successors, (96), 35 states have call predecessors, (96), 33 states have return successors, (90), 90 states have call predecessors, (90), 90 states have call successors, (90) [2025-03-04 03:59:02,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-04 03:59:02,193 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:59:02,194 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:59:02,194 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:59:02,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:59:02,198 INFO L85 PathProgramCache]: Analyzing trace with hash 1226696018, now seen corresponding path program 1 times [2025-03-04 03:59:02,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:59:02,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33672163] [2025-03-04 03:59:02,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:59:02,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:59:03,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-04 03:59:03,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-04 03:59:03,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:59:03,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:59:04,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 03:59:04,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:59:04,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33672163] [2025-03-04 03:59:04,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33672163] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:59:04,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 03:59:04,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 03:59:04,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945245769] [2025-03-04 03:59:04,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:59:04,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 03:59:04,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:59:04,148 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 03:59:04,149 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 03:59:04,152 INFO L87 Difference]: Start difference. First operand has 599 states, 468 states have (on average 1.4166666666666667) internal successors, (663), 482 states have internal predecessors, (663), 96 states have call successors, (96), 35 states have call predecessors, (96), 33 states have return successors, (90), 90 states have call predecessors, (90), 90 states have call successors, (90) Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 03:59:08,196 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 03:59:08,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:59:08,731 INFO L93 Difference]: Finished difference Result 1728 states and 2514 transitions. [2025-03-04 03:59:08,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 03:59:08,733 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 40 [2025-03-04 03:59:08,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:59:08,747 INFO L225 Difference]: With dead ends: 1728 [2025-03-04 03:59:08,747 INFO L226 Difference]: Without dead ends: 1112 [2025-03-04 03:59:08,754 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 03:59:08,756 INFO L435 NwaCegarLoop]: 843 mSDtfsCounter, 758 mSDsluCounter, 803 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 758 SdHoareTripleChecker+Valid, 1646 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2025-03-04 03:59:08,757 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [758 Valid, 1646 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 41 Invalid, 1 Unknown, 0 Unchecked, 4.5s Time] [2025-03-04 03:59:08,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1112 states. [2025-03-04 03:59:08,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1112 to 1109. [2025-03-04 03:59:08,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1109 states, 884 states have (on average 1.4015837104072397) internal successors, (1239), 891 states have internal predecessors, (1239), 163 states have call successors, (163), 62 states have call predecessors, (163), 61 states have return successors, (157), 157 states have call predecessors, (157), 157 states have call successors, (157) [2025-03-04 03:59:08,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1109 states to 1109 states and 1559 transitions. [2025-03-04 03:59:08,862 INFO L78 Accepts]: Start accepts. Automaton has 1109 states and 1559 transitions. Word has length 40 [2025-03-04 03:59:08,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:59:08,862 INFO L471 AbstractCegarLoop]: Abstraction has 1109 states and 1559 transitions. [2025-03-04 03:59:08,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 03:59:08,862 INFO L276 IsEmpty]: Start isEmpty. Operand 1109 states and 1559 transitions. [2025-03-04 03:59:08,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-04 03:59:08,870 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:59:08,871 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-04 03:59:08,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 03:59:08,871 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:59:08,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:59:08,872 INFO L85 PathProgramCache]: Analyzing trace with hash -1443822458, now seen corresponding path program 1 times [2025-03-04 03:59:08,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:59:08,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818422453] [2025-03-04 03:59:08,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:59:08,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:59:09,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-04 03:59:09,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-04 03:59:09,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:59:09,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:59:10,498 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 03:59:10,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:59:10,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818422453] [2025-03-04 03:59:10,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818422453] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:59:10,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 03:59:10,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 03:59:10,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748758687] [2025-03-04 03:59:10,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:59:10,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 03:59:10,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:59:10,500 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 03:59:10,500 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 03:59:10,503 INFO L87 Difference]: Start difference. First operand 1109 states and 1559 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-04 03:59:10,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:59:10,682 INFO L93 Difference]: Finished difference Result 1111 states and 1560 transitions. [2025-03-04 03:59:10,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 03:59:10,683 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 50 [2025-03-04 03:59:10,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:59:10,690 INFO L225 Difference]: With dead ends: 1111 [2025-03-04 03:59:10,691 INFO L226 Difference]: Without dead ends: 1108 [2025-03-04 03:59:10,691 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 03:59:10,692 INFO L435 NwaCegarLoop]: 801 mSDtfsCounter, 790 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 790 SdHoareTripleChecker+Valid, 801 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 03:59:10,692 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [790 Valid, 801 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 03:59:10,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1108 states. [2025-03-04 03:59:10,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1108 to 1108. [2025-03-04 03:59:10,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1108 states, 884 states have (on average 1.4004524886877827) internal successors, (1238), 890 states have internal predecessors, (1238), 162 states have call successors, (162), 62 states have call predecessors, (162), 61 states have return successors, (157), 157 states have call predecessors, (157), 157 states have call successors, (157) [2025-03-04 03:59:10,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1108 states to 1108 states and 1557 transitions. [2025-03-04 03:59:10,752 INFO L78 Accepts]: Start accepts. Automaton has 1108 states and 1557 transitions. Word has length 50 [2025-03-04 03:59:10,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:59:10,753 INFO L471 AbstractCegarLoop]: Abstraction has 1108 states and 1557 transitions. [2025-03-04 03:59:10,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-04 03:59:10,753 INFO L276 IsEmpty]: Start isEmpty. Operand 1108 states and 1557 transitions. [2025-03-04 03:59:10,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-04 03:59:10,757 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:59:10,757 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-04 03:59:10,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 03:59:10,757 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:59:10,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:59:10,760 INFO L85 PathProgramCache]: Analyzing trace with hash -1809219145, now seen corresponding path program 1 times [2025-03-04 03:59:10,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:59:10,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843014257] [2025-03-04 03:59:10,761 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:59:10,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:59:11,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-04 03:59:11,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-04 03:59:11,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:59:11,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:59:12,341 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 03:59:12,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:59:12,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843014257] [2025-03-04 03:59:12,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843014257] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:59:12,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 03:59:12,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 03:59:12,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173285180] [2025-03-04 03:59:12,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:59:12,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 03:59:12,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:59:12,342 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 03:59:12,342 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 03:59:12,342 INFO L87 Difference]: Start difference. First operand 1108 states and 1557 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-04 03:59:12,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:59:12,510 INFO L93 Difference]: Finished difference Result 1110 states and 1558 transitions. [2025-03-04 03:59:12,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 03:59:12,511 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 51 [2025-03-04 03:59:12,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:59:12,517 INFO L225 Difference]: With dead ends: 1110 [2025-03-04 03:59:12,517 INFO L226 Difference]: Without dead ends: 1107 [2025-03-04 03:59:12,519 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 03:59:12,521 INFO L435 NwaCegarLoop]: 799 mSDtfsCounter, 787 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 787 SdHoareTripleChecker+Valid, 799 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 03:59:12,521 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [787 Valid, 799 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 03:59:12,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1107 states. [2025-03-04 03:59:12,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1107 to 1107. [2025-03-04 03:59:12,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1107 states, 884 states have (on average 1.3993212669683257) internal successors, (1237), 889 states have internal predecessors, (1237), 161 states have call successors, (161), 62 states have call predecessors, (161), 61 states have return successors, (157), 157 states have call predecessors, (157), 157 states have call successors, (157) [2025-03-04 03:59:12,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1107 states to 1107 states and 1555 transitions. [2025-03-04 03:59:12,576 INFO L78 Accepts]: Start accepts. Automaton has 1107 states and 1555 transitions. Word has length 51 [2025-03-04 03:59:12,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:59:12,577 INFO L471 AbstractCegarLoop]: Abstraction has 1107 states and 1555 transitions. [2025-03-04 03:59:12,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-04 03:59:12,578 INFO L276 IsEmpty]: Start isEmpty. Operand 1107 states and 1555 transitions. [2025-03-04 03:59:12,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-04 03:59:12,582 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:59:12,582 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-04 03:59:12,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 03:59:12,582 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:59:12,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:59:12,583 INFO L85 PathProgramCache]: Analyzing trace with hash -251615577, now seen corresponding path program 1 times [2025-03-04 03:59:12,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:59:12,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657494008] [2025-03-04 03:59:12,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:59:12,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:59:13,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-04 03:59:13,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-04 03:59:13,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:59:13,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:59:13,770 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 03:59:13,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:59:13,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657494008] [2025-03-04 03:59:13,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657494008] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:59:13,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 03:59:13,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 03:59:13,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066405679] [2025-03-04 03:59:13,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:59:13,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 03:59:13,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:59:13,772 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 03:59:13,772 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 03:59:13,772 INFO L87 Difference]: Start difference. First operand 1107 states and 1555 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-04 03:59:13,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:59:13,959 INFO L93 Difference]: Finished difference Result 1109 states and 1556 transitions. [2025-03-04 03:59:13,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 03:59:13,960 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 52 [2025-03-04 03:59:13,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:59:13,966 INFO L225 Difference]: With dead ends: 1109 [2025-03-04 03:59:13,966 INFO L226 Difference]: Without dead ends: 1106 [2025-03-04 03:59:13,966 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 03:59:13,968 INFO L435 NwaCegarLoop]: 797 mSDtfsCounter, 784 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 784 SdHoareTripleChecker+Valid, 797 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 03:59:13,969 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [784 Valid, 797 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 03:59:13,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1106 states. [2025-03-04 03:59:14,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1106 to 1106. [2025-03-04 03:59:14,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1106 states, 884 states have (on average 1.3981900452488687) internal successors, (1236), 888 states have internal predecessors, (1236), 160 states have call successors, (160), 62 states have call predecessors, (160), 61 states have return successors, (157), 157 states have call predecessors, (157), 157 states have call successors, (157) [2025-03-04 03:59:14,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1106 states to 1106 states and 1553 transitions. [2025-03-04 03:59:14,020 INFO L78 Accepts]: Start accepts. Automaton has 1106 states and 1553 transitions. Word has length 52 [2025-03-04 03:59:14,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:59:14,020 INFO L471 AbstractCegarLoop]: Abstraction has 1106 states and 1553 transitions. [2025-03-04 03:59:14,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-04 03:59:14,020 INFO L276 IsEmpty]: Start isEmpty. Operand 1106 states and 1553 transitions. [2025-03-04 03:59:14,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-04 03:59:14,024 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:59:14,024 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-04 03:59:14,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 03:59:14,025 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:59:14,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:59:14,026 INFO L85 PathProgramCache]: Analyzing trace with hash 789453752, now seen corresponding path program 1 times [2025-03-04 03:59:14,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:59:14,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523879144] [2025-03-04 03:59:14,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:59:14,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:59:14,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-04 03:59:14,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-04 03:59:14,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:59:14,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:59:15,081 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 03:59:15,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:59:15,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523879144] [2025-03-04 03:59:15,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523879144] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:59:15,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 03:59:15,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 03:59:15,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917395850] [2025-03-04 03:59:15,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:59:15,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 03:59:15,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:59:15,082 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 03:59:15,082 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 03:59:15,082 INFO L87 Difference]: Start difference. First operand 1106 states and 1553 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-04 03:59:15,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:59:15,482 INFO L93 Difference]: Finished difference Result 3263 states and 4612 transitions. [2025-03-04 03:59:15,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 03:59:15,482 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 53 [2025-03-04 03:59:15,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:59:15,495 INFO L225 Difference]: With dead ends: 3263 [2025-03-04 03:59:15,495 INFO L226 Difference]: Without dead ends: 2180 [2025-03-04 03:59:15,501 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 03:59:15,501 INFO L435 NwaCegarLoop]: 831 mSDtfsCounter, 776 mSDsluCounter, 765 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 776 SdHoareTripleChecker+Valid, 1596 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 03:59:15,502 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [776 Valid, 1596 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 03:59:15,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2180 states. [2025-03-04 03:59:15,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2180 to 2176. [2025-03-04 03:59:15,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2176 states, 1743 states have (on average 1.4004589787722317) internal successors, (2441), 1749 states have internal predecessors, (2441), 313 states have call successors, (313), 120 states have call predecessors, (313), 119 states have return successors, (318), 310 states have call predecessors, (318), 310 states have call successors, (318) [2025-03-04 03:59:15,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2176 states to 2176 states and 3072 transitions. [2025-03-04 03:59:15,652 INFO L78 Accepts]: Start accepts. Automaton has 2176 states and 3072 transitions. Word has length 53 [2025-03-04 03:59:15,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:59:15,653 INFO L471 AbstractCegarLoop]: Abstraction has 2176 states and 3072 transitions. [2025-03-04 03:59:15,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-04 03:59:15,653 INFO L276 IsEmpty]: Start isEmpty. Operand 2176 states and 3072 transitions. [2025-03-04 03:59:15,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-04 03:59:15,656 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:59:15,656 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-04 03:59:15,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 03:59:15,656 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:59:15,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:59:15,657 INFO L85 PathProgramCache]: Analyzing trace with hash -1297136440, now seen corresponding path program 1 times [2025-03-04 03:59:15,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:59:15,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639520298] [2025-03-04 03:59:15,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:59:15,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:59:16,542 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-04 03:59:16,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-04 03:59:16,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:59:16,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:59:16,702 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 03:59:16,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:59:16,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639520298] [2025-03-04 03:59:16,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639520298] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:59:16,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 03:59:16,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 03:59:16,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602788733] [2025-03-04 03:59:16,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:59:16,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 03:59:16,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:59:16,704 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 03:59:16,704 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 03:59:16,704 INFO L87 Difference]: Start difference. First operand 2176 states and 3072 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-04 03:59:16,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:59:16,887 INFO L93 Difference]: Finished difference Result 2178 states and 3073 transitions. [2025-03-04 03:59:16,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 03:59:16,887 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 54 [2025-03-04 03:59:16,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:59:16,897 INFO L225 Difference]: With dead ends: 2178 [2025-03-04 03:59:16,898 INFO L226 Difference]: Without dead ends: 2166 [2025-03-04 03:59:16,900 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 03:59:16,901 INFO L435 NwaCegarLoop]: 796 mSDtfsCounter, 780 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 780 SdHoareTripleChecker+Valid, 796 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 03:59:16,901 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [780 Valid, 796 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 03:59:16,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2166 states. [2025-03-04 03:59:16,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2166 to 2166. [2025-03-04 03:59:16,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2166 states, 1734 states have (on average 1.400230680507497) internal successors, (2428), 1739 states have internal predecessors, (2428), 312 states have call successors, (312), 120 states have call predecessors, (312), 119 states have return successors, (318), 310 states have call predecessors, (318), 310 states have call successors, (318) [2025-03-04 03:59:16,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2166 states to 2166 states and 3058 transitions. [2025-03-04 03:59:16,991 INFO L78 Accepts]: Start accepts. Automaton has 2166 states and 3058 transitions. Word has length 54 [2025-03-04 03:59:16,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:59:16,992 INFO L471 AbstractCegarLoop]: Abstraction has 2166 states and 3058 transitions. [2025-03-04 03:59:16,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-04 03:59:16,992 INFO L276 IsEmpty]: Start isEmpty. Operand 2166 states and 3058 transitions. [2025-03-04 03:59:16,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-04 03:59:16,994 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:59:16,994 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:59:16,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 03:59:16,995 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:59:16,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:59:16,995 INFO L85 PathProgramCache]: Analyzing trace with hash 913822828, now seen corresponding path program 1 times [2025-03-04 03:59:16,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:59:16,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582602385] [2025-03-04 03:59:16,995 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:59:16,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:59:18,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-04 03:59:18,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-04 03:59:18,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:59:18,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:59:18,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 03:59:18,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:59:18,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582602385] [2025-03-04 03:59:18,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582602385] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:59:18,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 03:59:18,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 03:59:18,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446023174] [2025-03-04 03:59:18,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:59:18,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 03:59:18,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:59:18,236 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 03:59:18,236 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 03:59:18,237 INFO L87 Difference]: Start difference. First operand 2166 states and 3058 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-04 03:59:18,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:59:18,931 INFO L93 Difference]: Finished difference Result 6284 states and 8844 transitions. [2025-03-04 03:59:18,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 03:59:18,931 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 67 [2025-03-04 03:59:18,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:59:18,953 INFO L225 Difference]: With dead ends: 6284 [2025-03-04 03:59:18,953 INFO L226 Difference]: Without dead ends: 4141 [2025-03-04 03:59:18,963 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 03:59:18,964 INFO L435 NwaCegarLoop]: 800 mSDtfsCounter, 727 mSDsluCounter, 741 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 727 SdHoareTripleChecker+Valid, 1541 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 03:59:18,964 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [727 Valid, 1541 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 03:59:18,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4141 states. [2025-03-04 03:59:19,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4141 to 4128. [2025-03-04 03:59:19,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4128 states, 3322 states have (on average 1.3982540638169778) internal successors, (4645), 3331 states have internal predecessors, (4645), 571 states have call successors, (571), 235 states have call predecessors, (571), 234 states have return successors, (581), 569 states have call predecessors, (581), 569 states have call successors, (581) [2025-03-04 03:59:19,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4128 states to 4128 states and 5797 transitions. [2025-03-04 03:59:19,125 INFO L78 Accepts]: Start accepts. Automaton has 4128 states and 5797 transitions. Word has length 67 [2025-03-04 03:59:19,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:59:19,125 INFO L471 AbstractCegarLoop]: Abstraction has 4128 states and 5797 transitions. [2025-03-04 03:59:19,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-04 03:59:19,126 INFO L276 IsEmpty]: Start isEmpty. Operand 4128 states and 5797 transitions. [2025-03-04 03:59:19,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-04 03:59:19,128 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:59:19,128 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:59:19,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 03:59:19,129 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:59:19,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:59:19,129 INFO L85 PathProgramCache]: Analyzing trace with hash -1820862538, now seen corresponding path program 1 times [2025-03-04 03:59:19,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:59:19,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615261311] [2025-03-04 03:59:19,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:59:19,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:59:20,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-04 03:59:20,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-04 03:59:20,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:59:20,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:59:20,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 03:59:20,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:59:20,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615261311] [2025-03-04 03:59:20,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615261311] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:59:20,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 03:59:20,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 03:59:20,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716385474] [2025-03-04 03:59:20,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:59:20,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 03:59:20,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:59:20,220 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 03:59:20,221 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 03:59:20,221 INFO L87 Difference]: Start difference. First operand 4128 states and 5797 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-04 03:59:21,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:59:21,032 INFO L93 Difference]: Finished difference Result 10706 states and 15004 transitions. [2025-03-04 03:59:21,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 03:59:21,033 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 65 [2025-03-04 03:59:21,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:59:21,066 INFO L225 Difference]: With dead ends: 10706 [2025-03-04 03:59:21,066 INFO L226 Difference]: Without dead ends: 6611 [2025-03-04 03:59:21,083 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 03:59:21,083 INFO L435 NwaCegarLoop]: 1310 mSDtfsCounter, 738 mSDsluCounter, 741 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 738 SdHoareTripleChecker+Valid, 2051 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 03:59:21,083 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [738 Valid, 2051 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 03:59:21,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6611 states. [2025-03-04 03:59:21,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6611 to 6594. [2025-03-04 03:59:21,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6594 states, 5298 states have (on average 1.3961872404681013) internal successors, (7397), 5313 states have internal predecessors, (7397), 906 states have call successors, (906), 390 states have call predecessors, (906), 389 states have return successors, (920), 902 states have call predecessors, (920), 904 states have call successors, (920) [2025-03-04 03:59:21,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6594 states to 6594 states and 9223 transitions. [2025-03-04 03:59:21,442 INFO L78 Accepts]: Start accepts. Automaton has 6594 states and 9223 transitions. Word has length 65 [2025-03-04 03:59:21,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:59:21,443 INFO L471 AbstractCegarLoop]: Abstraction has 6594 states and 9223 transitions. [2025-03-04 03:59:21,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-04 03:59:21,443 INFO L276 IsEmpty]: Start isEmpty. Operand 6594 states and 9223 transitions. [2025-03-04 03:59:21,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-04 03:59:21,453 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:59:21,453 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 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] [2025-03-04 03:59:21,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 03:59:21,454 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:59:21,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:59:21,454 INFO L85 PathProgramCache]: Analyzing trace with hash -1035561547, now seen corresponding path program 1 times [2025-03-04 03:59:21,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:59:21,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720277793] [2025-03-04 03:59:21,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:59:21,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:59:22,439 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-04 03:59:22,484 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-04 03:59:22,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:59:22,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:59:22,693 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-04 03:59:22,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:59:22,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720277793] [2025-03-04 03:59:22,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720277793] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:59:22,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 03:59:22,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 03:59:22,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343050885] [2025-03-04 03:59:22,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:59:22,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 03:59:22,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:59:22,697 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 03:59:22,697 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 03:59:22,697 INFO L87 Difference]: Start difference. First operand 6594 states and 9223 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 3 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-04 03:59:26,738 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 03:59:27,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:59:27,577 INFO L93 Difference]: Finished difference Result 16888 states and 23652 transitions. [2025-03-04 03:59:27,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 03:59:27,577 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 3 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 124 [2025-03-04 03:59:27,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:59:27,629 INFO L225 Difference]: With dead ends: 16888 [2025-03-04 03:59:27,630 INFO L226 Difference]: Without dead ends: 10339 [2025-03-04 03:59:27,654 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 03:59:27,655 INFO L435 NwaCegarLoop]: 1053 mSDtfsCounter, 731 mSDsluCounter, 736 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 16 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 731 SdHoareTripleChecker+Valid, 1789 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2025-03-04 03:59:27,655 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [731 Valid, 1789 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 60 Invalid, 1 Unknown, 0 Unchecked, 4.6s Time] [2025-03-04 03:59:27,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10339 states. [2025-03-04 03:59:27,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10339 to 10326. [2025-03-04 03:59:27,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10326 states, 8358 states have (on average 1.394233070112467) internal successors, (11653), 8377 states have internal predecessors, (11653), 1362 states have call successors, (1362), 606 states have call predecessors, (1362), 605 states have return successors, (1380), 1358 states have call predecessors, (1380), 1360 states have call successors, (1380) [2025-03-04 03:59:28,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10326 states to 10326 states and 14395 transitions. [2025-03-04 03:59:28,032 INFO L78 Accepts]: Start accepts. Automaton has 10326 states and 14395 transitions. Word has length 124 [2025-03-04 03:59:28,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:59:28,032 INFO L471 AbstractCegarLoop]: Abstraction has 10326 states and 14395 transitions. [2025-03-04 03:59:28,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 3 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-04 03:59:28,033 INFO L276 IsEmpty]: Start isEmpty. Operand 10326 states and 14395 transitions. [2025-03-04 03:59:28,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-04 03:59:28,038 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:59:28,038 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 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] [2025-03-04 03:59:28,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 03:59:28,039 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:59:28,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:59:28,039 INFO L85 PathProgramCache]: Analyzing trace with hash -1488632156, now seen corresponding path program 1 times [2025-03-04 03:59:28,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:59:28,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846874571] [2025-03-04 03:59:28,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:59:28,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:59:28,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-04 03:59:28,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-04 03:59:28,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:59:28,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:59:29,344 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2025-03-04 03:59:29,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:59:29,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846874571] [2025-03-04 03:59:29,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846874571] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:59:29,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 03:59:29,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 03:59:29,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030748845] [2025-03-04 03:59:29,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:59:29,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 03:59:29,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:59:29,345 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 03:59:29,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 03:59:29,345 INFO L87 Difference]: Start difference. First operand 10326 states and 14395 transitions. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-04 03:59:33,365 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 03:59:37,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:59:37,657 INFO L93 Difference]: Finished difference Result 15467 states and 21607 transitions. [2025-03-04 03:59:37,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 03:59:37,658 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 123 [2025-03-04 03:59:37,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:59:37,732 INFO L225 Difference]: With dead ends: 15467 [2025-03-04 03:59:37,733 INFO L226 Difference]: Without dead ends: 15464 [2025-03-04 03:59:37,742 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 03:59:37,743 INFO L435 NwaCegarLoop]: 1544 mSDtfsCounter, 1508 mSDsluCounter, 1229 mSDsCounter, 0 mSdLazyCounter, 410 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1508 SdHoareTripleChecker+Valid, 2773 SdHoareTripleChecker+Invalid, 413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 410 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.9s IncrementalHoareTripleChecker+Time [2025-03-04 03:59:37,744 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1508 Valid, 2773 Invalid, 413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 410 Invalid, 1 Unknown, 0 Unchecked, 7.9s Time] [2025-03-04 03:59:37,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15464 states. [2025-03-04 03:59:38,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15464 to 15450. [2025-03-04 03:59:38,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15450 states, 12507 states have (on average 1.3951387223155034) internal successors, (17449), 12535 states have internal predecessors, (17449), 2038 states have call successors, (2038), 905 states have call predecessors, (2038), 904 states have return successors, (2096), 2033 states have call predecessors, (2096), 2036 states have call successors, (2096) [2025-03-04 03:59:38,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15450 states to 15450 states and 21583 transitions. [2025-03-04 03:59:38,227 INFO L78 Accepts]: Start accepts. Automaton has 15450 states and 21583 transitions. Word has length 123 [2025-03-04 03:59:38,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:59:38,227 INFO L471 AbstractCegarLoop]: Abstraction has 15450 states and 21583 transitions. [2025-03-04 03:59:38,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-04 03:59:38,228 INFO L276 IsEmpty]: Start isEmpty. Operand 15450 states and 21583 transitions. [2025-03-04 03:59:38,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-04 03:59:38,232 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:59:38,232 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 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] [2025-03-04 03:59:38,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 03:59:38,232 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:59:38,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:59:38,233 INFO L85 PathProgramCache]: Analyzing trace with hash 254178179, now seen corresponding path program 1 times [2025-03-04 03:59:38,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:59:38,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048042050] [2025-03-04 03:59:38,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:59:38,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:59:39,141 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-04 03:59:39,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-04 03:59:39,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:59:39,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:59:40,104 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2025-03-04 03:59:40,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:59:40,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048042050] [2025-03-04 03:59:40,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048042050] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:59:40,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 03:59:40,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 03:59:40,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107545514] [2025-03-04 03:59:40,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:59:40,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 03:59:40,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:59:40,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 03:59:40,106 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 03:59:40,106 INFO L87 Difference]: Start difference. First operand 15450 states and 21583 transitions. Second operand has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-04 03:59:41,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:59:41,422 INFO L93 Difference]: Finished difference Result 20736 states and 28962 transitions. [2025-03-04 03:59:41,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 03:59:41,423 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 123 [2025-03-04 03:59:41,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:59:41,477 INFO L225 Difference]: With dead ends: 20736 [2025-03-04 03:59:41,478 INFO L226 Difference]: Without dead ends: 15559 [2025-03-04 03:59:41,496 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 03:59:41,496 INFO L435 NwaCegarLoop]: 792 mSDtfsCounter, 1 mSDsluCounter, 3154 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 3946 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-04 03:59:41,497 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 3946 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-04 03:59:41,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15559 states. [2025-03-04 03:59:41,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15559 to 15529. [2025-03-04 03:59:42,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15529 states, 12586 states have (on average 1.3918639758461784) internal successors, (17518), 12614 states have internal predecessors, (17518), 2038 states have call successors, (2038), 905 states have call predecessors, (2038), 904 states have return successors, (2096), 2033 states have call predecessors, (2096), 2036 states have call successors, (2096) [2025-03-04 03:59:42,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15529 states to 15529 states and 21652 transitions. [2025-03-04 03:59:42,109 INFO L78 Accepts]: Start accepts. Automaton has 15529 states and 21652 transitions. Word has length 123 [2025-03-04 03:59:42,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:59:42,113 INFO L471 AbstractCegarLoop]: Abstraction has 15529 states and 21652 transitions. [2025-03-04 03:59:42,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-04 03:59:42,114 INFO L276 IsEmpty]: Start isEmpty. Operand 15529 states and 21652 transitions. [2025-03-04 03:59:42,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-04 03:59:42,140 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:59:42,141 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:59:42,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 03:59:42,141 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:59:42,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:59:42,142 INFO L85 PathProgramCache]: Analyzing trace with hash 1492537428, now seen corresponding path program 1 times [2025-03-04 03:59:42,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:59:42,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546294277] [2025-03-04 03:59:42,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:59:42,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:59:43,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-04 03:59:43,452 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-04 03:59:43,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:59:43,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:59:43,670 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-04 03:59:43,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:59:43,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546294277] [2025-03-04 03:59:43,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546294277] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:59:43,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 03:59:43,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 03:59:43,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045422652] [2025-03-04 03:59:43,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:59:43,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 03:59:43,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:59:43,672 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 03:59:43,672 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 03:59:43,672 INFO L87 Difference]: Start difference. First operand 15529 states and 21652 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 3 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-04 03:59:47,693 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 03:59:48,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:59:48,830 INFO L93 Difference]: Finished difference Result 39386 states and 54965 transitions. [2025-03-04 03:59:48,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 03:59:48,830 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 3 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 140 [2025-03-04 03:59:48,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:59:48,911 INFO L225 Difference]: With dead ends: 39386 [2025-03-04 03:59:48,912 INFO L226 Difference]: Without dead ends: 23902 [2025-03-04 03:59:48,946 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 03:59:48,947 INFO L435 NwaCegarLoop]: 1011 mSDtfsCounter, 739 mSDsluCounter, 746 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 16 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 739 SdHoareTripleChecker+Valid, 1757 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2025-03-04 03:59:48,947 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [739 Valid, 1757 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 58 Invalid, 1 Unknown, 0 Unchecked, 4.6s Time] [2025-03-04 03:59:48,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23902 states. [2025-03-04 03:59:49,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23902 to 23884. [2025-03-04 03:59:49,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23884 states, 19459 states have (on average 1.389280024667249) internal successors, (27034), 19496 states have internal predecessors, (27034), 3040 states have call successors, (3040), 1385 states have call predecessors, (3040), 1384 states have return successors, (3110), 3032 states have call predecessors, (3110), 3038 states have call successors, (3110) [2025-03-04 03:59:50,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23884 states to 23884 states and 33184 transitions. [2025-03-04 03:59:50,029 INFO L78 Accepts]: Start accepts. Automaton has 23884 states and 33184 transitions. Word has length 140 [2025-03-04 03:59:50,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:59:50,030 INFO L471 AbstractCegarLoop]: Abstraction has 23884 states and 33184 transitions. [2025-03-04 03:59:50,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 3 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-04 03:59:50,030 INFO L276 IsEmpty]: Start isEmpty. Operand 23884 states and 33184 transitions. [2025-03-04 03:59:50,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-04 03:59:50,041 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:59:50,041 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:59:50,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 03:59:50,042 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:59:50,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:59:50,042 INFO L85 PathProgramCache]: Analyzing trace with hash 1076728502, now seen corresponding path program 1 times [2025-03-04 03:59:50,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:59:50,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502850540] [2025-03-04 03:59:50,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:59:50,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:59:51,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-04 03:59:51,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-04 03:59:51,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:59:51,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:59:52,230 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2025-03-04 03:59:52,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:59:52,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502850540] [2025-03-04 03:59:52,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502850540] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:59:52,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 03:59:52,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 03:59:52,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692196743] [2025-03-04 03:59:52,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:59:52,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 03:59:52,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:59:52,232 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 03:59:52,232 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 03:59:52,233 INFO L87 Difference]: Start difference. First operand 23884 states and 33184 transitions. Second operand has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 03:59:53,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:59:53,744 INFO L93 Difference]: Finished difference Result 32009 states and 44445 transitions. [2025-03-04 03:59:53,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 03:59:53,745 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) Word has length 140 [2025-03-04 03:59:53,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:59:53,805 INFO L225 Difference]: With dead ends: 32009 [2025-03-04 03:59:53,805 INFO L226 Difference]: Without dead ends: 16043 [2025-03-04 03:59:53,839 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-04 03:59:53,841 INFO L435 NwaCegarLoop]: 790 mSDtfsCounter, 43 mSDsluCounter, 3110 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 3900 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-04 03:59:53,841 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 3900 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-04 03:59:53,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16043 states. [2025-03-04 03:59:54,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16043 to 16011. [2025-03-04 03:59:54,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16011 states, 13055 states have (on average 1.3852163921869016) internal successors, (18084), 13080 states have internal predecessors, (18084), 2030 states have call successors, (2030), 926 states have call predecessors, (2030), 925 states have return successors, (2052), 2024 states have call predecessors, (2052), 2028 states have call successors, (2052) [2025-03-04 03:59:54,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16011 states to 16011 states and 22166 transitions. [2025-03-04 03:59:54,417 INFO L78 Accepts]: Start accepts. Automaton has 16011 states and 22166 transitions. Word has length 140 [2025-03-04 03:59:54,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:59:54,418 INFO L471 AbstractCegarLoop]: Abstraction has 16011 states and 22166 transitions. [2025-03-04 03:59:54,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 03:59:54,419 INFO L276 IsEmpty]: Start isEmpty. Operand 16011 states and 22166 transitions. [2025-03-04 03:59:54,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-04 03:59:54,430 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:59:54,430 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:59:54,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 03:59:54,431 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:59:54,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:59:54,432 INFO L85 PathProgramCache]: Analyzing trace with hash -1553766664, now seen corresponding path program 1 times [2025-03-04 03:59:54,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:59:54,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255442271] [2025-03-04 03:59:54,432 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:59:54,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:59:55,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-04 03:59:55,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-04 03:59:55,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:59:55,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:59:55,867 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2025-03-04 03:59:55,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:59:55,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255442271] [2025-03-04 03:59:55,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255442271] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:59:55,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 03:59:55,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 03:59:55,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789666306] [2025-03-04 03:59:55,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:59:55,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 03:59:55,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:59:55,868 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 03:59:55,868 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 03:59:55,868 INFO L87 Difference]: Start difference. First operand 16011 states and 22166 transitions. Second operand has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-04 03:59:56,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:59:56,820 INFO L93 Difference]: Finished difference Result 31993 states and 44301 transitions. [2025-03-04 03:59:56,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 03:59:56,821 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 144 [2025-03-04 03:59:56,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:59:56,875 INFO L225 Difference]: With dead ends: 31993 [2025-03-04 03:59:56,876 INFO L226 Difference]: Without dead ends: 16012 [2025-03-04 03:59:56,905 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 03:59:56,906 INFO L435 NwaCegarLoop]: 793 mSDtfsCounter, 0 mSDsluCounter, 1584 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2377 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 03:59:56,906 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2377 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 03:59:56,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16012 states. [2025-03-04 03:59:57,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16012 to 16012. [2025-03-04 03:59:57,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16012 states, 13056 states have (on average 1.385186887254902) internal successors, (18085), 13081 states have internal predecessors, (18085), 2030 states have call successors, (2030), 926 states have call predecessors, (2030), 925 states have return successors, (2052), 2024 states have call predecessors, (2052), 2028 states have call successors, (2052) [2025-03-04 03:59:57,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16012 states to 16012 states and 22167 transitions. [2025-03-04 03:59:57,651 INFO L78 Accepts]: Start accepts. Automaton has 16012 states and 22167 transitions. Word has length 144 [2025-03-04 03:59:57,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:59:57,651 INFO L471 AbstractCegarLoop]: Abstraction has 16012 states and 22167 transitions. [2025-03-04 03:59:57,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-04 03:59:57,652 INFO L276 IsEmpty]: Start isEmpty. Operand 16012 states and 22167 transitions. [2025-03-04 03:59:57,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-04 03:59:57,662 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:59:57,662 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:59:57,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 03:59:57,662 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:59:57,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:59:57,663 INFO L85 PathProgramCache]: Analyzing trace with hash -1099426676, now seen corresponding path program 1 times [2025-03-04 03:59:57,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:59:57,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950381512] [2025-03-04 03:59:57,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:59:57,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:59:59,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-04 03:59:59,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-04 03:59:59,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:59:59,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:59:59,781 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2025-03-04 03:59:59,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:59:59,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950381512] [2025-03-04 03:59:59,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950381512] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 03:59:59,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [297267364] [2025-03-04 03:59:59,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:59:59,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 03:59:59,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 03:59:59,784 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 03:59:59,786 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:00:01,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-04 04:00:01,625 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-04 04:00:01,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:00:01,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:00:01,636 INFO L256 TraceCheckSpWp]: Trace formula consists of 2214 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 04:00:01,645 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 04:00:04,691 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2025-03-04 04:00:04,691 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 04:00:04,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [297267364] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:00:04,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 04:00:04,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [5] total 11 [2025-03-04 04:00:04,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801570160] [2025-03-04 04:00:04,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:00:04,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 04:00:04,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:00:04,693 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 04:00:04,693 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-03-04 04:00:04,693 INFO L87 Difference]: Start difference. First operand 16012 states and 22167 transitions. Second operand has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 states have internal predecessors, (94), 3 states have call successors, (15), 4 states have call predecessors, (15), 3 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-04 04:00:08,714 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers []