./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--can--usb--esd_usb2.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--can--usb--esd_usb2.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 781669661afd0476205c0d0f127c7931dffbaabf4aae46244e576c29ee5a8115 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 19:10:22,886 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 19:10:22,941 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:22,945 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 19:10:22,945 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 19:10:22,965 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 19:10:22,966 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 19:10:22,966 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 19:10:22,966 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 19:10:22,967 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 19:10:22,967 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 19:10:22,967 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 19:10:22,968 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 19:10:22,968 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 19:10:22,968 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 19:10:22,968 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 19:10:22,968 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 19:10:22,969 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 19:10:22,969 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 19:10:22,969 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 19:10:22,969 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 19:10:22,969 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 19:10:22,969 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 19:10:22,969 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 19:10:22,969 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 19:10:22,969 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 19:10:22,969 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 19:10:22,969 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 19:10:22,969 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 19:10:22,970 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 19:10:22,970 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 19:10:22,970 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 19:10:22,970 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 19:10:22,970 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 19:10:22,970 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 19:10:22,970 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 19:10:22,970 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 19:10:22,970 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 19:10:22,971 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 19:10:22,971 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 19:10:22,971 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 -> 781669661afd0476205c0d0f127c7931dffbaabf4aae46244e576c29ee5a8115 [2025-03-08 19:10:23,204 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 19:10:23,213 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 19:10:23,219 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 19:10:23,220 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 19:10:23,220 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 19:10:23,221 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--can--usb--esd_usb2.ko-entry_point.cil.out.i [2025-03-08 19:10:24,365 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7218680c5/a002b5c884b249ae9d207d1d2ab6a8c2/FLAG0afb9cc2e [2025-03-08 19:10:24,737 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 19:10:24,738 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--can--usb--esd_usb2.ko-entry_point.cil.out.i [2025-03-08 19:10:24,771 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7218680c5/a002b5c884b249ae9d207d1d2ab6a8c2/FLAG0afb9cc2e [2025-03-08 19:10:24,785 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7218680c5/a002b5c884b249ae9d207d1d2ab6a8c2 [2025-03-08 19:10:24,787 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 19:10:24,788 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 19:10:24,789 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 19:10:24,789 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 19:10:24,792 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 19:10:24,793 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 07:10:24" (1/1) ... [2025-03-08 19:10:24,793 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ca987fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:10:24, skipping insertion in model container [2025-03-08 19:10:24,794 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 07:10:24" (1/1) ... [2025-03-08 19:10:24,853 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 19:10:25,488 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--can--usb--esd_usb2.ko-entry_point.cil.out.i[163937,163950] [2025-03-08 19:10:25,967 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 19:10:25,993 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 19:10:26,097 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile (".pushsection .smp_locks,\"a\"\n.balign 4\n.long 671f - .\n.popsection\n671:\n\tlock; bts %1,%0": "+m" (*((long volatile *)addr)): "Ir" (nr): "memory"); [5448] [2025-03-08 19:10:26,099 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile (".pushsection .smp_locks,\"a\"\n.balign 4\n.long 671f - .\n.popsection\n671:\n\tlock; btr %1,%0": "+m" (*((long volatile *)addr)): "Ir" (nr)); [5455] [2025-03-08 19:10:26,099 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile (".pushsection .smp_locks,\"a\"\n.balign 4\n.long 671f - .\n.popsection\n671:\n\tlock; btr %2,%1\n\tsbb %0,%0": "=r" (oldbit), "+m" (*((long volatile *)addr)): "Ir" (nr): "memory"); [5463-5464] [2025-03-08 19:10:26,103 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; incl %0": "+m" (v->counter)); [5493] [2025-03-08 19:10:26,104 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": "+m" (v->counter)); [5500] [2025-03-08 19:10:26,115 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--can--usb--esd_usb2.ko-entry_point.cil.out.i[163937,163950] [2025-03-08 19:10:26,246 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 19:10:26,299 INFO L204 MainTranslator]: Completed translation [2025-03-08 19:10:26,299 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:10:26 WrapperNode [2025-03-08 19:10:26,300 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 19:10:26,301 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 19:10:26,301 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 19:10:26,301 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 19:10:26,306 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:26" (1/1) ... [2025-03-08 19:10:26,355 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:26" (1/1) ... [2025-03-08 19:10:26,453 INFO L138 Inliner]: procedures = 161, calls = 852, calls flagged for inlining = 73, calls inlined = 73, statements flattened = 2678 [2025-03-08 19:10:26,453 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 19:10:26,454 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 19:10:26,454 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 19:10:26,454 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 19:10:26,462 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:26" (1/1) ... [2025-03-08 19:10:26,462 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:26" (1/1) ... [2025-03-08 19:10:26,482 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:26" (1/1) ... [2025-03-08 19:10:26,676 INFO L175 MemorySlicer]: Split 518 memory accesses to 8 slices as follows [2, 19, 9, 9, 48, 19, 44, 368]. 71 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 0, 0, 0, 0, 0, 0, 5]. The 304 writes are split as follows [0, 11, 0, 5, 48, 0, 44, 196]. [2025-03-08 19:10:26,676 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:26" (1/1) ... [2025-03-08 19:10:26,676 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:26" (1/1) ... [2025-03-08 19:10:26,748 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:26" (1/1) ... [2025-03-08 19:10:26,752 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:26" (1/1) ... [2025-03-08 19:10:26,766 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:26" (1/1) ... [2025-03-08 19:10:26,779 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:26" (1/1) ... [2025-03-08 19:10:26,798 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 19:10:26,800 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 19:10:26,801 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 19:10:26,801 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 19:10:26,802 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:10:26" (1/1) ... [2025-03-08 19:10:26,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 19:10:26,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 19:10:26,828 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:26,830 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:26,848 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_set [2025-03-08 19:10:26,848 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_set [2025-03-08 19:10:26,848 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_fill_bulk_urb_2 [2025-03-08 19:10:26,849 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_fill_bulk_urb_2 [2025-03-08 19:10:26,849 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_set_intfdata_17 [2025-03-08 19:10:26,849 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_set_intfdata_17 [2025-03-08 19:10:26,849 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-03-08 19:10:26,849 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-03-08 19:10:26,849 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-03-08 19:10:26,849 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-03-08 19:10:26,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-03-08 19:10:26,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-03-08 19:10:26,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2025-03-08 19:10:26,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2025-03-08 19:10:26,850 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_submit_urb_3 [2025-03-08 19:10:26,850 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_submit_urb_3 [2025-03-08 19:10:26,850 INFO L130 BoogieDeclarations]: Found specification of procedure usb_bulk_msg [2025-03-08 19:10:26,850 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_bulk_msg [2025-03-08 19:10:26,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-03-08 19:10:26,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-03-08 19:10:26,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-03-08 19:10:26,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-03-08 19:10:26,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-03-08 19:10:26,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2025-03-08 19:10:26,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2025-03-08 19:10:26,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#7 [2025-03-08 19:10:26,852 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2025-03-08 19:10:26,852 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2025-03-08 19:10:26,852 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 19:10:26,852 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 19:10:26,852 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-08 19:10:26,852 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-08 19:10:26,852 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-08 19:10:26,853 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-08 19:10:26,853 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-08 19:10:26,853 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-08 19:10:26,853 INFO L130 BoogieDeclarations]: Found specification of procedure netif_tx_start_queue [2025-03-08 19:10:26,853 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_tx_start_queue [2025-03-08 19:10:26,853 INFO L130 BoogieDeclarations]: Found specification of procedure can_free_echo_skb [2025-03-08 19:10:26,853 INFO L138 BoogieDeclarations]: Found implementation of procedure can_free_echo_skb [2025-03-08 19:10:26,853 INFO L130 BoogieDeclarations]: Found specification of procedure netif_device_present [2025-03-08 19:10:26,854 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_device_present [2025-03-08 19:10:26,854 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_submit_urb [2025-03-08 19:10:26,854 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_submit_urb [2025-03-08 19:10:26,854 INFO L130 BoogieDeclarations]: Found specification of procedure netif_wake_queue [2025-03-08 19:10:26,854 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_wake_queue [2025-03-08 19:10:26,854 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2025-03-08 19:10:26,854 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2025-03-08 19:10:26,854 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2025-03-08 19:10:26,854 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2025-03-08 19:10:26,854 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_alloc_urb [2025-03-08 19:10:26,854 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_alloc_urb [2025-03-08 19:10:26,854 INFO L130 BoogieDeclarations]: Found specification of procedure usb_kill_anchored_urbs [2025-03-08 19:10:26,854 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_kill_anchored_urbs [2025-03-08 19:10:26,854 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2025-03-08 19:10:26,854 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2025-03-08 19:10:26,854 INFO L130 BoogieDeclarations]: Found specification of procedure init_usb_anchor [2025-03-08 19:10:26,854 INFO L138 BoogieDeclarations]: Found implementation of procedure init_usb_anchor [2025-03-08 19:10:26,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 19:10:26,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 19:10:26,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-08 19:10:26,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-08 19:10:26,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-08 19:10:26,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-08 19:10:26,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-08 19:10:26,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-08 19:10:26,854 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2025-03-08 19:10:26,854 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2025-03-08 19:10:26,854 INFO L130 BoogieDeclarations]: Found specification of procedure device_create_file [2025-03-08 19:10:26,854 INFO L138 BoogieDeclarations]: Found implementation of procedure device_create_file [2025-03-08 19:10:26,854 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2025-03-08 19:10:26,854 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2025-03-08 19:10:26,854 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 19:10:26,854 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 19:10:26,854 INFO L130 BoogieDeclarations]: Found specification of procedure netif_stop_queue [2025-03-08 19:10:26,854 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_stop_queue [2025-03-08 19:10:26,854 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-08 19:10:26,854 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_err [2025-03-08 19:10:26,854 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_err [2025-03-08 19:10:26,854 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop___0 [2025-03-08 19:10:26,854 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop___0 [2025-03-08 19:10:26,854 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_get_intfdata_4 [2025-03-08 19:10:26,854 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_get_intfdata_4 [2025-03-08 19:10:26,855 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 19:10:26,855 INFO L130 BoogieDeclarations]: Found specification of procedure consume_skb [2025-03-08 19:10:26,855 INFO L138 BoogieDeclarations]: Found implementation of procedure consume_skb [2025-03-08 19:10:26,855 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2025-03-08 19:10:26,855 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2025-03-08 19:10:26,855 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-08 19:10:26,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-08 19:10:26,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-08 19:10:26,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-08 19:10:26,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-08 19:10:26,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-03-08 19:10:26,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-03-08 19:10:26,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-03-08 19:10:26,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-03-08 19:10:26,855 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2025-03-08 19:10:26,855 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2025-03-08 19:10:26,855 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_coherent [2025-03-08 19:10:26,855 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_coherent [2025-03-08 19:10:26,855 INFO L130 BoogieDeclarations]: Found specification of procedure usb_alloc_coherent [2025-03-08 19:10:26,855 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_alloc_coherent [2025-03-08 19:10:26,855 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-08 19:10:26,855 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-08 19:10:26,855 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-08 19:10:26,855 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-08 19:10:26,855 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-03-08 19:10:26,855 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-03-08 19:10:26,855 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-03-08 19:10:26,855 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-03-08 19:10:26,855 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_dec [2025-03-08 19:10:26,855 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_dec [2025-03-08 19:10:26,855 INFO L130 BoogieDeclarations]: Found specification of procedure netif_rx [2025-03-08 19:10:26,858 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_rx [2025-03-08 19:10:26,858 INFO L130 BoogieDeclarations]: Found specification of procedure usb_anchor_urb [2025-03-08 19:10:26,858 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_anchor_urb [2025-03-08 19:10:26,858 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 19:10:26,859 INFO L130 BoogieDeclarations]: Found specification of procedure warn_slowpath_null [2025-03-08 19:10:26,859 INFO L138 BoogieDeclarations]: Found implementation of procedure warn_slowpath_null [2025-03-08 19:10:26,859 INFO L130 BoogieDeclarations]: Found specification of procedure esd_usb2_read_bulk_callback [2025-03-08 19:10:26,859 INFO L138 BoogieDeclarations]: Found implementation of procedure esd_usb2_read_bulk_callback [2025-03-08 19:10:26,859 INFO L130 BoogieDeclarations]: Found specification of procedure dev_err [2025-03-08 19:10:26,859 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_err [2025-03-08 19:10:26,859 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_warn [2025-03-08 19:10:26,859 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_warn [2025-03-08 19:10:26,859 INFO L130 BoogieDeclarations]: Found specification of procedure esd_usb2_send_msg [2025-03-08 19:10:26,859 INFO L138 BoogieDeclarations]: Found implementation of procedure esd_usb2_send_msg [2025-03-08 19:10:26,859 INFO L130 BoogieDeclarations]: Found specification of procedure netif_device_detach [2025-03-08 19:10:26,859 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_device_detach [2025-03-08 19:10:26,859 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2025-03-08 19:10:26,859 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2025-03-08 19:10:26,859 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_priv [2025-03-08 19:10:26,859 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_priv [2025-03-08 19:10:26,859 INFO L130 BoogieDeclarations]: Found specification of procedure usb_unanchor_urb [2025-03-08 19:10:26,859 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_unanchor_urb [2025-03-08 19:10:26,859 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_get_tx_queue [2025-03-08 19:10:26,859 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_get_tx_queue [2025-03-08 19:10:26,859 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_info [2025-03-08 19:10:26,859 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_info [2025-03-08 19:10:26,859 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free_urb [2025-03-08 19:10:26,859 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free_urb [2025-03-08 19:10:26,859 INFO L130 BoogieDeclarations]: Found specification of procedure close_candev [2025-03-08 19:10:26,859 INFO L138 BoogieDeclarations]: Found implementation of procedure close_candev [2025-03-08 19:10:26,859 INFO L130 BoogieDeclarations]: Found specification of procedure dev_warn [2025-03-08 19:10:26,859 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_warn [2025-03-08 19:10:26,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 19:10:26,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 19:10:26,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 19:10:26,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-08 19:10:26,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-08 19:10:26,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-08 19:10:26,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-08 19:10:26,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-08 19:10:26,859 INFO L130 BoogieDeclarations]: Found specification of procedure free_candev [2025-03-08 19:10:26,859 INFO L138 BoogieDeclarations]: Found implementation of procedure free_candev [2025-03-08 19:10:26,859 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2025-03-08 19:10:26,859 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2025-03-08 19:10:26,859 INFO L130 BoogieDeclarations]: Found specification of procedure device_remove_file [2025-03-08 19:10:26,859 INFO L138 BoogieDeclarations]: Found implementation of procedure device_remove_file [2025-03-08 19:10:26,859 INFO L130 BoogieDeclarations]: Found specification of procedure esd_usb2_disconnect [2025-03-08 19:10:26,860 INFO L138 BoogieDeclarations]: Found implementation of procedure esd_usb2_disconnect [2025-03-08 19:10:26,860 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 19:10:26,860 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 19:10:27,294 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 19:10:27,297 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 19:10:27,403 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7711: havoc #t~nondet528; [2025-03-08 19:10:27,405 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2025-03-08 19:10:27,442 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5471: havoc constant_test_bit_#t~mem1#1;havoc constant_test_bit_#t~bitwise2#1; [2025-03-08 19:10:27,497 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7686: havoc netpoll_trap_#t~nondet523#1; [2025-03-08 19:10:27,513 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5581: havoc #t~mem48;havoc #t~bitwise49; [2025-03-08 19:10:27,553 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5541: call ULTIMATE.dealloc(~#__key~0#1.base, ~#__key~0#1.offset);havoc ~#__key~0#1.base, ~#__key~0#1.offset;call ULTIMATE.dealloc(~#__key___0~0#1.base, ~#__key___0~0#1.offset);havoc ~#__key___0~0#1.base, ~#__key___0~0#1.offset; [2025-03-08 19:10:27,559 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7643: havoc #t~nondet516; [2025-03-08 19:10:27,580 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7694: havoc printk_#t~nondet525#1; [2025-03-08 19:10:27,583 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7667: havoc #t~nondet519; [2025-03-08 19:10:27,583 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stop___0FINAL: assume true; [2025-03-08 19:10:27,616 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7704: havoc #t~ret527.base, #t~ret527.offset; [2025-03-08 19:10:27,620 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7682: havoc #t~nondet522; [2025-03-08 19:10:27,938 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5883: call ULTIMATE.dealloc(esd_usb2_rx_event_~#cf~0#1.base, esd_usb2_rx_event_~#cf~0#1.offset);havoc esd_usb2_rx_event_~#cf~0#1.base, esd_usb2_rx_event_~#cf~0#1.offset; [2025-03-08 19:10:27,938 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7603: havoc _dev_info_#t~nondet509#1; [2025-03-08 19:10:27,938 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5969: call ULTIMATE.dealloc(esd_usb2_rx_can_msg_~#cf~1#1.base, esd_usb2_rx_can_msg_~#cf~1#1.offset);havoc esd_usb2_rx_can_msg_~#cf~1#1.base, esd_usb2_rx_can_msg_~#cf~1#1.offset; [2025-03-08 19:10:27,938 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7622: havoc can_get_echo_skb_#t~nondet513#1; [2025-03-08 19:10:27,938 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7606: havoc alloc_can_err_skb_#t~ret510#1.base, alloc_can_err_skb_#t~ret510#1.offset; [2025-03-08 19:10:27,938 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7609: havoc alloc_can_skb_#t~ret511#1.base, alloc_can_skb_#t~ret511#1.offset; [2025-03-08 19:10:27,941 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7635: havoc #t~nondet514; [2025-03-08 19:10:27,946 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7675: havoc #t~nondet521; [2025-03-08 19:10:27,954 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6255: call ULTIMATE.dealloc(~#actual_length~0.base, ~#actual_length~0.offset);havoc ~#actual_length~0.base, ~#actual_length~0.offset; [2025-03-08 19:10:27,961 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5595: havoc __kmalloc_#t~ret52#1.base, __kmalloc_#t~ret52#1.offset; [2025-03-08 19:10:27,967 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5719: havoc #t~mem64.base, #t~mem64.offset; [2025-03-08 19:10:27,969 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7671: havoc #t~nondet520; [2025-03-08 19:10:27,980 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7639: havoc #t~nondet515; [2025-03-08 19:10:35,739 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7612: havoc alloc_candev_#t~ret512#1.base, alloc_candev_#t~ret512#1.offset; [2025-03-08 19:10:35,739 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6267: call ULTIMATE.dealloc(esd_usb2_wait_msg_~#actual_length~1#1.base, esd_usb2_wait_msg_~#actual_length~1#1.offset);havoc esd_usb2_wait_msg_~#actual_length~1#1.base, esd_usb2_wait_msg_~#actual_length~1#1.offset; [2025-03-08 19:10:35,739 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7690: havoc open_candev_#t~nondet524#1; [2025-03-08 19:10:35,739 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7724: havoc usb_register_driver_#t~nondet529#1; [2025-03-08 19:10:35,739 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7659: havoc ldv_ndo_init_2_#t~nondet517#1; [2025-03-08 19:10:35,739 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5480: havoc atomic_read_#t~mem8#1; [2025-03-08 19:10:35,739 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7663: havoc ldv_ndo_uninit_2_#t~nondet518#1; [2025-03-08 19:10:35,739 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7698: havoc register_candev_#t~nondet526#1; [2025-03-08 19:10:35,932 INFO L? ?]: Removed 1041 outVars from TransFormulas that were not future-live. [2025-03-08 19:10:35,933 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 19:10:35,978 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 19:10:35,978 INFO L336 CfgBuilder]: Removed 1 assume(true) statements. [2025-03-08 19:10:35,978 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 07:10:35 BoogieIcfgContainer [2025-03-08 19:10:35,979 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 19:10:35,981 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 19:10:35,982 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 19:10:35,985 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 19:10:35,985 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 07:10:24" (1/3) ... [2025-03-08 19:10:35,986 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4edbab96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 07:10:35, skipping insertion in model container [2025-03-08 19:10:35,986 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:10:26" (2/3) ... [2025-03-08 19:10:35,988 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4edbab96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 07:10:35, skipping insertion in model container [2025-03-08 19:10:35,988 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 07:10:35" (3/3) ... [2025-03-08 19:10:35,989 INFO L128 eAbstractionObserver]: Analyzing ICFG linux-3.12-rc1.tar.xz-144_2a-drivers--net--can--usb--esd_usb2.ko-entry_point.cil.out.i [2025-03-08 19:10:36,001 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 19:10:36,005 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG linux-3.12-rc1.tar.xz-144_2a-drivers--net--can--usb--esd_usb2.ko-entry_point.cil.out.i that has 52 procedures, 847 locations, 1 initial locations, 3 loop locations, and 1 error locations. [2025-03-08 19:10:36,063 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 19:10:36,073 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;@bf40319, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 19:10:36,073 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 19:10:36,078 INFO L276 IsEmpty]: Start isEmpty. Operand has 845 states, 627 states have (on average 1.3572567783094098) internal successors, (851), 655 states have internal predecessors, (851), 167 states have call successors, (167), 51 states have call predecessors, (167), 49 states have return successors, (158), 156 states have call predecessors, (158), 158 states have call successors, (158) [2025-03-08 19:10:36,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-08 19:10:36,087 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:10:36,087 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36,088 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:10:36,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:10:36,091 INFO L85 PathProgramCache]: Analyzing trace with hash -1653596225, now seen corresponding path program 1 times [2025-03-08 19:10:36,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:10:36,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908349761] [2025-03-08 19:10:36,097 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:10:36,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:10:38,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-08 19:10:38,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-08 19:10:38,753 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:10:38,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:10:39,289 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-08 19:10:39,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:10:39,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908349761] [2025-03-08 19:10:39,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908349761] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:10:39,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:10:39,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 19:10:39,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060857392] [2025-03-08 19:10:39,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:10:39,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 19:10:39,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:10:39,311 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 19:10:39,312 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:10:39,315 INFO L87 Difference]: Start difference. First operand has 845 states, 627 states have (on average 1.3572567783094098) internal successors, (851), 655 states have internal predecessors, (851), 167 states have call successors, (167), 51 states have call predecessors, (167), 49 states have return successors, (158), 156 states have call predecessors, (158), 158 states have call successors, (158) Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-08 19:10:43,364 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 19:10:44,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:10:44,475 INFO L93 Difference]: Finished difference Result 2473 states and 3505 transitions. [2025-03-08 19:10:44,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 19:10:44,477 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 83 [2025-03-08 19:10:44,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:10:44,493 INFO L225 Difference]: With dead ends: 2473 [2025-03-08 19:10:44,493 INFO L226 Difference]: Without dead ends: 1605 [2025-03-08 19:10:44,498 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,500 INFO L435 NwaCegarLoop]: 1135 mSDtfsCounter, 1078 mSDsluCounter, 1108 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1078 SdHoareTripleChecker+Valid, 2243 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2025-03-08 19:10:44,501 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1078 Valid, 2243 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 61 Invalid, 1 Unknown, 0 Unchecked, 5.0s Time] [2025-03-08 19:10:44,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1605 states. [2025-03-08 19:10:44,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1605 to 1605. [2025-03-08 19:10:44,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1605 states, 1210 states have (on average 1.3173553719008264) internal successors, (1594), 1240 states have internal predecessors, (1594), 298 states have call successors, (298), 97 states have call predecessors, (298), 96 states have return successors, (293), 289 states have call predecessors, (293), 293 states have call successors, (293) [2025-03-08 19:10:44,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1605 states to 1605 states and 2185 transitions. [2025-03-08 19:10:44,625 INFO L78 Accepts]: Start accepts. Automaton has 1605 states and 2185 transitions. Word has length 83 [2025-03-08 19:10:44,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:10:44,626 INFO L471 AbstractCegarLoop]: Abstraction has 1605 states and 2185 transitions. [2025-03-08 19:10:44,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-08 19:10:44,626 INFO L276 IsEmpty]: Start isEmpty. Operand 1605 states and 2185 transitions. [2025-03-08 19:10:44,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-08 19:10:44,633 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:10:44,634 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 19:10:44,634 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:10:44,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:10:44,635 INFO L85 PathProgramCache]: Analyzing trace with hash -1170013553, now seen corresponding path program 1 times [2025-03-08 19:10:44,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:10:44,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299144784] [2025-03-08 19:10:44,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:10:44,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:10:46,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-08 19:10:46,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-08 19:10:46,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:10:46,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:10:47,769 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-08 19:10:47,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:10:47,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299144784] [2025-03-08 19:10:47,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299144784] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:10:47,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:10:47,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 19:10:47,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776759555] [2025-03-08 19:10:47,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:10:47,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 19:10:47,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:10:47,771 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 19:10:47,771 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:10:47,771 INFO L87 Difference]: Start difference. First operand 1605 states and 2185 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-08 19:10:48,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:10:48,804 INFO L93 Difference]: Finished difference Result 4764 states and 6498 transitions. [2025-03-08 19:10:48,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 19:10:48,805 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 93 [2025-03-08 19:10:48,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:10:48,821 INFO L225 Difference]: With dead ends: 4764 [2025-03-08 19:10:48,821 INFO L226 Difference]: Without dead ends: 3184 [2025-03-08 19:10:48,827 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,827 INFO L435 NwaCegarLoop]: 1531 mSDtfsCounter, 1083 mSDsluCounter, 1055 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1083 SdHoareTripleChecker+Valid, 2586 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 19:10:48,827 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1083 Valid, 2586 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 19:10:48,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3184 states. [2025-03-08 19:10:48,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3184 to 3174. [2025-03-08 19:10:48,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3174 states, 2401 states have (on average 1.3173677634319034) internal successors, (3163), 2457 states have internal predecessors, (3163), 580 states have call successors, (580), 193 states have call predecessors, (580), 192 states have return successors, (585), 567 states have call predecessors, (585), 575 states have call successors, (585) [2025-03-08 19:10:48,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3174 states to 3174 states and 4328 transitions. [2025-03-08 19:10:48,970 INFO L78 Accepts]: Start accepts. Automaton has 3174 states and 4328 transitions. Word has length 93 [2025-03-08 19:10:48,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:10:48,972 INFO L471 AbstractCegarLoop]: Abstraction has 3174 states and 4328 transitions. [2025-03-08 19:10:48,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-08 19:10:48,972 INFO L276 IsEmpty]: Start isEmpty. Operand 3174 states and 4328 transitions. [2025-03-08 19:10:48,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-08 19:10:48,976 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:10:48,976 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 19:10:48,977 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:10:48,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:10:48,977 INFO L85 PathProgramCache]: Analyzing trace with hash -1911496643, now seen corresponding path program 1 times [2025-03-08 19:10:48,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:10:48,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554183824] [2025-03-08 19:10:48,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:10:48,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:10:50,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-08 19:10:50,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-08 19:10:50,973 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:10:50,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:10:51,590 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-08 19:10:51,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:10:51,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554183824] [2025-03-08 19:10:51,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554183824] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:10:51,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:10:51,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 19:10:51,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700321211] [2025-03-08 19:10:51,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:10:51,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 19:10:51,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:10:51,591 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 19:10:51,591 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:10:51,591 INFO L87 Difference]: Start difference. First operand 3174 states and 4328 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, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-08 19:10:51,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:10:51,914 INFO L93 Difference]: Finished difference Result 3176 states and 4329 transitions. [2025-03-08 19:10:51,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 19:10:51,915 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, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 94 [2025-03-08 19:10:51,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:10:51,932 INFO L225 Difference]: With dead ends: 3176 [2025-03-08 19:10:51,933 INFO L226 Difference]: Without dead ends: 3173 [2025-03-08 19:10:51,935 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:51,937 INFO L435 NwaCegarLoop]: 1100 mSDtfsCounter, 1083 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1083 SdHoareTripleChecker+Valid, 1100 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 19:10:51,938 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1083 Valid, 1100 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 19:10:51,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3173 states. [2025-03-08 19:10:52,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3173 to 3173. [2025-03-08 19:10:52,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3173 states, 2401 states have (on average 1.31695127030404) internal successors, (3162), 2456 states have internal predecessors, (3162), 579 states have call successors, (579), 193 states have call predecessors, (579), 192 states have return successors, (585), 567 states have call predecessors, (585), 575 states have call successors, (585) [2025-03-08 19:10:52,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3173 states to 3173 states and 4326 transitions. [2025-03-08 19:10:52,055 INFO L78 Accepts]: Start accepts. Automaton has 3173 states and 4326 transitions. Word has length 94 [2025-03-08 19:10:52,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:10:52,056 INFO L471 AbstractCegarLoop]: Abstraction has 3173 states and 4326 transitions. [2025-03-08 19:10:52,056 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, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-08 19:10:52,056 INFO L276 IsEmpty]: Start isEmpty. Operand 3173 states and 4326 transitions. [2025-03-08 19:10:52,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-08 19:10:52,058 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:10:52,059 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 19:10:52,059 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:10:52,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:10:52,064 INFO L85 PathProgramCache]: Analyzing trace with hash 872330320, now seen corresponding path program 1 times [2025-03-08 19:10:52,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:10:52,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876384610] [2025-03-08 19:10:52,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:10:52,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:10:53,918 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-08 19:10:53,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-08 19:10:53,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:10:53,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:10:54,179 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-08 19:10:54,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:10:54,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876384610] [2025-03-08 19:10:54,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876384610] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:10:54,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:10:54,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 19:10:54,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053192814] [2025-03-08 19:10:54,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:10:54,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 19:10:54,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:10:54,180 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 19:10:54,180 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:10:54,180 INFO L87 Difference]: Start difference. First operand 3173 states and 4326 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, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-08 19:10:54,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:10:54,528 INFO L93 Difference]: Finished difference Result 3175 states and 4327 transitions. [2025-03-08 19:10:54,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 19:10:54,528 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, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 95 [2025-03-08 19:10:54,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:10:54,542 INFO L225 Difference]: With dead ends: 3175 [2025-03-08 19:10:54,543 INFO L226 Difference]: Without dead ends: 3172 [2025-03-08 19:10:54,544 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,546 INFO L435 NwaCegarLoop]: 1098 mSDtfsCounter, 1080 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1080 SdHoareTripleChecker+Valid, 1098 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 19:10:54,547 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1080 Valid, 1098 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 19:10:54,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3172 states. [2025-03-08 19:10:54,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3172 to 3172. [2025-03-08 19:10:54,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3172 states, 2401 states have (on average 1.3165347771761766) internal successors, (3161), 2455 states have internal predecessors, (3161), 578 states have call successors, (578), 193 states have call predecessors, (578), 192 states have return successors, (585), 567 states have call predecessors, (585), 575 states have call successors, (585) [2025-03-08 19:10:54,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3172 states to 3172 states and 4324 transitions. [2025-03-08 19:10:54,659 INFO L78 Accepts]: Start accepts. Automaton has 3172 states and 4324 transitions. Word has length 95 [2025-03-08 19:10:54,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:10:54,661 INFO L471 AbstractCegarLoop]: Abstraction has 3172 states and 4324 transitions. [2025-03-08 19:10:54,661 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, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-08 19:10:54,661 INFO L276 IsEmpty]: Start isEmpty. Operand 3172 states and 4324 transitions. [2025-03-08 19:10:54,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-08 19:10:54,662 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:10:54,662 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 19:10:54,662 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:10:54,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:10:54,663 INFO L85 PathProgramCache]: Analyzing trace with hash 1271619230, now seen corresponding path program 1 times [2025-03-08 19:10:54,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:10:54,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837574988] [2025-03-08 19:10:54,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:10:54,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:10:56,574 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-08 19:10:56,620 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-08 19:10:56,620 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:10:56,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:10:56,829 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-08 19:10:56,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:10:56,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837574988] [2025-03-08 19:10:56,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837574988] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:10:56,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:10:56,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 19:10:56,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583576405] [2025-03-08 19:10:56,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:10:56,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 19:10:56,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:10:56,832 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 19:10:56,832 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:10:56,832 INFO L87 Difference]: Start difference. First operand 3172 states and 4324 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, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-08 19:10:57,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:10:57,209 INFO L93 Difference]: Finished difference Result 3174 states and 4325 transitions. [2025-03-08 19:10:57,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 19:10:57,209 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, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 96 [2025-03-08 19:10:57,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:10:57,226 INFO L225 Difference]: With dead ends: 3174 [2025-03-08 19:10:57,226 INFO L226 Difference]: Without dead ends: 3171 [2025-03-08 19:10:57,229 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:57,230 INFO L435 NwaCegarLoop]: 1096 mSDtfsCounter, 1077 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1077 SdHoareTripleChecker+Valid, 1096 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 19:10:57,230 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1077 Valid, 1096 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 19:10:57,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3171 states. [2025-03-08 19:10:57,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3171 to 3171. [2025-03-08 19:10:57,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3171 states, 2401 states have (on average 1.3161182840483132) internal successors, (3160), 2454 states have internal predecessors, (3160), 577 states have call successors, (577), 193 states have call predecessors, (577), 192 states have return successors, (585), 567 states have call predecessors, (585), 575 states have call successors, (585) [2025-03-08 19:10:57,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3171 states to 3171 states and 4322 transitions. [2025-03-08 19:10:57,384 INFO L78 Accepts]: Start accepts. Automaton has 3171 states and 4322 transitions. Word has length 96 [2025-03-08 19:10:57,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:10:57,385 INFO L471 AbstractCegarLoop]: Abstraction has 3171 states and 4322 transitions. [2025-03-08 19:10:57,385 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, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-08 19:10:57,385 INFO L276 IsEmpty]: Start isEmpty. Operand 3171 states and 4322 transitions. [2025-03-08 19:10:57,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-08 19:10:57,387 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:10:57,388 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 19:10:57,388 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:10:57,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:10:57,388 INFO L85 PathProgramCache]: Analyzing trace with hash 764672529, now seen corresponding path program 1 times [2025-03-08 19:10:57,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:10:57,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099397472] [2025-03-08 19:10:57,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:10:57,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:10:59,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-08 19:10:59,292 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-08 19:10:59,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:10:59,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:10:59,477 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-08 19:10:59,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:10:59,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099397472] [2025-03-08 19:10:59,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099397472] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:10:59,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:10:59,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 19:10:59,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915383083] [2025-03-08 19:10:59,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:10:59,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 19:10:59,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:10:59,478 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 19:10:59,478 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:10:59,479 INFO L87 Difference]: Start difference. First operand 3171 states and 4322 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, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-08 19:10:59,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:10:59,803 INFO L93 Difference]: Finished difference Result 3173 states and 4323 transitions. [2025-03-08 19:10:59,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 19:10:59,803 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, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 97 [2025-03-08 19:10:59,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:10:59,815 INFO L225 Difference]: With dead ends: 3173 [2025-03-08 19:10:59,816 INFO L226 Difference]: Without dead ends: 3161 [2025-03-08 19:10:59,818 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:59,819 INFO L435 NwaCegarLoop]: 1095 mSDtfsCounter, 1074 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1074 SdHoareTripleChecker+Valid, 1095 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 19:10:59,819 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1074 Valid, 1095 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 19:10:59,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3161 states. [2025-03-08 19:10:59,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3161 to 3161. [2025-03-08 19:10:59,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3161 states, 2392 states have (on average 1.3156354515050168) internal successors, (3147), 2444 states have internal predecessors, (3147), 576 states have call successors, (576), 193 states have call predecessors, (576), 192 states have return successors, (585), 567 states have call predecessors, (585), 575 states have call successors, (585) [2025-03-08 19:10:59,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3161 states to 3161 states and 4308 transitions. [2025-03-08 19:10:59,937 INFO L78 Accepts]: Start accepts. Automaton has 3161 states and 4308 transitions. Word has length 97 [2025-03-08 19:10:59,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:10:59,937 INFO L471 AbstractCegarLoop]: Abstraction has 3161 states and 4308 transitions. [2025-03-08 19:10:59,938 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, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-08 19:10:59,938 INFO L276 IsEmpty]: Start isEmpty. Operand 3161 states and 4308 transitions. [2025-03-08 19:10:59,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-08 19:10:59,945 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:10:59,945 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 19:10:59,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 19:10:59,946 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:10:59,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:10:59,946 INFO L85 PathProgramCache]: Analyzing trace with hash 576247103, now seen corresponding path program 1 times [2025-03-08 19:10:59,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:10:59,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081319540] [2025-03-08 19:10:59,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:10:59,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:11:01,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-08 19:11:01,784 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-08 19:11:01,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:11:01,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:11:01,989 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-08 19:11:01,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:11:01,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081319540] [2025-03-08 19:11:01,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081319540] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:11:01,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:11:01,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 19:11:01,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697811798] [2025-03-08 19:11:01,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:11:01,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 19:11:01,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:11:01,991 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 19:11:01,991 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:11:01,994 INFO L87 Difference]: Start difference. First operand 3161 states and 4308 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-08 19:11:02,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:11:02,884 INFO L93 Difference]: Finished difference Result 7350 states and 9957 transitions. [2025-03-08 19:11:02,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 19:11:02,885 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 147 [2025-03-08 19:11:02,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:11:02,903 INFO L225 Difference]: With dead ends: 7350 [2025-03-08 19:11:02,903 INFO L226 Difference]: Without dead ends: 4214 [2025-03-08 19:11:02,912 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:02,915 INFO L435 NwaCegarLoop]: 1126 mSDtfsCounter, 385 mSDsluCounter, 1037 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 385 SdHoareTripleChecker+Valid, 2163 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 19:11:02,915 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [385 Valid, 2163 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 19:11:02,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4214 states. [2025-03-08 19:11:03,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4214 to 4206. [2025-03-08 19:11:03,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4206 states, 3177 states have (on average 1.3065785332074284) internal successors, (4151), 3237 states have internal predecessors, (4151), 757 states have call successors, (757), 272 states have call predecessors, (757), 271 states have return successors, (766), 748 states have call predecessors, (766), 756 states have call successors, (766) [2025-03-08 19:11:03,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4206 states to 4206 states and 5674 transitions. [2025-03-08 19:11:03,070 INFO L78 Accepts]: Start accepts. Automaton has 4206 states and 5674 transitions. Word has length 147 [2025-03-08 19:11:03,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:11:03,071 INFO L471 AbstractCegarLoop]: Abstraction has 4206 states and 5674 transitions. [2025-03-08 19:11:03,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-08 19:11:03,072 INFO L276 IsEmpty]: Start isEmpty. Operand 4206 states and 5674 transitions. [2025-03-08 19:11:03,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-08 19:11:03,079 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:11:03,079 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 19:11:03,079 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:11:03,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:11:03,080 INFO L85 PathProgramCache]: Analyzing trace with hash 696048637, now seen corresponding path program 1 times [2025-03-08 19:11:03,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:11:03,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193998044] [2025-03-08 19:11:03,080 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:11:03,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:11:04,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-08 19:11:05,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-08 19:11:05,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:11:05,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:11:05,278 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-08 19:11:05,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:11:05,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193998044] [2025-03-08 19:11:05,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193998044] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:11:05,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:11:05,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 19:11:05,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056021243] [2025-03-08 19:11:05,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:11:05,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 19:11:05,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:11:05,279 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 19:11:05,279 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:11:05,280 INFO L87 Difference]: Start difference. First operand 4206 states and 5674 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 3 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-08 19:11:09,308 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 19:11:10,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:11:10,606 INFO L93 Difference]: Finished difference Result 9474 states and 12761 transitions. [2025-03-08 19:11:10,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 19:11:10,607 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 3 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 164 [2025-03-08 19:11:10,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:11:10,629 INFO L225 Difference]: With dead ends: 9474 [2025-03-08 19:11:10,629 INFO L226 Difference]: Without dead ends: 5300 [2025-03-08 19:11:10,641 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:10,641 INFO L435 NwaCegarLoop]: 1435 mSDtfsCounter, 366 mSDsluCounter, 1065 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 366 SdHoareTripleChecker+Valid, 2500 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2025-03-08 19:11:10,641 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [366 Valid, 2500 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 77 Invalid, 1 Unknown, 0 Unchecked, 5.2s Time] [2025-03-08 19:11:10,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5300 states. [2025-03-08 19:11:10,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5300 to 5292. [2025-03-08 19:11:10,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5292 states, 4005 states have (on average 1.3026217228464418) internal successors, (5217), 4073 states have internal predecessors, (5217), 937 states have call successors, (937), 350 states have call predecessors, (937), 349 states have return successors, (946), 928 states have call predecessors, (946), 936 states have call successors, (946) [2025-03-08 19:11:10,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5292 states to 5292 states and 7100 transitions. [2025-03-08 19:11:10,804 INFO L78 Accepts]: Start accepts. Automaton has 5292 states and 7100 transitions. Word has length 164 [2025-03-08 19:11:10,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:11:10,805 INFO L471 AbstractCegarLoop]: Abstraction has 5292 states and 7100 transitions. [2025-03-08 19:11:10,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 3 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-08 19:11:10,805 INFO L276 IsEmpty]: Start isEmpty. Operand 5292 states and 7100 transitions. [2025-03-08 19:11:10,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-03-08 19:11:10,810 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:11:10,811 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 19:11:10,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 19:11:10,811 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:11:10,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:11:10,811 INFO L85 PathProgramCache]: Analyzing trace with hash -322097169, now seen corresponding path program 1 times [2025-03-08 19:11:10,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:11:10,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631790100] [2025-03-08 19:11:10,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:11:10,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:11:12,690 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-03-08 19:11:12,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-03-08 19:11:12,731 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:11:12,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:11:12,988 INFO L134 CoverageAnalysis]: Checked inductivity of 344 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 316 trivial. 0 not checked. [2025-03-08 19:11:12,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:11:12,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631790100] [2025-03-08 19:11:12,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631790100] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:11:12,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:11:12,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 19:11:12,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554646191] [2025-03-08 19:11:12,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:11:12,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 19:11:12,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:11:12,989 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 19:11:12,989 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:11:12,989 INFO L87 Difference]: Start difference. First operand 5292 states and 7100 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-08 19:11:17,016 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 19:11:18,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:11:18,563 INFO L93 Difference]: Finished difference Result 12774 states and 17071 transitions. [2025-03-08 19:11:18,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 19:11:18,564 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 178 [2025-03-08 19:11:18,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:11:18,596 INFO L225 Difference]: With dead ends: 12774 [2025-03-08 19:11:18,596 INFO L226 Difference]: Without dead ends: 7514 [2025-03-08 19:11:18,611 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:18,612 INFO L435 NwaCegarLoop]: 1767 mSDtfsCounter, 851 mSDsluCounter, 951 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 851 SdHoareTripleChecker+Valid, 2718 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2025-03-08 19:11:18,612 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [851 Valid, 2718 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 88 Invalid, 1 Unknown, 0 Unchecked, 5.4s Time] [2025-03-08 19:11:18,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7514 states. [2025-03-08 19:11:18,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7514 to 7506. [2025-03-08 19:11:18,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7506 states, 5725 states have (on average 1.3046288209606987) internal successors, (7469), 5821 states have internal predecessors, (7469), 1253 states have call successors, (1253), 528 states have call predecessors, (1253), 527 states have return successors, (1262), 1240 states have call predecessors, (1262), 1252 states have call successors, (1262) [2025-03-08 19:11:18,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7506 states to 7506 states and 9984 transitions. [2025-03-08 19:11:18,866 INFO L78 Accepts]: Start accepts. Automaton has 7506 states and 9984 transitions. Word has length 178 [2025-03-08 19:11:18,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:11:18,867 INFO L471 AbstractCegarLoop]: Abstraction has 7506 states and 9984 transitions. [2025-03-08 19:11:18,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-08 19:11:18,867 INFO L276 IsEmpty]: Start isEmpty. Operand 7506 states and 9984 transitions. [2025-03-08 19:11:18,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2025-03-08 19:11:18,874 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:11:18,875 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 5, 5, 5, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 19:11:18,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 19:11:18,875 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:11:18,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:11:18,876 INFO L85 PathProgramCache]: Analyzing trace with hash -1125643003, now seen corresponding path program 1 times [2025-03-08 19:11:18,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:11:18,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194208463] [2025-03-08 19:11:18,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:11:18,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:11:21,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-03-08 19:11:21,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-03-08 19:11:21,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:11:21,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:11:21,614 INFO L134 CoverageAnalysis]: Checked inductivity of 373 backedges. 18 proven. 12 refuted. 0 times theorem prover too weak. 343 trivial. 0 not checked. [2025-03-08 19:11:21,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:11:21,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194208463] [2025-03-08 19:11:21,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194208463] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 19:11:21,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2014381110] [2025-03-08 19:11:21,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:11:21,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 19:11:21,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 19:11:21,617 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:21,618 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:24,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-03-08 19:11:24,504 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-03-08 19:11:24,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:11:24,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:11:24,516 INFO L256 TraceCheckSpWp]: Trace formula consists of 2934 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 19:11:24,524 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 19:11:27,283 INFO L134 CoverageAnalysis]: Checked inductivity of 373 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2025-03-08 19:11:27,283 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 19:11:27,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2014381110] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:11:27,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 19:11:27,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2025-03-08 19:11:27,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14334239] [2025-03-08 19:11:27,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:11:27,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 19:11:27,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:11:27,285 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 19:11:27,285 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-08 19:11:27,285 INFO L87 Difference]: Start difference. First operand 7506 states and 9984 transitions. Second operand has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 4 states have call successors, (21), 4 states have call predecessors, (21), 3 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2025-03-08 19:11:31,315 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:38,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:11:38,363 INFO L93 Difference]: Finished difference Result 22456 states and 29865 transitions. [2025-03-08 19:11:38,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 19:11:38,363 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 4 states have call successors, (21), 4 states have call predecessors, (21), 3 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) Word has length 197 [2025-03-08 19:11:38,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:11:38,433 INFO L225 Difference]: With dead ends: 22456 [2025-03-08 19:11:38,434 INFO L226 Difference]: Without dead ends: 22448 [2025-03-08 19:11:38,443 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-08 19:11:38,444 INFO L435 NwaCegarLoop]: 1425 mSDtfsCounter, 2579 mSDsluCounter, 1822 mSDsCounter, 0 mSdLazyCounter, 407 mSolverCounterSat, 187 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2579 SdHoareTripleChecker+Valid, 3247 SdHoareTripleChecker+Invalid, 595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 187 IncrementalHoareTripleChecker+Valid, 407 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.4s IncrementalHoareTripleChecker+Time [2025-03-08 19:11:38,444 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2579 Valid, 3247 Invalid, 595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [187 Valid, 407 Invalid, 1 Unknown, 0 Unchecked, 10.4s Time] [2025-03-08 19:11:38,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22448 states. [2025-03-08 19:11:39,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22448 to 22414. [2025-03-08 19:11:39,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22414 states, 17101 states have (on average 1.3055961639670195) internal successors, (22327), 17405 states have internal predecessors, (22327), 3733 states have call successors, (3733), 1580 states have call predecessors, (3733), 1579 states have return successors, (3762), 3680 states have call predecessors, (3762), 3732 states have call successors, (3762) [2025-03-08 19:11:39,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22414 states to 22414 states and 29822 transitions. [2025-03-08 19:11:39,137 INFO L78 Accepts]: Start accepts. Automaton has 22414 states and 29822 transitions. Word has length 197 [2025-03-08 19:11:39,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:11:39,138 INFO L471 AbstractCegarLoop]: Abstraction has 22414 states and 29822 transitions. [2025-03-08 19:11:39,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 4 states have call successors, (21), 4 states have call predecessors, (21), 3 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2025-03-08 19:11:39,138 INFO L276 IsEmpty]: Start isEmpty. Operand 22414 states and 29822 transitions. [2025-03-08 19:11:39,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2025-03-08 19:11:39,154 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:11:39,155 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 5, 5, 5, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 19:11:39,169 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 19:11:39,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-08 19:11:39,356 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:11:39,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:11:39,356 INFO L85 PathProgramCache]: Analyzing trace with hash -1593864107, now seen corresponding path program 1 times [2025-03-08 19:11:39,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:11:39,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499943667] [2025-03-08 19:11:39,357 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:11:39,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:11:41,264 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 207 statements into 1 equivalence classes. [2025-03-08 19:11:41,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 207 of 207 statements. [2025-03-08 19:11:41,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:11:41,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:11:41,817 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 28 proven. 12 refuted. 0 times theorem prover too weak. 395 trivial. 0 not checked. [2025-03-08 19:11:41,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:11:41,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499943667] [2025-03-08 19:11:41,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499943667] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 19:11:41,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1141688926] [2025-03-08 19:11:41,817 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:11:41,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 19:11:41,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 19:11:41,819 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 19:11:41,820 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 19:11:44,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 207 statements into 1 equivalence classes. [2025-03-08 19:11:44,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 207 of 207 statements. [2025-03-08 19:11:44,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:11:44,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:11:44,889 INFO L256 TraceCheckSpWp]: Trace formula consists of 3019 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 19:11:44,894 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 19:11:47,282 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 307 trivial. 0 not checked. [2025-03-08 19:11:47,283 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 19:11:47,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1141688926] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:11:47,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 19:11:47,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-08 19:11:47,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018404658] [2025-03-08 19:11:47,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:11:47,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 19:11:47,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:11:47,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 19:11:47,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 19:11:47,284 INFO L87 Difference]: Start difference. First operand 22414 states and 29822 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 3 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21)