./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 e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-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-?-e2fb8be-m [2025-03-08 19:10:26,797 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 19:10:26,858 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-08 19:10:26,863 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 19:10:26,867 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 19:10:26,888 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 19:10:26,890 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 19:10:26,890 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 19:10:26,890 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 19:10:26,891 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 19:10:26,891 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 19:10:26,891 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 19:10:26,891 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 19:10:26,892 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 19:10:26,892 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 19:10:26,892 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 19:10:26,892 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 19:10:26,892 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 19:10:26,893 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 19:10:26,893 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 19:10:26,893 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 19:10:26,893 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 19:10:26,893 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 19:10:26,893 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 19:10:26,893 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 19:10:26,893 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 19:10:26,893 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 19:10:26,893 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 19:10:26,893 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 19:10:26,893 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 19:10:26,894 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 19:10:26,894 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 19:10:26,894 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 19:10:26,894 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 19:10:26,894 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 19:10:26,894 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 19:10:26,894 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 19:10:26,894 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 19:10:26,894 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 19:10:26,895 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 19:10:26,895 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-08 19:10:27,122 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 19:10:27,128 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 19:10:27,130 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 19:10:27,132 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 19:10:27,132 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 19:10:27,133 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-08 19:10:28,282 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e0f104bf6/a02752a292424a04acef5a00bacb4176/FLAG0f608d017 [2025-03-08 19:10:28,785 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 19:10:28,788 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-08 19:10:28,823 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e0f104bf6/a02752a292424a04acef5a00bacb4176/FLAG0f608d017 [2025-03-08 19:10:28,865 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e0f104bf6/a02752a292424a04acef5a00bacb4176 [2025-03-08 19:10:28,867 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 19:10:28,868 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 19:10:28,870 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 19:10:28,870 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 19:10:28,873 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 19:10:28,874 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 07:10:28" (1/1) ... [2025-03-08 19:10:28,875 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f332e7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:10:28, skipping insertion in model container [2025-03-08 19:10:28,875 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 07:10:28" (1/1) ... [2025-03-08 19:10:28,947 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 19:10:29,533 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-08 19:10:29,884 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 19:10:29,907 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 19:10:30,015 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-08 19:10:30,018 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-08 19:10:30,019 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile (".pushsection .smp_locks,\"a\"\n.balign 4\n.long 671f - .\n.popsection\n671:\n\tlock; xaddw %w0, %1\n": "+r" (__ret), "+m" (v->counter): : "memory", "cc"); [5512-5513] [2025-03-08 19:10:30,019 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile (".pushsection .smp_locks,\"a\"\n.balign 4\n.long 671f - .\n.popsection\n671:\n\tlock; xaddl %0, %1\n": "+r" (__ret), "+m" (v->counter): : "memory", "cc"); [5516-5517] [2025-03-08 19:10:30,019 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile (".pushsection .smp_locks,\"a\"\n.balign 4\n.long 671f - .\n.popsection\n671:\n\tlock; xaddq %q0, %1\n": "+r" (__ret), "+m" (v->counter): : "memory", "cc"); [5520-5521] [2025-03-08 19:10:30,024 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-08 19:10:30,103 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 19:10:30,133 INFO L204 MainTranslator]: Completed translation [2025-03-08 19:10:30,133 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:10:30 WrapperNode [2025-03-08 19:10:30,134 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 19:10:30,135 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 19:10:30,135 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 19:10:30,135 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 19:10:30,139 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:10:30" (1/1) ... [2025-03-08 19:10:30,166 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:10:30" (1/1) ... [2025-03-08 19:10:30,229 INFO L138 Inliner]: procedures = 138, calls = 566, calls flagged for inlining = 62, calls inlined = 62, statements flattened = 1911 [2025-03-08 19:10:30,231 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 19:10:30,232 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 19:10:30,232 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 19:10:30,232 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 19:10:30,238 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:10:30" (1/1) ... [2025-03-08 19:10:30,238 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:10:30" (1/1) ... [2025-03-08 19:10:30,254 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:10:30" (1/1) ... [2025-03-08 19:10:30,404 INFO L175 MemorySlicer]: Split 326 memory accesses to 17 slices as follows [2, 3, 5, 14, 7, 8, 2, 124, 3, 19, 19, 44, 3, 8, 2, 10, 53]. 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, 4, 12, 6, 4, 1, 33, 1, 19, 19, 44, 1, 0, 1, 0, 53]. [2025-03-08 19:10:30,405 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:10:30" (1/1) ... [2025-03-08 19:10:30,406 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:10:30" (1/1) ... [2025-03-08 19:10:30,468 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:10:30" (1/1) ... [2025-03-08 19:10:30,472 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:10:30" (1/1) ... [2025-03-08 19:10:30,491 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:10:30" (1/1) ... [2025-03-08 19:10:30,501 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:10:30" (1/1) ... [2025-03-08 19:10:30,520 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 19:10:30,520 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 19:10:30,521 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 19:10:30,521 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 19:10:30,521 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:10:30" (1/1) ... [2025-03-08 19:10:30,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 19:10:30,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 19:10:30,545 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 19:10:30,548 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 19:10:30,566 INFO L130 BoogieDeclarations]: Found specification of procedure usbnet_resume [2025-03-08 19:10:30,566 INFO L138 BoogieDeclarations]: Found implementation of procedure usbnet_resume [2025-03-08 19:10:30,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-03-08 19:10:30,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-03-08 19:10:30,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-03-08 19:10:30,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-03-08 19:10:30,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-03-08 19:10:30,567 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-03-08 19:10:30,567 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2025-03-08 19:10:30,567 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2025-03-08 19:10:30,567 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#8 [2025-03-08 19:10:30,567 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#9 [2025-03-08 19:10:30,567 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#10 [2025-03-08 19:10:30,567 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#11 [2025-03-08 19:10:30,567 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#12 [2025-03-08 19:10:30,567 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#13 [2025-03-08 19:10:30,568 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#14 [2025-03-08 19:10:30,568 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#15 [2025-03-08 19:10:30,568 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#16 [2025-03-08 19:10:30,568 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#0 [2025-03-08 19:10:30,568 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#1 [2025-03-08 19:10:30,568 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#2 [2025-03-08 19:10:30,568 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#3 [2025-03-08 19:10:30,568 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#4 [2025-03-08 19:10:30,569 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#5 [2025-03-08 19:10:30,569 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#6 [2025-03-08 19:10:30,569 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#7 [2025-03-08 19:10:30,569 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#8 [2025-03-08 19:10:30,569 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#9 [2025-03-08 19:10:30,569 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#10 [2025-03-08 19:10:30,569 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#11 [2025-03-08 19:10:30,569 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#12 [2025-03-08 19:10:30,569 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#13 [2025-03-08 19:10:30,569 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#14 [2025-03-08 19:10:30,569 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#15 [2025-03-08 19:10:30,569 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#16 [2025-03-08 19:10:30,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-03-08 19:10:30,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-03-08 19:10:30,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-03-08 19:10:30,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-03-08 19:10:30,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-03-08 19:10:30,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2025-03-08 19:10:30,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2025-03-08 19:10:30,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#7 [2025-03-08 19:10:30,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#8 [2025-03-08 19:10:30,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#9 [2025-03-08 19:10:30,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#10 [2025-03-08 19:10:30,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#11 [2025-03-08 19:10:30,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#12 [2025-03-08 19:10:30,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#13 [2025-03-08 19:10:30,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#14 [2025-03-08 19:10:30,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#15 [2025-03-08 19:10:30,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#16 [2025-03-08 19:10:30,570 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2025-03-08 19:10:30,570 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2025-03-08 19:10:30,570 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 19:10:30,570 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 19:10:30,570 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-08 19:10:30,570 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-08 19:10:30,570 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-08 19:10:30,570 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-08 19:10:30,570 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-08 19:10:30,570 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-08 19:10:30,570 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-03-08 19:10:30,570 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-03-08 19:10:30,570 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-03-08 19:10:30,570 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-03-08 19:10:30,570 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-03-08 19:10:30,570 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-03-08 19:10:30,570 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-03-08 19:10:30,570 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2025-03-08 19:10:30,570 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2025-03-08 19:10:30,570 INFO L130 BoogieDeclarations]: Found specification of procedure skb_headroom [2025-03-08 19:10:30,570 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_headroom [2025-03-08 19:10:30,570 INFO L130 BoogieDeclarations]: Found specification of procedure usbnet_disconnect [2025-03-08 19:10:30,570 INFO L138 BoogieDeclarations]: Found implementation of procedure usbnet_disconnect [2025-03-08 19:10:30,570 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#0 [2025-03-08 19:10:30,570 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#1 [2025-03-08 19:10:30,570 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#2 [2025-03-08 19:10:30,570 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#3 [2025-03-08 19:10:30,570 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#4 [2025-03-08 19:10:30,570 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#5 [2025-03-08 19:10:30,570 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#6 [2025-03-08 19:10:30,570 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#7 [2025-03-08 19:10:30,570 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#8 [2025-03-08 19:10:30,570 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#9 [2025-03-08 19:10:30,571 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#10 [2025-03-08 19:10:30,571 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#11 [2025-03-08 19:10:30,571 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#12 [2025-03-08 19:10:30,571 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#13 [2025-03-08 19:10:30,571 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#14 [2025-03-08 19:10:30,571 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#15 [2025-03-08 19:10:30,571 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#16 [2025-03-08 19:10:30,571 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#0 [2025-03-08 19:10:30,571 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#1 [2025-03-08 19:10:30,571 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#2 [2025-03-08 19:10:30,573 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#3 [2025-03-08 19:10:30,573 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#4 [2025-03-08 19:10:30,573 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#5 [2025-03-08 19:10:30,573 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#6 [2025-03-08 19:10:30,573 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#7 [2025-03-08 19:10:30,573 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#8 [2025-03-08 19:10:30,573 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#9 [2025-03-08 19:10:30,574 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#10 [2025-03-08 19:10:30,574 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#11 [2025-03-08 19:10:30,574 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#12 [2025-03-08 19:10:30,574 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#13 [2025-03-08 19:10:30,574 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#14 [2025-03-08 19:10:30,575 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#15 [2025-03-08 19:10:30,575 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#16 [2025-03-08 19:10:30,575 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2025-03-08 19:10:30,575 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2025-03-08 19:10:30,575 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~~pm_message_t~0~TO~int [2025-03-08 19:10:30,575 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~~pm_message_t~0~TO~int [2025-03-08 19:10:30,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 19:10:30,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 19:10:30,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-08 19:10:30,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-08 19:10:30,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-08 19:10:30,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-08 19:10:30,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-08 19:10:30,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-08 19:10:30,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-03-08 19:10:30,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-03-08 19:10:30,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-03-08 19:10:30,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-03-08 19:10:30,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-03-08 19:10:30,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-03-08 19:10:30,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-03-08 19:10:30,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2025-03-08 19:10:30,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2025-03-08 19:10:30,575 INFO L130 BoogieDeclarations]: Found specification of procedure cdc_mbim_suspend [2025-03-08 19:10:30,575 INFO L138 BoogieDeclarations]: Found implementation of procedure cdc_mbim_suspend [2025-03-08 19:10:30,575 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2025-03-08 19:10:30,575 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2025-03-08 19:10:30,575 INFO L130 BoogieDeclarations]: Found specification of procedure cdc_mbim_resume [2025-03-08 19:10:30,575 INFO L138 BoogieDeclarations]: Found implementation of procedure cdc_mbim_resume [2025-03-08 19:10:30,576 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2025-03-08 19:10:30,576 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2025-03-08 19:10:30,576 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_read [2025-03-08 19:10:30,576 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_read [2025-03-08 19:10:30,576 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-03-08 19:10:30,576 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-03-08 19:10:30,576 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-03-08 19:10:30,576 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#3 [2025-03-08 19:10:30,576 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#4 [2025-03-08 19:10:30,576 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#5 [2025-03-08 19:10:30,576 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#6 [2025-03-08 19:10:30,576 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#7 [2025-03-08 19:10:30,576 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#8 [2025-03-08 19:10:30,576 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#9 [2025-03-08 19:10:30,576 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#10 [2025-03-08 19:10:30,576 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#11 [2025-03-08 19:10:30,576 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#12 [2025-03-08 19:10:30,576 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#13 [2025-03-08 19:10:30,576 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#14 [2025-03-08 19:10:30,576 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#15 [2025-03-08 19:10:30,576 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#16 [2025-03-08 19:10:30,576 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-03-08 19:10:30,576 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-03-08 19:10:30,576 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-03-08 19:10:30,576 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#3 [2025-03-08 19:10:30,576 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#4 [2025-03-08 19:10:30,576 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#5 [2025-03-08 19:10:30,576 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#6 [2025-03-08 19:10:30,576 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#7 [2025-03-08 19:10:30,576 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#8 [2025-03-08 19:10:30,576 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#9 [2025-03-08 19:10:30,576 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#10 [2025-03-08 19:10:30,576 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#11 [2025-03-08 19:10:30,576 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#12 [2025-03-08 19:10:30,576 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#13 [2025-03-08 19:10:30,576 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#14 [2025-03-08 19:10:30,576 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#15 [2025-03-08 19:10:30,576 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#16 [2025-03-08 19:10:30,577 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 19:10:30,577 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 19:10:30,577 INFO L130 BoogieDeclarations]: Found specification of procedure cdc_mbim_tx_fixup [2025-03-08 19:10:30,577 INFO L138 BoogieDeclarations]: Found implementation of procedure cdc_mbim_tx_fixup [2025-03-08 19:10:30,577 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-08 19:10:30,577 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop___0 [2025-03-08 19:10:30,577 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop___0 [2025-03-08 19:10:30,577 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_get_intfdata_4 [2025-03-08 19:10:30,579 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_get_intfdata_4 [2025-03-08 19:10:30,580 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 19:10:30,580 INFO L130 BoogieDeclarations]: Found specification of procedure __dynamic_netdev_dbg [2025-03-08 19:10:30,580 INFO L138 BoogieDeclarations]: Found implementation of procedure __dynamic_netdev_dbg [2025-03-08 19:10:30,580 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2025-03-08 19:10:30,580 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2025-03-08 19:10:30,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-08 19:10:30,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-08 19:10:30,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-08 19:10:30,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-08 19:10:30,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-03-08 19:10:30,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-03-08 19:10:30,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-03-08 19:10:30,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-03-08 19:10:30,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-03-08 19:10:30,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-03-08 19:10:30,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-03-08 19:10:30,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-03-08 19:10:30,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-03-08 19:10:30,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-03-08 19:10:30,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2025-03-08 19:10:30,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#15 [2025-03-08 19:10:30,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#16 [2025-03-08 19:10:30,582 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-08 19:10:30,582 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2025-03-08 19:10:30,582 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2025-03-08 19:10:30,582 INFO L130 BoogieDeclarations]: Found specification of procedure cdc_mbim_bind [2025-03-08 19:10:30,582 INFO L138 BoogieDeclarations]: Found implementation of procedure cdc_mbim_bind [2025-03-08 19:10:30,582 INFO L130 BoogieDeclarations]: Found specification of procedure cdc_mbim_manage_power [2025-03-08 19:10:30,582 INFO L138 BoogieDeclarations]: Found implementation of procedure cdc_mbim_manage_power [2025-03-08 19:10:30,582 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~int [2025-03-08 19:10:30,582 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~int [2025-03-08 19:10:30,582 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-08 19:10:30,582 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-08 19:10:30,582 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-08 19:10:30,582 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-08 19:10:30,582 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-03-08 19:10:30,582 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-03-08 19:10:30,582 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-03-08 19:10:30,582 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-03-08 19:10:30,582 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-03-08 19:10:30,582 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-03-08 19:10:30,582 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-03-08 19:10:30,582 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-03-08 19:10:30,582 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-03-08 19:10:30,582 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-03-08 19:10:30,582 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2025-03-08 19:10:30,582 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#15 [2025-03-08 19:10:30,582 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#16 [2025-03-08 19:10:30,582 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 19:10:30,582 INFO L130 BoogieDeclarations]: Found specification of procedure skb_put [2025-03-08 19:10:30,582 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_put [2025-03-08 19:10:30,582 INFO L130 BoogieDeclarations]: Found specification of procedure cdc_mbim_rx_fixup [2025-03-08 19:10:30,582 INFO L138 BoogieDeclarations]: Found implementation of procedure cdc_mbim_rx_fixup [2025-03-08 19:10:30,582 INFO L130 BoogieDeclarations]: Found specification of procedure __fswab16 [2025-03-08 19:10:30,582 INFO L138 BoogieDeclarations]: Found implementation of procedure __fswab16 [2025-03-08 19:10:30,582 INFO L130 BoogieDeclarations]: Found specification of procedure cdc_ncm_unbind [2025-03-08 19:10:30,582 INFO L138 BoogieDeclarations]: Found implementation of procedure cdc_ncm_unbind [2025-03-08 19:10:30,582 INFO L130 BoogieDeclarations]: Found specification of procedure cdc_mbim_unbind [2025-03-08 19:10:30,582 INFO L138 BoogieDeclarations]: Found implementation of procedure cdc_mbim_unbind [2025-03-08 19:10:30,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 19:10:30,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 19:10:30,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 19:10:30,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-08 19:10:30,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-08 19:10:30,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-08 19:10:30,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-08 19:10:30,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-08 19:10:30,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-08 19:10:30,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-08 19:10:30,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-08 19:10:30,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-08 19:10:30,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-08 19:10:30,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-03-08 19:10:30,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-03-08 19:10:30,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-03-08 19:10:30,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-03-08 19:10:30,583 INFO L130 BoogieDeclarations]: Found specification of procedure skb_reset_mac_header [2025-03-08 19:10:30,583 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_reset_mac_header [2025-03-08 19:10:30,583 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#0 [2025-03-08 19:10:30,583 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#1 [2025-03-08 19:10:30,583 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#2 [2025-03-08 19:10:30,583 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#3 [2025-03-08 19:10:30,583 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#4 [2025-03-08 19:10:30,585 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#5 [2025-03-08 19:10:30,585 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#6 [2025-03-08 19:10:30,585 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#7 [2025-03-08 19:10:30,585 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#8 [2025-03-08 19:10:30,585 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#9 [2025-03-08 19:10:30,585 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#10 [2025-03-08 19:10:30,585 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#11 [2025-03-08 19:10:30,585 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#12 [2025-03-08 19:10:30,585 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#13 [2025-03-08 19:10:30,585 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#14 [2025-03-08 19:10:30,585 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#15 [2025-03-08 19:10:30,585 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#16 [2025-03-08 19:10:30,585 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2025-03-08 19:10:30,585 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2025-03-08 19:10:30,585 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 19:10:30,585 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 19:10:30,585 INFO L130 BoogieDeclarations]: Found specification of procedure eth_hdr [2025-03-08 19:10:30,585 INFO L138 BoogieDeclarations]: Found implementation of procedure eth_hdr [2025-03-08 19:10:30,585 INFO L130 BoogieDeclarations]: Found specification of procedure IS_ERR [2025-03-08 19:10:30,586 INFO L138 BoogieDeclarations]: Found implementation of procedure IS_ERR [2025-03-08 19:10:31,037 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 19:10:31,040 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 19:10:31,521 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2025-03-08 19:10:31,586 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7163: havoc usbnet_suspend_#t~nondet375#1; [2025-03-08 19:10:31,587 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6317: call ULTIMATE.dealloc(~#message#1.base, ~#message#1.offset);havoc ~#message#1.base, ~#message#1.offset; [2025-03-08 19:10:31,591 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5489: havoc #t~mem18; [2025-03-08 19:10:31,730 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stop___0FINAL: assume true; [2025-03-08 19:10:31,913 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7069: havoc #t~nondet355; [2025-03-08 19:10:32,344 INFO L1307 $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-08 19:10:32,345 INFO L1307 $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-08 19:10:32,345 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7124: havoc pskb_expand_head_#t~nondet365#1; [2025-03-08 19:10:32,345 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7096: havoc cdc_ncm_rx_verify_ndp16_#t~nondet361#1; [2025-03-08 19:10:32,345 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7130: havoc skb_push_#t~ret367#1.base, skb_push_#t~ret367#1.offset; [2025-03-08 19:10:32,345 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7100: havoc cdc_ncm_rx_verify_nth16_#t~nondet362#1; [2025-03-08 19:10:32,377 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5457: havoc #t~bitwise10; [2025-03-08 19:10:32,406 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7156: havoc #t~nondet374; [2025-03-08 19:10:32,410 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5693: havoc #t~mem50.base, #t~mem50.offset;havoc #t~mem51.base, #t~mem51.offset; [2025-03-08 19:10:32,490 INFO L1307 $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-08 19:10:32,661 INFO L1307 $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-08 19:10:32,662 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7127: havoc skb_pull_#t~ret366#1.base, skb_pull_#t~ret366#1.offset; [2025-03-08 19:10:32,662 INFO L1307 $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-08 19:10:32,662 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7120: havoc netdev_err_#t~nondet364#1; [2025-03-08 19:10:32,718 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7104: havoc cdc_ncm_select_altsetting_#t~nondet363#1; [2025-03-08 19:10:32,719 INFO L1307 $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-08 19:10:32,719 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7089: havoc cdc_ncm_bind_common_#t~nondet359#1; [2025-03-08 19:10:32,774 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7065: havoc __dynamic_dev_dbg_#t~nondet354#1; [2025-03-08 19:10:32,774 INFO L1307 $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-08 19:10:37,975 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7145: havoc usb_register_driver_#t~nondet372#1; [2025-03-08 19:10:37,975 INFO L1307 $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-08 19:10:37,975 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7152: havoc usbnet_probe_#t~nondet373#1; [2025-03-08 19:10:38,011 INFO L1307 $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-08 19:10:38,345 INFO L? ?]: Removed 1202 outVars from TransFormulas that were not future-live. [2025-03-08 19:10:38,345 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 19:10:38,381 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 19:10:38,384 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 19:10:38,385 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 07:10:38 BoogieIcfgContainer [2025-03-08 19:10:38,385 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 19:10:38,387 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 19:10:38,388 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 19:10:38,391 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 19:10:38,391 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 07:10:28" (1/3) ... [2025-03-08 19:10:38,392 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37b725b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 07:10:38, skipping insertion in model container [2025-03-08 19:10:38,392 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:10:30" (2/3) ... [2025-03-08 19:10:38,393 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37b725b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 07:10:38, skipping insertion in model container [2025-03-08 19:10:38,393 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 07:10:38" (3/3) ... [2025-03-08 19:10:38,393 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-08 19:10:38,404 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 19:10:38,407 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-08 19:10:38,466 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 19:10:38,476 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;@25cd3a00, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 19:10:38,477 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 19:10:38,483 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-08 19:10:38,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-08 19:10:38,491 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:10:38,492 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-08 19:10:38,493 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:10:38,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:10:38,498 INFO L85 PathProgramCache]: Analyzing trace with hash -1529253265, now seen corresponding path program 1 times [2025-03-08 19:10:38,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:10:38,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169201235] [2025-03-08 19:10:38,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:10:38,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:10:39,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-08 19:10:39,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-08 19:10:39,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:10:39,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:10:40,285 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-08 19:10:40,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:10:40,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169201235] [2025-03-08 19:10:40,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169201235] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:10:40,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:10:40,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 19:10:40,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136628019] [2025-03-08 19:10:40,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:10:40,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 19:10:40,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:10:40,307 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 19:10:40,308 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:10:40,311 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-08 19:10:44,344 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-08 19:10:44,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:10:44,868 INFO L93 Difference]: Finished difference Result 1728 states and 2514 transitions. [2025-03-08 19:10:44,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 19:10:44,871 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-08 19:10:44,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:10:44,885 INFO L225 Difference]: With dead ends: 1728 [2025-03-08 19:10:44,885 INFO L226 Difference]: Without dead ends: 1112 [2025-03-08 19:10:44,893 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:10:44,894 INFO L435 NwaCegarLoop]: 843 mSDtfsCounter, 758 mSDsluCounter, 803 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s 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.4s IncrementalHoareTripleChecker+Time [2025-03-08 19:10:44,895 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.4s Time] [2025-03-08 19:10:44,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1112 states. [2025-03-08 19:10:44,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1112 to 1109. [2025-03-08 19:10:44,974 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-08 19:10:44,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1109 states to 1109 states and 1559 transitions. [2025-03-08 19:10:44,984 INFO L78 Accepts]: Start accepts. Automaton has 1109 states and 1559 transitions. Word has length 40 [2025-03-08 19:10:44,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:10:44,985 INFO L471 AbstractCegarLoop]: Abstraction has 1109 states and 1559 transitions. [2025-03-08 19:10:44,985 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-08 19:10:44,985 INFO L276 IsEmpty]: Start isEmpty. Operand 1109 states and 1559 transitions. [2025-03-08 19:10:44,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-08 19:10:44,989 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:10:44,989 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-08 19:10:44,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 19:10:44,990 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:10:44,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:10:44,990 INFO L85 PathProgramCache]: Analyzing trace with hash -1404530333, now seen corresponding path program 1 times [2025-03-08 19:10:44,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:10:44,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207181747] [2025-03-08 19:10:44,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:10:44,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:10:45,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-08 19:10:45,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-08 19:10:45,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:10:45,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:10:46,544 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-08 19:10:46,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:10:46,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207181747] [2025-03-08 19:10:46,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207181747] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:10:46,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:10:46,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 19:10:46,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156676996] [2025-03-08 19:10:46,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:10:46,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 19:10:46,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:10:46,550 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 19:10:46,550 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:10:46,550 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-08 19:10:46,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:10:46,739 INFO L93 Difference]: Finished difference Result 1111 states and 1560 transitions. [2025-03-08 19:10:46,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 19:10:46,739 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-08 19:10:46,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:10:46,746 INFO L225 Difference]: With dead ends: 1111 [2025-03-08 19:10:46,746 INFO L226 Difference]: Without dead ends: 1108 [2025-03-08 19:10:46,747 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:10:46,748 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-08 19:10:46,748 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-08 19:10:46,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1108 states. [2025-03-08 19:10:46,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1108 to 1108. [2025-03-08 19:10:46,796 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-08 19:10:46,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1108 states to 1108 states and 1557 transitions. [2025-03-08 19:10:46,805 INFO L78 Accepts]: Start accepts. Automaton has 1108 states and 1557 transitions. Word has length 50 [2025-03-08 19:10:46,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:10:46,806 INFO L471 AbstractCegarLoop]: Abstraction has 1108 states and 1557 transitions. [2025-03-08 19:10:46,806 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-08 19:10:46,806 INFO L276 IsEmpty]: Start isEmpty. Operand 1108 states and 1557 transitions. [2025-03-08 19:10:46,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-08 19:10:46,810 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:10:46,810 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-08 19:10:46,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 19:10:46,810 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:10:46,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:10:46,812 INFO L85 PathProgramCache]: Analyzing trace with hash -591163270, now seen corresponding path program 1 times [2025-03-08 19:10:46,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:10:46,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624887442] [2025-03-08 19:10:46,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:10:46,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:10:47,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-08 19:10:47,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-08 19:10:47,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:10:47,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:10:48,395 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-08 19:10:48,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:10:48,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624887442] [2025-03-08 19:10:48,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624887442] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:10:48,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:10:48,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 19:10:48,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767146547] [2025-03-08 19:10:48,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:10:48,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 19:10:48,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:10:48,396 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 19:10:48,396 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:10:48,396 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-08 19:10:48,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:10:48,591 INFO L93 Difference]: Finished difference Result 1110 states and 1558 transitions. [2025-03-08 19:10:48,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 19:10:48,592 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-08 19:10:48,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:10:48,599 INFO L225 Difference]: With dead ends: 1110 [2025-03-08 19:10:48,600 INFO L226 Difference]: Without dead ends: 1107 [2025-03-08 19:10:48,600 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-08 19:10:48,603 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-08 19:10:48,604 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-08 19:10:48,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1107 states. [2025-03-08 19:10:48,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1107 to 1107. [2025-03-08 19:10:48,663 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-08 19:10:48,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1107 states to 1107 states and 1555 transitions. [2025-03-08 19:10:48,671 INFO L78 Accepts]: Start accepts. Automaton has 1107 states and 1555 transitions. Word has length 51 [2025-03-08 19:10:48,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:10:48,672 INFO L471 AbstractCegarLoop]: Abstraction has 1107 states and 1555 transitions. [2025-03-08 19:10:48,672 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-08 19:10:48,672 INFO L276 IsEmpty]: Start isEmpty. Operand 1107 states and 1555 transitions. [2025-03-08 19:10:48,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-08 19:10:48,677 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:10:48,677 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-08 19:10:48,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 19:10:48,678 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:10:48,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:10:48,679 INFO L85 PathProgramCache]: Analyzing trace with hash -1146589116, now seen corresponding path program 1 times [2025-03-08 19:10:48,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:10:48,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062556134] [2025-03-08 19:10:48,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:10:48,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:10:49,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-08 19:10:49,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-08 19:10:49,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:10:49,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:10:49,832 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-08 19:10:49,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:10:49,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062556134] [2025-03-08 19:10:49,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062556134] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:10:49,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:10:49,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 19:10:49,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18025075] [2025-03-08 19:10:49,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:10:49,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 19:10:49,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:10:49,834 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 19:10:49,834 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:10:49,834 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-08 19:10:50,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:10:50,009 INFO L93 Difference]: Finished difference Result 1109 states and 1556 transitions. [2025-03-08 19:10:50,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 19:10:50,010 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-08 19:10:50,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:10:50,015 INFO L225 Difference]: With dead ends: 1109 [2025-03-08 19:10:50,015 INFO L226 Difference]: Without dead ends: 1106 [2025-03-08 19:10:50,016 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:10:50,017 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-08 19:10:50,018 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-08 19:10:50,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1106 states. [2025-03-08 19:10:50,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1106 to 1106. [2025-03-08 19:10:50,066 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-08 19:10:50,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1106 states to 1106 states and 1553 transitions. [2025-03-08 19:10:50,073 INFO L78 Accepts]: Start accepts. Automaton has 1106 states and 1553 transitions. Word has length 52 [2025-03-08 19:10:50,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:10:50,073 INFO L471 AbstractCegarLoop]: Abstraction has 1106 states and 1553 transitions. [2025-03-08 19:10:50,073 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-08 19:10:50,073 INFO L276 IsEmpty]: Start isEmpty. Operand 1106 states and 1553 transitions. [2025-03-08 19:10:50,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-08 19:10:50,077 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:10:50,078 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-08 19:10:50,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 19:10:50,078 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:10:50,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:10:50,078 INFO L85 PathProgramCache]: Analyzing trace with hash -1184922181, now seen corresponding path program 1 times [2025-03-08 19:10:50,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:10:50,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478022176] [2025-03-08 19:10:50,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:10:50,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:10:50,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-08 19:10:50,908 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-08 19:10:50,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:10:50,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:10:51,055 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-08 19:10:51,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:10:51,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478022176] [2025-03-08 19:10:51,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478022176] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:10:51,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:10:51,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 19:10:51,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290297266] [2025-03-08 19:10:51,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:10:51,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 19:10:51,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:10:51,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 19:10:51,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:10:51,057 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-08 19:10:51,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:10:51,458 INFO L93 Difference]: Finished difference Result 3263 states and 4612 transitions. [2025-03-08 19:10:51,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 19:10:51,459 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-08 19:10:51,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:10:51,469 INFO L225 Difference]: With dead ends: 3263 [2025-03-08 19:10:51,469 INFO L226 Difference]: Without dead ends: 2180 [2025-03-08 19:10:51,474 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:10:51,474 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-08 19:10:51,474 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-08 19:10:51,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2180 states. [2025-03-08 19:10:51,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2180 to 2176. [2025-03-08 19:10:51,557 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-08 19:10:51,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2176 states to 2176 states and 3072 transitions. [2025-03-08 19:10:51,570 INFO L78 Accepts]: Start accepts. Automaton has 2176 states and 3072 transitions. Word has length 53 [2025-03-08 19:10:51,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:10:51,570 INFO L471 AbstractCegarLoop]: Abstraction has 2176 states and 3072 transitions. [2025-03-08 19:10:51,571 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-08 19:10:51,571 INFO L276 IsEmpty]: Start isEmpty. Operand 2176 states and 3072 transitions. [2025-03-08 19:10:51,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-08 19:10:51,573 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:10:51,573 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-08 19:10:51,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 19:10:51,574 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:10:51,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:10:51,574 INFO L85 PathProgramCache]: Analyzing trace with hash 1921719077, now seen corresponding path program 1 times [2025-03-08 19:10:51,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:10:51,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138251100] [2025-03-08 19:10:51,574 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:10:51,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:10:52,422 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-08 19:10:52,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-08 19:10:52,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:10:52,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:10:52,615 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-08 19:10:52,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:10:52,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138251100] [2025-03-08 19:10:52,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138251100] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:10:52,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:10:52,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 19:10:52,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178844603] [2025-03-08 19:10:52,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:10:52,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 19:10:52,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:10:52,616 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 19:10:52,616 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:10:52,616 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-08 19:10:52,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:10:52,854 INFO L93 Difference]: Finished difference Result 2178 states and 3073 transitions. [2025-03-08 19:10:52,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 19:10:52,855 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-08 19:10:52,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:10:52,870 INFO L225 Difference]: With dead ends: 2178 [2025-03-08 19:10:52,870 INFO L226 Difference]: Without dead ends: 2166 [2025-03-08 19:10:52,872 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:10:52,873 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-08 19:10:52,873 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-08 19:10:52,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2166 states. [2025-03-08 19:10:52,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2166 to 2166. [2025-03-08 19:10:52,999 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-08 19:10:53,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2166 states to 2166 states and 3058 transitions. [2025-03-08 19:10:53,015 INFO L78 Accepts]: Start accepts. Automaton has 2166 states and 3058 transitions. Word has length 54 [2025-03-08 19:10:53,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:10:53,015 INFO L471 AbstractCegarLoop]: Abstraction has 2166 states and 3058 transitions. [2025-03-08 19:10:53,015 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-08 19:10:53,015 INFO L276 IsEmpty]: Start isEmpty. Operand 2166 states and 3058 transitions. [2025-03-08 19:10:53,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-08 19:10:53,019 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:10:53,019 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] [2025-03-08 19:10:53,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 19:10:53,019 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:10:53,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:10:53,019 INFO L85 PathProgramCache]: Analyzing trace with hash 1257440926, now seen corresponding path program 1 times [2025-03-08 19:10:53,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:10:53,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36919351] [2025-03-08 19:10:53,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:10:53,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:10:53,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-08 19:10:53,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-08 19:10:53,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:10:53,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:10:53,969 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-08 19:10:53,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:10:53,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36919351] [2025-03-08 19:10:53,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36919351] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:10:53,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:10:53,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 19:10:53,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136706312] [2025-03-08 19:10:53,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:10:53,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 19:10:53,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:10:53,970 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 19:10:53,970 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:10:53,970 INFO L87 Difference]: Start difference. First operand 2166 states and 3058 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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-08 19:10:54,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:10:54,635 INFO L93 Difference]: Finished difference Result 6308 states and 8877 transitions. [2025-03-08 19:10:54,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 19:10:54,635 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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 66 [2025-03-08 19:10:54,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:10:54,657 INFO L225 Difference]: With dead ends: 6308 [2025-03-08 19:10:54,657 INFO L226 Difference]: Without dead ends: 4165 [2025-03-08 19:10:54,667 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:10:54,668 INFO L435 NwaCegarLoop]: 800 mSDtfsCounter, 738 mSDsluCounter, 741 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 738 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.5s IncrementalHoareTripleChecker+Time [2025-03-08 19:10:54,669 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [738 Valid, 1541 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 19:10:54,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4165 states. [2025-03-08 19:10:54,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4165 to 4148. [2025-03-08 19:10:54,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4148 states, 3332 states have (on average 1.397358943577431) internal successors, (4656), 3343 states have internal predecessors, (4656), 580 states have call successors, (580), 236 states have call predecessors, (580), 235 states have return successors, (590), 576 states have call predecessors, (590), 578 states have call successors, (590) [2025-03-08 19:10:54,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4148 states to 4148 states and 5826 transitions. [2025-03-08 19:10:54,877 INFO L78 Accepts]: Start accepts. Automaton has 4148 states and 5826 transitions. Word has length 66 [2025-03-08 19:10:54,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:10:54,877 INFO L471 AbstractCegarLoop]: Abstraction has 4148 states and 5826 transitions. [2025-03-08 19:10:54,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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-08 19:10:54,877 INFO L276 IsEmpty]: Start isEmpty. Operand 4148 states and 5826 transitions. [2025-03-08 19:10:54,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-08 19:10:54,879 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:10:54,879 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] [2025-03-08 19:10:54,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 19:10:54,879 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:10:54,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:10:54,880 INFO L85 PathProgramCache]: Analyzing trace with hash 730466282, now seen corresponding path program 1 times [2025-03-08 19:10:54,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:10:54,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8670450] [2025-03-08 19:10:54,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:10:54,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:10:55,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-08 19:10:55,795 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-08 19:10:55,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:10:55,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:10:55,934 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-08 19:10:55,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:10:55,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8670450] [2025-03-08 19:10:55,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8670450] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:10:55,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:10:55,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 19:10:55,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257514317] [2025-03-08 19:10:55,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:10:55,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 19:10:55,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:10:55,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 19:10:55,936 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:10:55,936 INFO L87 Difference]: Start difference. First operand 4148 states and 5826 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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-08 19:10:56,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:10:56,708 INFO L93 Difference]: Finished difference Result 10732 states and 15042 transitions. [2025-03-08 19:10:56,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 19:10:56,708 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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 66 [2025-03-08 19:10:56,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:10:56,741 INFO L225 Difference]: With dead ends: 10732 [2025-03-08 19:10:56,741 INFO L226 Difference]: Without dead ends: 6607 [2025-03-08 19:10:56,757 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:10:56,758 INFO L435 NwaCegarLoop]: 1219 mSDtfsCounter, 727 mSDsluCounter, 741 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 727 SdHoareTripleChecker+Valid, 1960 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 19:10:56,759 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [727 Valid, 1960 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 19:10:56,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6607 states. [2025-03-08 19:10:56,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6607 to 6594. [2025-03-08 19:10:57,001 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-08 19:10:57,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6594 states to 6594 states and 9223 transitions. [2025-03-08 19:10:57,027 INFO L78 Accepts]: Start accepts. Automaton has 6594 states and 9223 transitions. Word has length 66 [2025-03-08 19:10:57,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:10:57,028 INFO L471 AbstractCegarLoop]: Abstraction has 6594 states and 9223 transitions. [2025-03-08 19:10:57,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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-08 19:10:57,028 INFO L276 IsEmpty]: Start isEmpty. Operand 6594 states and 9223 transitions. [2025-03-08 19:10:57,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-08 19:10:57,035 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:10:57,035 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] [2025-03-08 19:10:57,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 19:10:57,036 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:10:57,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:10:57,036 INFO L85 PathProgramCache]: Analyzing trace with hash -1269149924, now seen corresponding path program 1 times [2025-03-08 19:10:57,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:10:57,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904117446] [2025-03-08 19:10:57,036 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:10:57,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:10:58,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-08 19:10:58,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-08 19:10:58,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:10:58,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:10:58,470 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-08 19:10:58,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:10:58,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904117446] [2025-03-08 19:10:58,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904117446] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:10:58,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:10:58,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 19:10:58,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189266040] [2025-03-08 19:10:58,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:10:58,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 19:10:58,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:10:58,472 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 19:10:58,472 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 19:10:58,473 INFO L87 Difference]: Start difference. First operand 6594 states and 9223 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 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-08 19:11:02,494 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-08 19:11:06,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:11:06,341 INFO L93 Difference]: Finished difference Result 9873 states and 13843 transitions. [2025-03-08 19:11:06,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 19:11:06,342 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 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 122 [2025-03-08 19:11:06,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:11:06,391 INFO L225 Difference]: With dead ends: 9873 [2025-03-08 19:11:06,393 INFO L226 Difference]: Without dead ends: 9870 [2025-03-08 19:11:06,401 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-08 19:11:06,401 INFO L435 NwaCegarLoop]: 1544 mSDtfsCounter, 1509 mSDsluCounter, 1226 mSDsCounter, 0 mSdLazyCounter, 410 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1509 SdHoareTripleChecker+Valid, 2770 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.6s IncrementalHoareTripleChecker+Time [2025-03-08 19:11:06,402 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1509 Valid, 2770 Invalid, 413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 410 Invalid, 1 Unknown, 0 Unchecked, 7.6s Time] [2025-03-08 19:11:06,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9870 states. [2025-03-08 19:11:06,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9870 to 9856. [2025-03-08 19:11:06,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9856 states, 7921 states have (on average 1.3974245676051005) internal successors, (11069), 7943 states have internal predecessors, (11069), 1354 states have call successors, (1354), 581 states have call predecessors, (1354), 580 states have return successors, (1400), 1349 states have call predecessors, (1400), 1352 states have call successors, (1400) [2025-03-08 19:11:06,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9856 states to 9856 states and 13823 transitions. [2025-03-08 19:11:06,831 INFO L78 Accepts]: Start accepts. Automaton has 9856 states and 13823 transitions. Word has length 122 [2025-03-08 19:11:06,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:11:06,832 INFO L471 AbstractCegarLoop]: Abstraction has 9856 states and 13823 transitions. [2025-03-08 19:11:06,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 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-08 19:11:06,833 INFO L276 IsEmpty]: Start isEmpty. Operand 9856 states and 13823 transitions. [2025-03-08 19:11:06,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-08 19:11:06,839 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:11:06,839 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-08 19:11:06,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 19:11:06,840 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:11:06,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:11:06,840 INFO L85 PathProgramCache]: Analyzing trace with hash 276510513, now seen corresponding path program 1 times [2025-03-08 19:11:06,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:11:06,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189617843] [2025-03-08 19:11:06,840 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:11:06,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:11:07,743 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-08 19:11:07,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-08 19:11:07,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:11:07,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:11:07,921 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-08 19:11:07,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:11:07,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189617843] [2025-03-08 19:11:07,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189617843] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:11:07,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:11:07,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 19:11:07,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406421933] [2025-03-08 19:11:07,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:11:07,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 19:11:07,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:11:07,922 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 19:11:07,922 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:11:07,922 INFO L87 Difference]: Start difference. First operand 9856 states and 13823 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-08 19:11:11,943 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-08 19:11:12,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:11:12,898 INFO L93 Difference]: Finished difference Result 25274 states and 35476 transitions. [2025-03-08 19:11:12,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 19:11:12,898 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-08 19:11:12,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:11:12,965 INFO L225 Difference]: With dead ends: 25274 [2025-03-08 19:11:12,965 INFO L226 Difference]: Without dead ends: 15463 [2025-03-08 19:11:12,997 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:11:12,998 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-08 19:11:12,998 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-08 19:11:13,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15463 states. [2025-03-08 19:11:13,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15463 to 15450. [2025-03-08 19:11:13,763 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-08 19:11:13,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15450 states to 15450 states and 21583 transitions. [2025-03-08 19:11:13,822 INFO L78 Accepts]: Start accepts. Automaton has 15450 states and 21583 transitions. Word has length 124 [2025-03-08 19:11:13,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:11:13,823 INFO L471 AbstractCegarLoop]: Abstraction has 15450 states and 21583 transitions. [2025-03-08 19:11:13,823 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-08 19:11:13,824 INFO L276 IsEmpty]: Start isEmpty. Operand 15450 states and 21583 transitions. [2025-03-08 19:11:13,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-08 19:11:13,829 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:11:13,830 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-08 19:11:13,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 19:11:13,830 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:11:13,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:11:13,831 INFO L85 PathProgramCache]: Analyzing trace with hash -1310951942, now seen corresponding path program 1 times [2025-03-08 19:11:13,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:11:13,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468752177] [2025-03-08 19:11:13,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:11:13,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:11:15,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-08 19:11:15,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-08 19:11:15,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:11:15,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:11:15,173 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-08 19:11:15,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:11:15,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468752177] [2025-03-08 19:11:15,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468752177] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:11:15,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:11:15,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 19:11:15,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219920109] [2025-03-08 19:11:15,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:11:15,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 19:11:15,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:11:15,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 19:11:15,175 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:11:15,176 INFO L87 Difference]: Start difference. First operand 15450 states and 21583 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 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-08 19:11:19,196 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-08 19:11:20,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:11:20,526 INFO L93 Difference]: Finished difference Result 39181 states and 54786 transitions. [2025-03-08 19:11:20,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 19:11:20,526 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 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 123 [2025-03-08 19:11:20,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:11:20,626 INFO L225 Difference]: With dead ends: 39181 [2025-03-08 19:11:20,626 INFO L226 Difference]: Without dead ends: 23776 [2025-03-08 19:11:20,665 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:11:20,666 INFO L435 NwaCegarLoop]: 995 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, 1741 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.8s IncrementalHoareTripleChecker+Time [2025-03-08 19:11:20,666 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [739 Valid, 1741 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 58 Invalid, 1 Unknown, 0 Unchecked, 4.8s Time] [2025-03-08 19:11:20,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23776 states. [2025-03-08 19:11:21,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23776 to 23757. [2025-03-08 19:11:21,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23757 states, 19332 states have (on average 1.3926650113800951) internal successors, (26923), 19369 states have internal predecessors, (26923), 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-08 19:11:21,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23757 states to 23757 states and 33073 transitions. [2025-03-08 19:11:21,514 INFO L78 Accepts]: Start accepts. Automaton has 23757 states and 33073 transitions. Word has length 123 [2025-03-08 19:11:21,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:11:21,515 INFO L471 AbstractCegarLoop]: Abstraction has 23757 states and 33073 transitions. [2025-03-08 19:11:21,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 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-08 19:11:21,515 INFO L276 IsEmpty]: Start isEmpty. Operand 23757 states and 33073 transitions. [2025-03-08 19:11:21,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-08 19:11:21,519 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:11:21,519 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-08 19:11:21,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 19:11:21,520 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:11:21,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:11:21,520 INFO L85 PathProgramCache]: Analyzing trace with hash -1837926586, now seen corresponding path program 1 times [2025-03-08 19:11:21,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:11:21,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295970125] [2025-03-08 19:11:21,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:11:21,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:11:22,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-08 19:11:22,528 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-08 19:11:22,529 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:11:22,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:11:23,300 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-08 19:11:23,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:11:23,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295970125] [2025-03-08 19:11:23,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295970125] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:11:23,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:11:23,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 19:11:23,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292840871] [2025-03-08 19:11:23,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:11:23,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 19:11:23,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:11:23,301 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 19:11:23,301 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-08 19:11:23,301 INFO L87 Difference]: Start difference. First operand 23757 states and 33073 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-08 19:11:25,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:11:25,398 INFO L93 Difference]: Finished difference Result 31898 states and 44390 transitions. [2025-03-08 19:11:25,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 19:11:25,399 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-08 19:11:25,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:11:25,508 INFO L225 Difference]: With dead ends: 31898 [2025-03-08 19:11:25,508 INFO L226 Difference]: Without dead ends: 23932 [2025-03-08 19:11:25,539 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-08 19:11:25,541 INFO L435 NwaCegarLoop]: 792 mSDtfsCounter, 1 mSDsluCounter, 3942 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 4734 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-08 19:11:25,541 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 4734 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-08 19:11:25,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23932 states. [2025-03-08 19:11:26,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23932 to 23884. [2025-03-08 19:11:26,676 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-08 19:11:26,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23884 states to 23884 states and 33184 transitions. [2025-03-08 19:11:26,743 INFO L78 Accepts]: Start accepts. Automaton has 23884 states and 33184 transitions. Word has length 123 [2025-03-08 19:11:26,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:11:26,744 INFO L471 AbstractCegarLoop]: Abstraction has 23884 states and 33184 transitions. [2025-03-08 19:11:26,744 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-08 19:11:26,744 INFO L276 IsEmpty]: Start isEmpty. Operand 23884 states and 33184 transitions. [2025-03-08 19:11:26,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-08 19:11:26,754 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:11:26,754 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-08 19:11:26,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 19:11:26,754 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:11:26,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:11:26,754 INFO L85 PathProgramCache]: Analyzing trace with hash -1857671853, now seen corresponding path program 1 times [2025-03-08 19:11:26,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:11:26,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216684360] [2025-03-08 19:11:26,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:11:26,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:11:27,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-08 19:11:27,638 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-08 19:11:27,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:11:27,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:11:28,282 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-08 19:11:28,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:11:28,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216684360] [2025-03-08 19:11:28,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216684360] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:11:28,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:11:28,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 19:11:28,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121653869] [2025-03-08 19:11:28,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:11:28,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 19:11:28,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:11:28,283 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 19:11:28,283 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 19:11:28,283 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-08 19:11:29,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:11:29,692 INFO L93 Difference]: Finished difference Result 32009 states and 44445 transitions. [2025-03-08 19:11:29,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 19:11:29,693 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-08 19:11:29,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:11:29,757 INFO L225 Difference]: With dead ends: 32009 [2025-03-08 19:11:29,757 INFO L226 Difference]: Without dead ends: 16043 [2025-03-08 19:11:29,791 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-08 19:11:29,792 INFO L435 NwaCegarLoop]: 790 mSDtfsCounter, 43 mSDsluCounter, 3110 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s 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.8s IncrementalHoareTripleChecker+Time [2025-03-08 19:11:29,792 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.8s Time] [2025-03-08 19:11:29,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16043 states. [2025-03-08 19:11:30,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16043 to 16011. [2025-03-08 19:11:30,229 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-08 19:11:30,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16011 states to 16011 states and 22166 transitions. [2025-03-08 19:11:30,281 INFO L78 Accepts]: Start accepts. Automaton has 16011 states and 22166 transitions. Word has length 140 [2025-03-08 19:11:30,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:11:30,282 INFO L471 AbstractCegarLoop]: Abstraction has 16011 states and 22166 transitions. [2025-03-08 19:11:30,283 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-08 19:11:30,283 INFO L276 IsEmpty]: Start isEmpty. Operand 16011 states and 22166 transitions. [2025-03-08 19:11:30,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-08 19:11:30,294 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:11:30,294 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-08 19:11:30,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 19:11:30,294 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:11:30,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:11:30,295 INFO L85 PathProgramCache]: Analyzing trace with hash 725838613, now seen corresponding path program 1 times [2025-03-08 19:11:30,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:11:30,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460595873] [2025-03-08 19:11:30,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:11:30,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:11:31,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-08 19:11:31,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-08 19:11:31,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:11:31,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:11:31,654 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-08 19:11:31,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:11:31,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460595873] [2025-03-08 19:11:31,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460595873] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:11:31,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:11:31,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 19:11:31,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102315138] [2025-03-08 19:11:31,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:11:31,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 19:11:31,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:11:31,655 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 19:11:31,655 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 19:11:31,656 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-08 19:11:32,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:11:32,567 INFO L93 Difference]: Finished difference Result 31993 states and 44301 transitions. [2025-03-08 19:11:32,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 19:11:32,567 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-08 19:11:32,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:11:32,633 INFO L225 Difference]: With dead ends: 31993 [2025-03-08 19:11:32,633 INFO L226 Difference]: Without dead ends: 16012 [2025-03-08 19:11:32,664 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-08 19:11:32,665 INFO L435 NwaCegarLoop]: 793 mSDtfsCounter, 0 mSDsluCounter, 1584 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.5s IncrementalHoareTripleChecker+Time [2025-03-08 19:11:32,665 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.5s Time] [2025-03-08 19:11:32,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16012 states. [2025-03-08 19:11:33,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16012 to 16012. [2025-03-08 19:11:33,083 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-08 19:11:33,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16012 states to 16012 states and 22167 transitions. [2025-03-08 19:11:33,133 INFO L78 Accepts]: Start accepts. Automaton has 16012 states and 22167 transitions. Word has length 144 [2025-03-08 19:11:33,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:11:33,134 INFO L471 AbstractCegarLoop]: Abstraction has 16012 states and 22167 transitions. [2025-03-08 19:11:33,134 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-08 19:11:33,134 INFO L276 IsEmpty]: Start isEmpty. Operand 16012 states and 22167 transitions. [2025-03-08 19:11:33,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-08 19:11:33,143 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:11:33,143 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] [2025-03-08 19:11:33,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 19:11:33,144 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:11:33,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:11:33,144 INFO L85 PathProgramCache]: Analyzing trace with hash -532416186, now seen corresponding path program 1 times [2025-03-08 19:11:33,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:11:33,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23221890] [2025-03-08 19:11:33,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:11:33,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:11:34,002 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-08 19:11:34,072 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-08 19:11:34,072 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:11:34,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:11:34,686 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-08 19:11:34,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:11:34,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23221890] [2025-03-08 19:11:34,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23221890] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 19:11:34,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1277851560] [2025-03-08 19:11:34,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:11:34,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 19:11:34,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 19:11:34,689 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 19:11:34,691 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 19:11:36,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-08 19:11:36,751 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-08 19:11:36,751 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:11:36,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:11:36,760 INFO L256 TraceCheckSpWp]: Trace formula consists of 2212 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 19:11:36,769 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 19:11:39,779 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-08 19:11:39,779 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 19:11:39,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1277851560] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:11:39,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 19:11:39,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [5] total 11 [2025-03-08 19:11:39,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040607918] [2025-03-08 19:11:39,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:11:39,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 19:11:39,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:11:39,780 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 19:11:39,780 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-03-08 19:11:39,780 INFO L87 Difference]: Start difference. First operand 16012 states and 22167 transitions. Second operand has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 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-08 19:11:43,803 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 19:11:47,993 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.19s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers []