./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-net-can-usb-ems_usb.ko.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.0/usb_urb-drivers-net-can-usb-ems_usb.ko.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 01d4ebb86f2bde0df0d47bbd5d9b632b620f2501e68770553e85fb2bb5a7d15a --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 18:22:38,480 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 18:22:38,535 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-08 18:22:38,541 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 18:22:38,541 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 18:22:38,558 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 18:22:38,558 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 18:22:38,559 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 18:22:38,559 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 18:22:38,559 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 18:22:38,559 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 18:22:38,559 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 18:22:38,559 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 18:22:38,559 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 18:22:38,560 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 18:22:38,560 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 18:22:38,560 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 18:22:38,560 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 18:22:38,560 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 18:22:38,560 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 18:22:38,560 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 18:22:38,560 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 18:22:38,560 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 18:22:38,560 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 18:22:38,560 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 18:22:38,561 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 18:22:38,561 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 18:22:38,561 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 18:22:38,561 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 18:22:38,561 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 18:22:38,561 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 18:22:38,561 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 18:22:38,561 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 18:22:38,561 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 18:22:38,561 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 18:22:38,561 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 18:22:38,562 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 18:22:38,562 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 18:22:38,562 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 18:22:38,562 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 18:22:38,562 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 -> 01d4ebb86f2bde0df0d47bbd5d9b632b620f2501e68770553e85fb2bb5a7d15a [2025-03-08 18:22:38,772 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 18:22:38,779 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 18:22:38,780 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 18:22:38,781 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 18:22:38,781 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 18:22:38,782 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-net-can-usb-ems_usb.ko.cil.out.i [2025-03-08 18:22:39,894 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/056fb9bc9/ec57acf49ab74aaca1fd7609a6a6aa4f/FLAGd256b91d9 [2025-03-08 18:22:40,404 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 18:22:40,405 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-net-can-usb-ems_usb.ko.cil.out.i [2025-03-08 18:22:40,441 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/056fb9bc9/ec57acf49ab74aaca1fd7609a6a6aa4f/FLAGd256b91d9 [2025-03-08 18:22:40,457 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/056fb9bc9/ec57acf49ab74aaca1fd7609a6a6aa4f [2025-03-08 18:22:40,460 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 18:22:40,461 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 18:22:40,462 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 18:22:40,462 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 18:22:40,466 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 18:22:40,467 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 06:22:40" (1/1) ... [2025-03-08 18:22:40,467 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ca5c37a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:22:40, skipping insertion in model container [2025-03-08 18:22:40,467 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 06:22:40" (1/1) ... [2025-03-08 18:22:40,522 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 18:22:41,512 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.0/usb_urb-drivers-net-can-usb-ems_usb.ko.cil.out.i[191320,191333] [2025-03-08 18:22:41,561 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 18:22:41,593 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 18:22:41,717 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile (".section .smp_locks,\"a\"\n" ".balign 4\n" ".long 671f - .\n" ".previous\n" "671:" "\n\tlock; " "bts %1,%0": "+m" (*((long volatile *)addr)): "Ir" (nr): "memory"); [4831-4837] [2025-03-08 18:22:41,720 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile (".section .smp_locks,\"a\"\n" ".balign 4\n" ".long 671f - .\n" ".previous\n" "671:" "\n\tlock; " "btr %1,%0": "+m" (*((long volatile *)addr)): "Ir" (nr)); [4844-4850] [2025-03-08 18:22:41,721 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile (".section .smp_locks,\"a\"\n" ".balign 4\n" ".long 671f - .\n" ".previous\n" "671:" "\n\tlock; " "btr %2,%1\n\t" "sbb %0,%0": "=r" (oldbit), "+m" (*((long volatile *)addr)): "Ir" (nr): "memory"); [4857-4864] [2025-03-08 18:22:41,722 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile (".section .smp_locks,\"a\"\n" ".balign 4\n" ".long 671f - .\n" ".previous\n" "671:" "\n\tlock; " "incl %0": "+m" (v->counter)); [4894-4900] [2025-03-08 18:22:41,722 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile (".section .smp_locks,\"a\"\n" ".balign 4\n" ".long 671f - .\n" ".previous\n" "671:" "\n\tlock; " "decl %0": "+m" (v->counter)); [4907-4913] [2025-03-08 18:22:41,778 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("1:\tud2\n" ".pushsection __bug_table,\"a\"\n" "2:\t.long 1b - 2b, %c0 - 2b\n" "\t.word %c1, 0\n" "\t.org 2b+%c2\n" ".popsection": : "i" ("/anthill/stuff/tacas-comp/work/current--X--drivers/net/can/usb/ems_usb.ko--X--bulklinux-3.0.1--X--68_1/linux-3.0.1/csd_deg_dscv/11/dscv_tempdir/dscv/ri/68_1/drivers/net/can/usb/ems_usb.c.common.c"), "i" (510), "i" (sizeof(struct bug_entry ))); [5717-5723] [2025-03-08 18:22:41,837 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.0/usb_urb-drivers-net-can-usb-ems_usb.ko.cil.out.i[191320,191333] [2025-03-08 18:22:41,851 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 18:22:41,998 INFO L204 MainTranslator]: Completed translation [2025-03-08 18:22:41,998 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:22:41 WrapperNode [2025-03-08 18:22:41,998 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 18:22:41,999 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 18:22:41,999 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 18:22:42,000 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 18:22:42,004 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:22:41" (1/1) ... [2025-03-08 18:22:42,047 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:22:41" (1/1) ... [2025-03-08 18:22:42,119 INFO L138 Inliner]: procedures = 132, calls = 778, calls flagged for inlining = 54, calls inlined = 44, statements flattened = 1635 [2025-03-08 18:22:42,120 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 18:22:42,120 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 18:22:42,120 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 18:22:42,121 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 18:22:42,127 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:22:41" (1/1) ... [2025-03-08 18:22:42,128 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:22:41" (1/1) ... [2025-03-08 18:22:42,144 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:22:41" (1/1) ... [2025-03-08 18:22:42,254 INFO L175 MemorySlicer]: Split 342 memory accesses to 8 slices as follows [2, 261, 10, 8, 8, 8, 42, 3]. 76 percent of accesses are in the largest equivalence class. The 34 initializations are split as follows [2, 8, 0, 8, 8, 8, 0, 0]. The 214 writes are split as follows [0, 172, 0, 0, 0, 0, 42, 0]. [2025-03-08 18:22:42,258 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:22:41" (1/1) ... [2025-03-08 18:22:42,259 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:22:41" (1/1) ... [2025-03-08 18:22:42,318 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:22:41" (1/1) ... [2025-03-08 18:22:42,321 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:22:41" (1/1) ... [2025-03-08 18:22:42,327 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:22:41" (1/1) ... [2025-03-08 18:22:42,333 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:22:41" (1/1) ... [2025-03-08 18:22:42,346 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 18:22:42,347 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 18:22:42,348 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 18:22:42,348 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 18:22:42,349 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:22:41" (1/1) ... [2025-03-08 18:22:42,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 18:22:42,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 18:22:42,375 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 18:22:42,379 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 18:22:42,399 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_set [2025-03-08 18:22:42,399 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_set [2025-03-08 18:22:42,399 INFO L130 BoogieDeclarations]: Found specification of procedure ems_usb_init [2025-03-08 18:22:42,399 INFO L138 BoogieDeclarations]: Found implementation of procedure ems_usb_init [2025-03-08 18:22:42,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-03-08 18:22:42,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-03-08 18:22:42,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-03-08 18:22:42,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-03-08 18:22:42,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-03-08 18:22:42,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-03-08 18:22:42,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2025-03-08 18:22:42,400 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2025-03-08 18:22:42,400 INFO L130 BoogieDeclarations]: Found specification of procedure usb_submit_urb [2025-03-08 18:22:42,400 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_submit_urb [2025-03-08 18:22:42,400 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#0 [2025-03-08 18:22:42,400 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#1 [2025-03-08 18:22:42,400 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#2 [2025-03-08 18:22:42,400 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#3 [2025-03-08 18:22:42,400 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#4 [2025-03-08 18:22:42,400 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#5 [2025-03-08 18:22:42,400 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#6 [2025-03-08 18:22:42,400 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#7 [2025-03-08 18:22:42,400 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-03-08 18:22:42,400 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-03-08 18:22:42,400 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-03-08 18:22:42,400 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-03-08 18:22:42,400 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-03-08 18:22:42,400 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2025-03-08 18:22:42,401 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2025-03-08 18:22:42,402 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#7 [2025-03-08 18:22:42,402 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 18:22:42,402 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 18:22:42,402 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-08 18:22:42,402 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-08 18:22:42,402 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-08 18:22:42,403 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-08 18:22:42,403 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-08 18:22:42,403 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-08 18:22:42,403 INFO L130 BoogieDeclarations]: Found specification of procedure netif_tx_start_queue [2025-03-08 18:22:42,403 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_tx_start_queue [2025-03-08 18:22:42,403 INFO L130 BoogieDeclarations]: Found specification of procedure ems_usb_control_cmd [2025-03-08 18:22:42,403 INFO L138 BoogieDeclarations]: Found implementation of procedure ems_usb_control_cmd [2025-03-08 18:22:42,403 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2025-03-08 18:22:42,403 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2025-03-08 18:22:42,403 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2025-03-08 18:22:42,403 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2025-03-08 18:22:42,403 INFO L130 BoogieDeclarations]: Found specification of procedure ems_usb_exit [2025-03-08 18:22:42,403 INFO L138 BoogieDeclarations]: Found implementation of procedure ems_usb_exit [2025-03-08 18:22:42,403 INFO L130 BoogieDeclarations]: Found specification of procedure usb_kill_anchored_urbs [2025-03-08 18:22:42,403 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_kill_anchored_urbs [2025-03-08 18:22:42,404 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2025-03-08 18:22:42,404 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2025-03-08 18:22:42,404 INFO L130 BoogieDeclarations]: Found specification of procedure init_usb_anchor [2025-03-08 18:22:42,404 INFO L138 BoogieDeclarations]: Found implementation of procedure init_usb_anchor [2025-03-08 18:22:42,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 18:22:42,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 18:22:42,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-08 18:22:42,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-08 18:22:42,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-08 18:22:42,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-08 18:22:42,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-08 18:22:42,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-08 18:22:42,405 INFO L130 BoogieDeclarations]: Found specification of procedure usb_fill_bulk_urb [2025-03-08 18:22:42,406 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_fill_bulk_urb [2025-03-08 18:22:42,406 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume_stop [2025-03-08 18:22:42,406 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume_stop [2025-03-08 18:22:42,406 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_return_value [2025-03-08 18:22:42,406 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_return_value [2025-03-08 18:22:42,406 INFO L130 BoogieDeclarations]: Found specification of procedure netif_stop_queue [2025-03-08 18:22:42,406 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_stop_queue [2025-03-08 18:22:42,406 INFO L130 BoogieDeclarations]: Found specification of procedure ems_usb_command_msg [2025-03-08 18:22:42,406 INFO L138 BoogieDeclarations]: Found implementation of procedure ems_usb_command_msg [2025-03-08 18:22:42,406 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-08 18:22:42,406 INFO L130 BoogieDeclarations]: Found specification of procedure unlink_all_urbs [2025-03-08 18:22:42,406 INFO L138 BoogieDeclarations]: Found implementation of procedure unlink_all_urbs [2025-03-08 18:22:42,406 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 18:22:42,406 INFO L130 BoogieDeclarations]: Found specification of procedure consume_skb [2025-03-08 18:22:42,406 INFO L138 BoogieDeclarations]: Found implementation of procedure consume_skb [2025-03-08 18:22:42,406 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-08 18:22:42,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-08 18:22:42,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-08 18:22:42,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-08 18:22:42,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-08 18:22:42,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-03-08 18:22:42,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-03-08 18:22:42,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-03-08 18:22:42,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-03-08 18:22:42,407 INFO L130 BoogieDeclarations]: Found specification of procedure ems_usb_write_mode [2025-03-08 18:22:42,407 INFO L138 BoogieDeclarations]: Found implementation of procedure ems_usb_write_mode [2025-03-08 18:22:42,407 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_coherent [2025-03-08 18:22:42,407 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_coherent [2025-03-08 18:22:42,407 INFO L130 BoogieDeclarations]: Found specification of procedure usb_alloc_coherent [2025-03-08 18:22:42,407 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_alloc_coherent [2025-03-08 18:22:42,408 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-08 18:22:42,408 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-08 18:22:42,408 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-08 18:22:42,408 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-08 18:22:42,408 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-03-08 18:22:42,408 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-03-08 18:22:42,408 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-03-08 18:22:42,408 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-03-08 18:22:42,408 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_dec [2025-03-08 18:22:42,408 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_dec [2025-03-08 18:22:42,408 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_urb [2025-03-08 18:22:42,408 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_urb [2025-03-08 18:22:42,408 INFO L130 BoogieDeclarations]: Found specification of procedure usb_anchor_urb [2025-03-08 18:22:42,408 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_anchor_urb [2025-03-08 18:22:42,408 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_blast_assert [2025-03-08 18:22:42,408 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_blast_assert [2025-03-08 18:22:42,408 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 18:22:42,408 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2025-03-08 18:22:42,408 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2025-03-08 18:22:42,408 INFO L130 BoogieDeclarations]: Found specification of procedure dev_err [2025-03-08 18:22:42,408 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_err [2025-03-08 18:22:42,408 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2025-03-08 18:22:42,408 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2025-03-08 18:22:42,408 INFO L130 BoogieDeclarations]: Found specification of procedure netif_device_detach [2025-03-08 18:22:42,408 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_device_detach [2025-03-08 18:22:42,408 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_priv [2025-03-08 18:22:42,408 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_priv [2025-03-08 18:22:42,409 INFO L130 BoogieDeclarations]: Found specification of procedure usb_unanchor_urb [2025-03-08 18:22:42,409 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_unanchor_urb [2025-03-08 18:22:42,409 INFO L130 BoogieDeclarations]: Found specification of procedure usb_set_intfdata [2025-03-08 18:22:42,409 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_set_intfdata [2025-03-08 18:22:42,409 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_get_tx_queue [2025-03-08 18:22:42,409 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_get_tx_queue [2025-03-08 18:22:42,409 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undefined_pointer [2025-03-08 18:22:42,409 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undefined_pointer [2025-03-08 18:22:42,409 INFO L130 BoogieDeclarations]: Found specification of procedure close_candev [2025-03-08 18:22:42,409 INFO L138 BoogieDeclarations]: Found implementation of procedure close_candev [2025-03-08 18:22:42,409 INFO L130 BoogieDeclarations]: Found specification of procedure dev_warn [2025-03-08 18:22:42,409 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_warn [2025-03-08 18:22:42,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 18:22:42,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 18:22:42,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 18:22:42,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-08 18:22:42,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-08 18:22:42,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-08 18:22:42,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-08 18:22:42,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-08 18:22:42,409 INFO L130 BoogieDeclarations]: Found specification of procedure free_candev [2025-03-08 18:22:42,409 INFO L138 BoogieDeclarations]: Found implementation of procedure free_candev [2025-03-08 18:22:42,409 INFO L130 BoogieDeclarations]: Found specification of procedure usb_alloc_urb [2025-03-08 18:22:42,409 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_alloc_urb [2025-03-08 18:22:42,409 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#0 [2025-03-08 18:22:42,409 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#1 [2025-03-08 18:22:42,409 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#2 [2025-03-08 18:22:42,409 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#3 [2025-03-08 18:22:42,409 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#4 [2025-03-08 18:22:42,409 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#5 [2025-03-08 18:22:42,409 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#6 [2025-03-08 18:22:42,409 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#7 [2025-03-08 18:22:42,409 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 18:22:42,410 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 18:22:42,684 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 18:22:42,686 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 18:22:42,767 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7025: havoc usb_register_driver_#t~nondet398#1; [2025-03-08 18:22:42,779 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7029: havoc #t~nondet399; [2025-03-08 18:22:42,817 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5809: call ULTIMATE.dealloc(~#cmd~0.base, ~#cmd~0.offset);havoc ~#cmd~0.base, ~#cmd~0.offset; [2025-03-08 18:22:42,842 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5248: havoc #t~mem35;havoc #t~bitwise36; [2025-03-08 18:22:42,861 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6912: havoc #t~malloc381.base, #t~malloc381.offset; [2025-03-08 18:22:42,990 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_assume_stopFINAL: assume true; [2025-03-08 18:22:43,107 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5780: call ULTIMATE.dealloc(~#actual_length~0#1.base, ~#actual_length~0#1.offset);havoc ~#actual_length~0#1.base, ~#actual_length~0#1.offset; [2025-03-08 18:22:43,107 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7015: havoc usb_bulk_msg_#t~nondet397#1; [2025-03-08 18:22:43,122 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7036: havoc usb_unlink_urb_#t~nondet400#1; [2025-03-08 18:22:43,182 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7001: havoc #t~nondet395; [2025-03-08 18:22:43,187 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6956: havoc #t~nondet387; [2025-03-08 18:22:43,206 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6915: havoc __kmalloc_#t~ret382#1.base, __kmalloc_#t~ret382#1.offset; [2025-03-08 18:22:43,222 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6963: havoc dev_set_drvdata_#t~nondet389#1; [2025-03-08 18:22:43,229 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4970: havoc #t~mem10.base, #t~mem10.offset; [2025-03-08 18:22:43,232 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6982: havoc #t~ret391.base, #t~ret391.offset; [2025-03-08 18:22:43,237 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6967: havoc #t~nondet390; [2025-03-08 18:22:48,521 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7005: havoc register_candev_#t~nondet396#1; [2025-03-08 18:22:48,521 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6959: havoc dev_get_drvdata_#t~ret388#1.base, dev_get_drvdata_#t~ret388#1.offset; [2025-03-08 18:22:48,521 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4881: havoc atomic_read_#t~mem4#1; [2025-03-08 18:22:48,521 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6997: havoc open_candev_#t~nondet394#1; [2025-03-08 18:22:48,521 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6934: havoc alloc_candev_#t~ret386#1.base, alloc_candev_#t~ret386#1.offset; [2025-03-08 18:22:48,521 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6673: assume false; [2025-03-08 18:22:48,521 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6673: assume !false; [2025-03-08 18:22:48,630 INFO L? ?]: Removed 597 outVars from TransFormulas that were not future-live. [2025-03-08 18:22:48,630 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 18:22:48,658 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 18:22:48,658 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 18:22:48,659 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 06:22:48 BoogieIcfgContainer [2025-03-08 18:22:48,659 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 18:22:48,661 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 18:22:48,661 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 18:22:48,664 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 18:22:48,664 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 06:22:40" (1/3) ... [2025-03-08 18:22:48,665 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68c59ca9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 06:22:48, skipping insertion in model container [2025-03-08 18:22:48,665 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:22:41" (2/3) ... [2025-03-08 18:22:48,665 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68c59ca9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 06:22:48, skipping insertion in model container [2025-03-08 18:22:48,665 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 06:22:48" (3/3) ... [2025-03-08 18:22:48,666 INFO L128 eAbstractionObserver]: Analyzing ICFG usb_urb-drivers-net-can-usb-ems_usb.ko.cil.out.i [2025-03-08 18:22:48,678 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 18:22:48,680 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG usb_urb-drivers-net-can-usb-ems_usb.ko.cil.out.i that has 39 procedures, 504 locations, 1 initial locations, 16 loop locations, and 1 error locations. [2025-03-08 18:22:48,729 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 18:22:48,737 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;@6fc52fe3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 18:22:48,737 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 18:22:48,742 INFO L276 IsEmpty]: Start isEmpty. Operand has 503 states, 354 states have (on average 1.3163841807909604) internal successors, (466), 364 states have internal predecessors, (466), 112 states have call successors, (112), 38 states have call predecessors, (112), 37 states have return successors, (110), 108 states have call predecessors, (110), 110 states have call successors, (110) [2025-03-08 18:22:48,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-08 18:22:48,746 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:22:48,747 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 18:22:48,747 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:22:48,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:22:48,751 INFO L85 PathProgramCache]: Analyzing trace with hash 742053920, now seen corresponding path program 1 times [2025-03-08 18:22:48,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:22:48,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665979905] [2025-03-08 18:22:48,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:22:48,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:22:50,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-08 18:22:50,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-08 18:22:50,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:22:50,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:22:51,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 18:22:51,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:22:51,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665979905] [2025-03-08 18:22:51,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665979905] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 18:22:51,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 18:22:51,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 18:22:51,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115041332] [2025-03-08 18:22:51,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:22:51,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 18:22:51,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:22:51,548 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 18:22:51,549 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 18:22:51,552 INFO L87 Difference]: Start difference. First operand has 503 states, 354 states have (on average 1.3163841807909604) internal successors, (466), 364 states have internal predecessors, (466), 112 states have call successors, (112), 38 states have call predecessors, (112), 37 states have return successors, (110), 108 states have call predecessors, (110), 110 states have call successors, (110) Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 18:22:51,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:22:51,996 INFO L93 Difference]: Finished difference Result 990 states and 1378 transitions. [2025-03-08 18:22:51,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 18:22:52,000 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2025-03-08 18:22:52,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:22:52,010 INFO L225 Difference]: With dead ends: 990 [2025-03-08 18:22:52,010 INFO L226 Difference]: Without dead ends: 496 [2025-03-08 18:22:52,017 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 18:22:52,019 INFO L435 NwaCegarLoop]: 647 mSDtfsCounter, 0 mSDsluCounter, 1934 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2581 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 18:22:52,020 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2581 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 18:22:52,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2025-03-08 18:22:52,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 496. [2025-03-08 18:22:52,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 496 states, 348 states have (on average 1.2586206896551724) internal successors, (438), 356 states have internal predecessors, (438), 110 states have call successors, (110), 37 states have call predecessors, (110), 37 states have return successors, (107), 105 states have call predecessors, (107), 106 states have call successors, (107) [2025-03-08 18:22:52,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 655 transitions. [2025-03-08 18:22:52,083 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 655 transitions. Word has length 21 [2025-03-08 18:22:52,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:22:52,085 INFO L471 AbstractCegarLoop]: Abstraction has 496 states and 655 transitions. [2025-03-08 18:22:52,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 18:22:52,085 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 655 transitions. [2025-03-08 18:22:52,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-08 18:22:52,086 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:22:52,086 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 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 18:22:52,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 18:22:52,086 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:22:52,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:22:52,087 INFO L85 PathProgramCache]: Analyzing trace with hash -1043769579, now seen corresponding path program 1 times [2025-03-08 18:22:52,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:22:52,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088376694] [2025-03-08 18:22:52,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:22:52,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:22:53,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-08 18:22:53,844 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-08 18:22:53,845 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:22:53,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:22:54,026 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 18:22:54,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:22:54,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088376694] [2025-03-08 18:22:54,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088376694] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 18:22:54,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 18:22:54,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 18:22:54,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644966867] [2025-03-08 18:22:54,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:22:54,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 18:22:54,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:22:54,029 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 18:22:54,030 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 18:22:54,031 INFO L87 Difference]: Start difference. First operand 496 states and 655 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-08 18:22:54,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:22:54,311 INFO L93 Difference]: Finished difference Result 1444 states and 1922 transitions. [2025-03-08 18:22:54,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 18:22:54,311 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 26 [2025-03-08 18:22:54,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:22:54,321 INFO L225 Difference]: With dead ends: 1444 [2025-03-08 18:22:54,322 INFO L226 Difference]: Without dead ends: 968 [2025-03-08 18:22:54,327 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 18:22:54,328 INFO L435 NwaCegarLoop]: 798 mSDtfsCounter, 639 mSDsluCounter, 612 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 639 SdHoareTripleChecker+Valid, 1410 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 18:22:54,329 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [639 Valid, 1410 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 18:22:54,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 968 states. [2025-03-08 18:22:54,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 968 to 964. [2025-03-08 18:22:54,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 964 states, 678 states have (on average 1.2595870206489677) internal successors, (854), 690 states have internal predecessors, (854), 213 states have call successors, (213), 72 states have call predecessors, (213), 72 states have return successors, (213), 206 states have call predecessors, (213), 209 states have call successors, (213) [2025-03-08 18:22:54,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 964 states to 964 states and 1280 transitions. [2025-03-08 18:22:54,395 INFO L78 Accepts]: Start accepts. Automaton has 964 states and 1280 transitions. Word has length 26 [2025-03-08 18:22:54,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:22:54,396 INFO L471 AbstractCegarLoop]: Abstraction has 964 states and 1280 transitions. [2025-03-08 18:22:54,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-08 18:22:54,396 INFO L276 IsEmpty]: Start isEmpty. Operand 964 states and 1280 transitions. [2025-03-08 18:22:54,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-08 18:22:54,397 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:22:54,397 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 18:22:54,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 18:22:54,397 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:22:54,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:22:54,399 INFO L85 PathProgramCache]: Analyzing trace with hash 2002334851, now seen corresponding path program 1 times [2025-03-08 18:22:54,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:22:54,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758054919] [2025-03-08 18:22:54,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:22:54,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:22:55,984 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-08 18:22:56,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-08 18:22:56,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:22:56,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:22:56,159 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 18:22:56,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:22:56,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758054919] [2025-03-08 18:22:56,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758054919] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 18:22:56,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 18:22:56,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 18:22:56,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394204228] [2025-03-08 18:22:56,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:22:56,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 18:22:56,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:22:56,161 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 18:22:56,161 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 18:22:56,161 INFO L87 Difference]: Start difference. First operand 964 states and 1280 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-08 18:22:56,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:22:56,414 INFO L93 Difference]: Finished difference Result 2849 states and 3799 transitions. [2025-03-08 18:22:56,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 18:22:56,415 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 27 [2025-03-08 18:22:56,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:22:56,425 INFO L225 Difference]: With dead ends: 2849 [2025-03-08 18:22:56,425 INFO L226 Difference]: Without dead ends: 1897 [2025-03-08 18:22:56,429 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 18:22:56,430 INFO L435 NwaCegarLoop]: 651 mSDtfsCounter, 638 mSDsluCounter, 615 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 638 SdHoareTripleChecker+Valid, 1266 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 18:22:56,430 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [638 Valid, 1266 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 18:22:56,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1897 states. [2025-03-08 18:22:56,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1897 to 1886. [2025-03-08 18:22:56,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1886 states, 1327 states have (on average 1.2577241899020346) internal successors, (1669), 1346 states have internal predecessors, (1669), 418 states have call successors, (418), 141 states have call predecessors, (418), 140 states have return successors, (424), 406 states have call predecessors, (424), 414 states have call successors, (424) [2025-03-08 18:22:56,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1886 states to 1886 states and 2511 transitions. [2025-03-08 18:22:56,508 INFO L78 Accepts]: Start accepts. Automaton has 1886 states and 2511 transitions. Word has length 27 [2025-03-08 18:22:56,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:22:56,508 INFO L471 AbstractCegarLoop]: Abstraction has 1886 states and 2511 transitions. [2025-03-08 18:22:56,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-08 18:22:56,508 INFO L276 IsEmpty]: Start isEmpty. Operand 1886 states and 2511 transitions. [2025-03-08 18:22:56,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-08 18:22:56,511 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:22:56,511 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 18:22:56,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 18:22:56,511 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:22:56,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:22:56,512 INFO L85 PathProgramCache]: Analyzing trace with hash -2119653834, now seen corresponding path program 1 times [2025-03-08 18:22:56,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:22:56,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490723615] [2025-03-08 18:22:56,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:22:56,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:22:58,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-08 18:22:58,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-08 18:22:58,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:22:58,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:22:58,438 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 18:22:58,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:22:58,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490723615] [2025-03-08 18:22:58,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490723615] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 18:22:58,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 18:22:58,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 18:22:58,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497451045] [2025-03-08 18:22:58,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:22:58,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 18:22:58,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:22:58,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 18:22:58,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 18:22:58,439 INFO L87 Difference]: Start difference. First operand 1886 states and 2511 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-08 18:22:58,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:22:58,700 INFO L93 Difference]: Finished difference Result 4648 states and 6400 transitions. [2025-03-08 18:22:58,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 18:22:58,701 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 73 [2025-03-08 18:22:58,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:22:58,715 INFO L225 Difference]: With dead ends: 4648 [2025-03-08 18:22:58,715 INFO L226 Difference]: Without dead ends: 2777 [2025-03-08 18:22:58,721 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 18:22:58,722 INFO L435 NwaCegarLoop]: 692 mSDtfsCounter, 256 mSDsluCounter, 576 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 341 SdHoareTripleChecker+Valid, 1268 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 18:22:58,723 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [341 Valid, 1268 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 18:22:58,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2777 states. [2025-03-08 18:22:58,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2777 to 2765. [2025-03-08 18:22:58,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2765 states, 1954 states have (on average 1.2922210849539406) internal successors, (2525), 1989 states have internal predecessors, (2525), 670 states have call successors, (670), 141 states have call predecessors, (670), 140 states have return successors, (684), 650 states have call predecessors, (684), 666 states have call successors, (684) [2025-03-08 18:22:58,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2765 states to 2765 states and 3879 transitions. [2025-03-08 18:22:58,817 INFO L78 Accepts]: Start accepts. Automaton has 2765 states and 3879 transitions. Word has length 73 [2025-03-08 18:22:58,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:22:58,817 INFO L471 AbstractCegarLoop]: Abstraction has 2765 states and 3879 transitions. [2025-03-08 18:22:58,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-08 18:22:58,818 INFO L276 IsEmpty]: Start isEmpty. Operand 2765 states and 3879 transitions. [2025-03-08 18:22:58,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-08 18:22:58,823 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:22:58,823 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 18:22:58,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 18:22:58,823 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:22:58,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:22:58,824 INFO L85 PathProgramCache]: Analyzing trace with hash -1458520570, now seen corresponding path program 1 times [2025-03-08 18:22:58,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:22:58,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627120371] [2025-03-08 18:22:58,824 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:22:58,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:23:00,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-08 18:23:00,259 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-08 18:23:00,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:23:00,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:23:00,551 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-08 18:23:00,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:23:00,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627120371] [2025-03-08 18:23:00,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627120371] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 18:23:00,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 18:23:00,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 18:23:00,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339694793] [2025-03-08 18:23:00,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:23:00,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 18:23:00,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:23:00,553 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 18:23:00,553 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 18:23:00,553 INFO L87 Difference]: Start difference. First operand 2765 states and 3879 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-08 18:23:00,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:23:00,852 INFO L93 Difference]: Finished difference Result 5530 states and 7763 transitions. [2025-03-08 18:23:00,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 18:23:00,852 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 80 [2025-03-08 18:23:00,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:23:00,865 INFO L225 Difference]: With dead ends: 5530 [2025-03-08 18:23:00,865 INFO L226 Difference]: Without dead ends: 2781 [2025-03-08 18:23:00,872 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 18:23:00,873 INFO L435 NwaCegarLoop]: 637 mSDtfsCounter, 0 mSDsluCounter, 1266 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1903 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 18:23:00,873 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1903 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 18:23:00,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2781 states. [2025-03-08 18:23:00,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2781 to 2781. [2025-03-08 18:23:00,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2781 states, 1970 states have (on average 1.2898477157360406) internal successors, (2541), 2005 states have internal predecessors, (2541), 670 states have call successors, (670), 141 states have call predecessors, (670), 140 states have return successors, (684), 650 states have call predecessors, (684), 666 states have call successors, (684) [2025-03-08 18:23:00,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2781 states to 2781 states and 3895 transitions. [2025-03-08 18:23:00,950 INFO L78 Accepts]: Start accepts. Automaton has 2781 states and 3895 transitions. Word has length 80 [2025-03-08 18:23:00,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:23:00,950 INFO L471 AbstractCegarLoop]: Abstraction has 2781 states and 3895 transitions. [2025-03-08 18:23:00,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-08 18:23:00,951 INFO L276 IsEmpty]: Start isEmpty. Operand 2781 states and 3895 transitions. [2025-03-08 18:23:00,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-08 18:23:00,953 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:23:00,953 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 18:23:00,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 18:23:00,953 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:23:00,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:23:00,954 INFO L85 PathProgramCache]: Analyzing trace with hash 1951449886, now seen corresponding path program 1 times [2025-03-08 18:23:00,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:23:00,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467392898] [2025-03-08 18:23:00,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:23:00,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:23:02,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-08 18:23:02,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-08 18:23:02,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:23:02,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:23:03,059 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-08 18:23:03,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:23:03,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467392898] [2025-03-08 18:23:03,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467392898] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 18:23:03,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 18:23:03,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 18:23:03,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695493038] [2025-03-08 18:23:03,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:23:03,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 18:23:03,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:23:03,060 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 18:23:03,060 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 18:23:03,060 INFO L87 Difference]: Start difference. First operand 2781 states and 3895 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-08 18:23:03,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:23:03,562 INFO L93 Difference]: Finished difference Result 5562 states and 7795 transitions. [2025-03-08 18:23:03,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 18:23:03,562 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 81 [2025-03-08 18:23:03,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:23:03,576 INFO L225 Difference]: With dead ends: 5562 [2025-03-08 18:23:03,576 INFO L226 Difference]: Without dead ends: 2797 [2025-03-08 18:23:03,584 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 18:23:03,584 INFO L435 NwaCegarLoop]: 635 mSDtfsCounter, 0 mSDsluCounter, 2528 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3163 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 18:23:03,584 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3163 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 18:23:03,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2797 states. [2025-03-08 18:23:03,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2797 to 2797. [2025-03-08 18:23:03,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2797 states, 1986 states have (on average 1.2875125881168177) internal successors, (2557), 2021 states have internal predecessors, (2557), 670 states have call successors, (670), 141 states have call predecessors, (670), 140 states have return successors, (684), 650 states have call predecessors, (684), 666 states have call successors, (684) [2025-03-08 18:23:03,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2797 states to 2797 states and 3911 transitions. [2025-03-08 18:23:03,664 INFO L78 Accepts]: Start accepts. Automaton has 2797 states and 3911 transitions. Word has length 81 [2025-03-08 18:23:03,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:23:03,664 INFO L471 AbstractCegarLoop]: Abstraction has 2797 states and 3911 transitions. [2025-03-08 18:23:03,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-08 18:23:03,665 INFO L276 IsEmpty]: Start isEmpty. Operand 2797 states and 3911 transitions. [2025-03-08 18:23:03,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-08 18:23:03,668 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:23:03,668 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 18:23:03,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 18:23:03,668 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:23:03,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:23:03,669 INFO L85 PathProgramCache]: Analyzing trace with hash -1684060705, now seen corresponding path program 1 times [2025-03-08 18:23:03,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:23:03,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849916544] [2025-03-08 18:23:03,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:23:03,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:23:05,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-08 18:23:05,202 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-08 18:23:05,202 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:23:05,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:23:05,675 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-08 18:23:05,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:23:05,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849916544] [2025-03-08 18:23:05,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849916544] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 18:23:05,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 18:23:05,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 18:23:05,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901619418] [2025-03-08 18:23:05,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:23:05,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 18:23:05,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:23:05,678 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 18:23:05,678 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 18:23:05,678 INFO L87 Difference]: Start difference. First operand 2797 states and 3911 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-08 18:23:06,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:23:06,082 INFO L93 Difference]: Finished difference Result 5344 states and 7445 transitions. [2025-03-08 18:23:06,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 18:23:06,083 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) Word has length 81 [2025-03-08 18:23:06,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:23:06,096 INFO L225 Difference]: With dead ends: 5344 [2025-03-08 18:23:06,096 INFO L226 Difference]: Without dead ends: 2563 [2025-03-08 18:23:06,103 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 18:23:06,104 INFO L435 NwaCegarLoop]: 637 mSDtfsCounter, 0 mSDsluCounter, 1900 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2537 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 18:23:06,105 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2537 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 18:23:06,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2563 states. [2025-03-08 18:23:06,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2563 to 2563. [2025-03-08 18:23:06,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2563 states, 1828 states have (on average 1.2773522975929978) internal successors, (2335), 1845 states have internal predecessors, (2335), 594 states have call successors, (594), 139 states have call predecessors, (594), 140 states have return successors, (616), 586 states have call predecessors, (616), 590 states have call successors, (616) [2025-03-08 18:23:06,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2563 states to 2563 states and 3545 transitions. [2025-03-08 18:23:06,182 INFO L78 Accepts]: Start accepts. Automaton has 2563 states and 3545 transitions. Word has length 81 [2025-03-08 18:23:06,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:23:06,183 INFO L471 AbstractCegarLoop]: Abstraction has 2563 states and 3545 transitions. [2025-03-08 18:23:06,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-08 18:23:06,184 INFO L276 IsEmpty]: Start isEmpty. Operand 2563 states and 3545 transitions. [2025-03-08 18:23:06,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-08 18:23:06,185 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:23:06,185 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 18:23:06,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 18:23:06,185 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:23:06,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:23:06,186 INFO L85 PathProgramCache]: Analyzing trace with hash -2041010114, now seen corresponding path program 1 times [2025-03-08 18:23:06,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:23:06,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356383872] [2025-03-08 18:23:06,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:23:06,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:23:07,690 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-08 18:23:07,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-08 18:23:07,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:23:07,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:23:08,460 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 18:23:08,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:23:08,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356383872] [2025-03-08 18:23:08,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356383872] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 18:23:08,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 18:23:08,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 18:23:08,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824275409] [2025-03-08 18:23:08,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:23:08,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 18:23:08,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:23:08,461 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 18:23:08,461 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 18:23:08,461 INFO L87 Difference]: Start difference. First operand 2563 states and 3545 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-08 18:23:08,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:23:08,945 INFO L93 Difference]: Finished difference Result 4003 states and 5588 transitions. [2025-03-08 18:23:08,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 18:23:08,946 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 2 states have call successors, (9) Word has length 76 [2025-03-08 18:23:08,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:23:08,962 INFO L225 Difference]: With dead ends: 4003 [2025-03-08 18:23:08,962 INFO L226 Difference]: Without dead ends: 2591 [2025-03-08 18:23:08,966 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 18:23:08,967 INFO L435 NwaCegarLoop]: 637 mSDtfsCounter, 0 mSDsluCounter, 3181 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3818 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 18:23:08,967 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3818 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 18:23:08,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2591 states. [2025-03-08 18:23:09,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2591 to 2591. [2025-03-08 18:23:09,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2591 states, 1848 states have (on average 1.2743506493506493) internal successors, (2355), 1865 states have internal predecessors, (2355), 594 states have call successors, (594), 139 states have call predecessors, (594), 148 states have return successors, (640), 594 states have call predecessors, (640), 590 states have call successors, (640) [2025-03-08 18:23:09,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2591 states to 2591 states and 3589 transitions. [2025-03-08 18:23:09,033 INFO L78 Accepts]: Start accepts. Automaton has 2591 states and 3589 transitions. Word has length 76 [2025-03-08 18:23:09,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:23:09,034 INFO L471 AbstractCegarLoop]: Abstraction has 2591 states and 3589 transitions. [2025-03-08 18:23:09,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-08 18:23:09,034 INFO L276 IsEmpty]: Start isEmpty. Operand 2591 states and 3589 transitions. [2025-03-08 18:23:09,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-08 18:23:09,038 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:23:09,038 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 18:23:09,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 18:23:09,039 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:23:09,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:23:09,039 INFO L85 PathProgramCache]: Analyzing trace with hash 1859590396, now seen corresponding path program 1 times [2025-03-08 18:23:09,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:23:09,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936197736] [2025-03-08 18:23:09,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:23:09,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:23:10,620 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-08 18:23:10,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-08 18:23:10,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:23:10,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:23:11,526 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 18:23:11,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:23:11,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936197736] [2025-03-08 18:23:11,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936197736] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 18:23:11,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 18:23:11,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 18:23:11,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099160621] [2025-03-08 18:23:11,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:23:11,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 18:23:11,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:23:11,528 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 18:23:11,528 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-08 18:23:11,528 INFO L87 Difference]: Start difference. First operand 2591 states and 3589 transitions. Second operand has 10 states, 10 states have (on average 5.7) internal successors, (57), 7 states have internal predecessors, (57), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 5 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-08 18:23:12,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:23:12,580 INFO L93 Difference]: Finished difference Result 5178 states and 7195 transitions. [2025-03-08 18:23:12,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 18:23:12,581 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.7) internal successors, (57), 7 states have internal predecessors, (57), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 5 states have call predecessors, (9), 2 states have call successors, (9) Word has length 76 [2025-03-08 18:23:12,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:23:12,594 INFO L225 Difference]: With dead ends: 5178 [2025-03-08 18:23:12,594 INFO L226 Difference]: Without dead ends: 2603 [2025-03-08 18:23:12,600 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-08 18:23:12,604 INFO L435 NwaCegarLoop]: 644 mSDtfsCounter, 55 mSDsluCounter, 5063 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 5707 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-08 18:23:12,604 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 5707 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-08 18:23:12,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2603 states. [2025-03-08 18:23:12,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2603 to 2587. [2025-03-08 18:23:12,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2587 states, 1844 states have (on average 1.2706073752711498) internal successors, (2343), 1863 states have internal predecessors, (2343), 594 states have call successors, (594), 139 states have call predecessors, (594), 148 states have return successors, (640), 592 states have call predecessors, (640), 590 states have call successors, (640) [2025-03-08 18:23:12,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2587 states to 2587 states and 3577 transitions. [2025-03-08 18:23:12,687 INFO L78 Accepts]: Start accepts. Automaton has 2587 states and 3577 transitions. Word has length 76 [2025-03-08 18:23:12,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:23:12,688 INFO L471 AbstractCegarLoop]: Abstraction has 2587 states and 3577 transitions. [2025-03-08 18:23:12,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.7) internal successors, (57), 7 states have internal predecessors, (57), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 5 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-08 18:23:12,688 INFO L276 IsEmpty]: Start isEmpty. Operand 2587 states and 3577 transitions. [2025-03-08 18:23:12,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-08 18:23:12,690 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:23:12,690 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 18:23:12,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 18:23:12,690 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:23:12,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:23:12,691 INFO L85 PathProgramCache]: Analyzing trace with hash 790570015, now seen corresponding path program 1 times [2025-03-08 18:23:12,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:23:12,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051431740] [2025-03-08 18:23:12,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:23:12,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:23:14,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-08 18:23:14,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-08 18:23:14,264 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:23:14,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:23:14,884 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-08 18:23:14,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:23:14,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051431740] [2025-03-08 18:23:14,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051431740] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 18:23:14,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 18:23:14,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 18:23:14,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959838947] [2025-03-08 18:23:14,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:23:14,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 18:23:14,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:23:14,886 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 18:23:14,887 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 18:23:14,887 INFO L87 Difference]: Start difference. First operand 2587 states and 3577 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 5 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2025-03-08 18:23:18,914 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 18:23:23,066 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 18:23:32,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:23:32,541 INFO L93 Difference]: Finished difference Result 4026 states and 5617 transitions. [2025-03-08 18:23:32,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 18:23:32,541 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 5 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) Word has length 81 [2025-03-08 18:23:32,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:23:32,558 INFO L225 Difference]: With dead ends: 4026 [2025-03-08 18:23:32,558 INFO L226 Difference]: Without dead ends: 4021 [2025-03-08 18:23:32,560 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-08 18:23:32,560 INFO L435 NwaCegarLoop]: 979 mSDtfsCounter, 1305 mSDsluCounter, 1532 mSDsCounter, 0 mSdLazyCounter, 1462 mSolverCounterSat, 230 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1396 SdHoareTripleChecker+Valid, 2511 SdHoareTripleChecker+Invalid, 1694 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 230 IncrementalHoareTripleChecker+Valid, 1462 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.4s IncrementalHoareTripleChecker+Time [2025-03-08 18:23:32,560 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1396 Valid, 2511 Invalid, 1694 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [230 Valid, 1462 Invalid, 2 Unknown, 0 Unchecked, 17.4s Time] [2025-03-08 18:23:32,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4021 states. [2025-03-08 18:23:32,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4021 to 3991. [2025-03-08 18:23:32,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3991 states, 2842 states have (on average 1.274454609429979) internal successors, (3622), 2877 states have internal predecessors, (3622), 924 states have call successors, (924), 207 states have call predecessors, (924), 224 states have return successors, (1036), 922 states have call predecessors, (1036), 920 states have call successors, (1036) [2025-03-08 18:23:32,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3991 states to 3991 states and 5582 transitions. [2025-03-08 18:23:32,690 INFO L78 Accepts]: Start accepts. Automaton has 3991 states and 5582 transitions. Word has length 81 [2025-03-08 18:23:32,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:23:32,691 INFO L471 AbstractCegarLoop]: Abstraction has 3991 states and 5582 transitions. [2025-03-08 18:23:32,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 5 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2025-03-08 18:23:32,692 INFO L276 IsEmpty]: Start isEmpty. Operand 3991 states and 5582 transitions. [2025-03-08 18:23:32,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-08 18:23:32,694 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:23:32,694 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 18:23:32,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 18:23:32,695 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:23:32,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:23:32,695 INFO L85 PathProgramCache]: Analyzing trace with hash 787135690, now seen corresponding path program 1 times [2025-03-08 18:23:32,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:23:32,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249666257] [2025-03-08 18:23:32,695 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:23:32,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:23:34,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-08 18:23:34,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-08 18:23:34,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:23:34,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:23:34,734 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-08 18:23:34,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:23:34,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249666257] [2025-03-08 18:23:34,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249666257] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 18:23:34,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 18:23:34,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 18:23:34,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617052571] [2025-03-08 18:23:34,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:23:34,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 18:23:34,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:23:34,737 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 18:23:34,737 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 18:23:34,737 INFO L87 Difference]: Start difference. First operand 3991 states and 5582 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 18:23:35,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:23:35,164 INFO L93 Difference]: Finished difference Result 7323 states and 10265 transitions. [2025-03-08 18:23:35,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 18:23:35,165 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) Word has length 100 [2025-03-08 18:23:35,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:23:35,183 INFO L225 Difference]: With dead ends: 7323 [2025-03-08 18:23:35,183 INFO L226 Difference]: Without dead ends: 3348 [2025-03-08 18:23:35,193 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 18:23:35,194 INFO L435 NwaCegarLoop]: 638 mSDtfsCounter, 0 mSDsluCounter, 1904 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2542 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 18:23:35,194 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2542 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 18:23:35,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3348 states. [2025-03-08 18:23:35,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3348 to 3348. [2025-03-08 18:23:35,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3348 states, 2391 states have (on average 1.274780426599749) internal successors, (3048), 2417 states have internal predecessors, (3048), 773 states have call successors, (773), 168 states have call predecessors, (773), 183 states have return successors, (871), 778 states have call predecessors, (871), 769 states have call successors, (871) [2025-03-08 18:23:35,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3348 states to 3348 states and 4692 transitions. [2025-03-08 18:23:35,288 INFO L78 Accepts]: Start accepts. Automaton has 3348 states and 4692 transitions. Word has length 100 [2025-03-08 18:23:35,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:23:35,289 INFO L471 AbstractCegarLoop]: Abstraction has 3348 states and 4692 transitions. [2025-03-08 18:23:35,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 18:23:35,290 INFO L276 IsEmpty]: Start isEmpty. Operand 3348 states and 4692 transitions. [2025-03-08 18:23:35,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-08 18:23:35,292 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:23:35,292 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 18:23:35,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 18:23:35,292 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:23:35,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:23:35,293 INFO L85 PathProgramCache]: Analyzing trace with hash -494308315, now seen corresponding path program 1 times [2025-03-08 18:23:35,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:23:35,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748194527] [2025-03-08 18:23:35,293 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:23:35,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:23:36,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-08 18:23:36,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-08 18:23:36,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:23:36,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:23:37,343 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-08 18:23:37,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:23:37,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748194527] [2025-03-08 18:23:37,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748194527] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 18:23:37,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 18:23:37,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 18:23:37,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958152903] [2025-03-08 18:23:37,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:23:37,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 18:23:37,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:23:37,344 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 18:23:37,344 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 18:23:37,344 INFO L87 Difference]: Start difference. First operand 3348 states and 4692 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-08 18:23:37,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:23:37,726 INFO L93 Difference]: Finished difference Result 5984 states and 8382 transitions. [2025-03-08 18:23:37,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 18:23:37,727 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) Word has length 88 [2025-03-08 18:23:37,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:23:37,746 INFO L225 Difference]: With dead ends: 5984 [2025-03-08 18:23:37,746 INFO L226 Difference]: Without dead ends: 3138 [2025-03-08 18:23:37,783 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 18:23:37,783 INFO L435 NwaCegarLoop]: 637 mSDtfsCounter, 0 mSDsluCounter, 1904 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2541 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 18:23:37,784 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2541 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 18:23:37,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3138 states. [2025-03-08 18:23:37,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3138 to 3138. [2025-03-08 18:23:37,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3138 states, 2245 states have (on average 1.265924276169265) internal successors, (2842), 2257 states have internal predecessors, (2842), 709 states have call successors, (709), 166 states have call predecessors, (709), 183 states have return successors, (811), 726 states have call predecessors, (811), 705 states have call successors, (811) [2025-03-08 18:23:37,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3138 states to 3138 states and 4362 transitions. [2025-03-08 18:23:37,894 INFO L78 Accepts]: Start accepts. Automaton has 3138 states and 4362 transitions. Word has length 88 [2025-03-08 18:23:37,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:23:37,895 INFO L471 AbstractCegarLoop]: Abstraction has 3138 states and 4362 transitions. [2025-03-08 18:23:37,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-08 18:23:37,895 INFO L276 IsEmpty]: Start isEmpty. Operand 3138 states and 4362 transitions. [2025-03-08 18:23:37,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-08 18:23:37,897 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:23:37,897 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 18:23:37,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 18:23:37,898 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:23:37,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:23:37,898 INFO L85 PathProgramCache]: Analyzing trace with hash -628321821, now seen corresponding path program 1 times [2025-03-08 18:23:37,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:23:37,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589986994] [2025-03-08 18:23:37,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:23:37,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:23:39,757 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-08 18:23:39,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-08 18:23:39,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:23:39,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:23:40,688 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 18:23:40,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:23:40,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589986994] [2025-03-08 18:23:40,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589986994] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 18:23:40,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 18:23:40,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 18:23:40,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445425278] [2025-03-08 18:23:40,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:23:40,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 18:23:40,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:23:40,690 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 18:23:40,690 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 18:23:40,691 INFO L87 Difference]: Start difference. First operand 3138 states and 4362 transitions. Second operand has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 4 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-08 18:23:41,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:23:41,276 INFO L93 Difference]: Finished difference Result 4594 states and 6424 transitions. [2025-03-08 18:23:41,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 18:23:41,277 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 4 states have call predecessors, (10), 2 states have call successors, (10) Word has length 88 [2025-03-08 18:23:41,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:23:41,294 INFO L225 Difference]: With dead ends: 4594 [2025-03-08 18:23:41,294 INFO L226 Difference]: Without dead ends: 3146 [2025-03-08 18:23:41,299 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 18:23:41,299 INFO L435 NwaCegarLoop]: 636 mSDtfsCounter, 0 mSDsluCounter, 3176 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3812 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 18:23:41,300 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3812 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 18:23:41,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3146 states. [2025-03-08 18:23:41,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3146 to 3146. [2025-03-08 18:23:41,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3146 states, 2253 states have (on average 1.2649800266311584) internal successors, (2850), 2261 states have internal predecessors, (2850), 709 states have call successors, (709), 166 states have call predecessors, (709), 183 states have return successors, (811), 730 states have call predecessors, (811), 705 states have call successors, (811) [2025-03-08 18:23:41,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3146 states to 3146 states and 4370 transitions. [2025-03-08 18:23:41,390 INFO L78 Accepts]: Start accepts. Automaton has 3146 states and 4370 transitions. Word has length 88 [2025-03-08 18:23:41,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:23:41,391 INFO L471 AbstractCegarLoop]: Abstraction has 3146 states and 4370 transitions. [2025-03-08 18:23:41,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 4 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-08 18:23:41,391 INFO L276 IsEmpty]: Start isEmpty. Operand 3146 states and 4370 transitions. [2025-03-08 18:23:41,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-08 18:23:41,393 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:23:41,393 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 18:23:41,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 18:23:41,394 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:23:41,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:23:41,394 INFO L85 PathProgramCache]: Analyzing trace with hash 73278053, now seen corresponding path program 1 times [2025-03-08 18:23:41,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:23:41,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500944423] [2025-03-08 18:23:41,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:23:41,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:23:43,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-08 18:23:43,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-08 18:23:43,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:23:43,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:23:43,263 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-08 18:23:43,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:23:43,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500944423] [2025-03-08 18:23:43,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500944423] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 18:23:43,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 18:23:43,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 18:23:43,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666956161] [2025-03-08 18:23:43,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:23:43,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 18:23:43,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:23:43,264 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 18:23:43,264 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 18:23:43,264 INFO L87 Difference]: Start difference. First operand 3146 states and 4370 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-08 18:23:43,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:23:43,579 INFO L93 Difference]: Finished difference Result 4646 states and 6484 transitions. [2025-03-08 18:23:43,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 18:23:43,579 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 88 [2025-03-08 18:23:43,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:23:43,592 INFO L225 Difference]: With dead ends: 4646 [2025-03-08 18:23:43,592 INFO L226 Difference]: Without dead ends: 3194 [2025-03-08 18:23:43,597 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 18:23:43,598 INFO L435 NwaCegarLoop]: 634 mSDtfsCounter, 7 mSDsluCounter, 628 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 1262 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 18:23:43,598 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 1262 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 18:23:43,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3194 states. [2025-03-08 18:23:43,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3194 to 3150. [2025-03-08 18:23:43,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3150 states, 2257 states have (on average 1.2645104120513957) internal successors, (2854), 2265 states have internal predecessors, (2854), 709 states have call successors, (709), 166 states have call predecessors, (709), 183 states have return successors, (811), 730 states have call predecessors, (811), 705 states have call successors, (811) [2025-03-08 18:23:43,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3150 states to 3150 states and 4374 transitions. [2025-03-08 18:23:43,680 INFO L78 Accepts]: Start accepts. Automaton has 3150 states and 4374 transitions. Word has length 88 [2025-03-08 18:23:43,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:23:43,680 INFO L471 AbstractCegarLoop]: Abstraction has 3150 states and 4374 transitions. [2025-03-08 18:23:43,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-08 18:23:43,680 INFO L276 IsEmpty]: Start isEmpty. Operand 3150 states and 4374 transitions. [2025-03-08 18:23:43,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-08 18:23:43,683 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:23:43,683 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 18:23:43,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 18:23:43,683 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:23:43,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:23:43,684 INFO L85 PathProgramCache]: Analyzing trace with hash -1154205768, now seen corresponding path program 1 times [2025-03-08 18:23:43,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:23:43,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127679014] [2025-03-08 18:23:43,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:23:43,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:23:45,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-08 18:23:45,290 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-08 18:23:45,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:23:45,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:23:45,883 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-08 18:23:45,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:23:45,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127679014] [2025-03-08 18:23:45,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127679014] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 18:23:45,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 18:23:45,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 18:23:45,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342505419] [2025-03-08 18:23:45,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:23:45,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 18:23:45,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:23:45,884 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 18:23:45,884 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 18:23:45,885 INFO L87 Difference]: Start difference. First operand 3150 states and 4374 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 5 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2025-03-08 18:23:49,907 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 18:23:53,961 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 18:24:02,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:24:02,321 INFO L93 Difference]: Finished difference Result 4623 states and 6453 transitions. [2025-03-08 18:24:02,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 18:24:02,322 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 5 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) Word has length 89 [2025-03-08 18:24:02,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:24:02,335 INFO L225 Difference]: With dead ends: 4623 [2025-03-08 18:24:02,335 INFO L226 Difference]: Without dead ends: 4620 [2025-03-08 18:24:02,336 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-08 18:24:02,337 INFO L435 NwaCegarLoop]: 926 mSDtfsCounter, 1318 mSDsluCounter, 1281 mSDsCounter, 0 mSdLazyCounter, 1325 mSolverCounterSat, 246 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1414 SdHoareTripleChecker+Valid, 2207 SdHoareTripleChecker+Invalid, 1573 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 246 IncrementalHoareTripleChecker+Valid, 1325 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.2s IncrementalHoareTripleChecker+Time [2025-03-08 18:24:02,337 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1414 Valid, 2207 Invalid, 1573 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [246 Valid, 1325 Invalid, 2 Unknown, 0 Unchecked, 16.2s Time] [2025-03-08 18:24:02,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4620 states. [2025-03-08 18:24:02,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4620 to 4585. [2025-03-08 18:24:02,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4585 states, 3283 states have (on average 1.2674383186110265) internal successors, (4161), 3300 states have internal predecessors, (4161), 1039 states have call successors, (1039), 234 states have call predecessors, (1039), 262 states have return successors, (1215), 1070 states have call predecessors, (1215), 1035 states have call successors, (1215) [2025-03-08 18:24:02,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4585 states to 4585 states and 6415 transitions. [2025-03-08 18:24:02,444 INFO L78 Accepts]: Start accepts. Automaton has 4585 states and 6415 transitions. Word has length 89 [2025-03-08 18:24:02,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:24:02,444 INFO L471 AbstractCegarLoop]: Abstraction has 4585 states and 6415 transitions. [2025-03-08 18:24:02,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 5 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2025-03-08 18:24:02,445 INFO L276 IsEmpty]: Start isEmpty. Operand 4585 states and 6415 transitions. [2025-03-08 18:24:02,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-08 18:24:02,447 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:24:02,447 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 18:24:02,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 18:24:02,447 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:24:02,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:24:02,448 INFO L85 PathProgramCache]: Analyzing trace with hash 1073281530, now seen corresponding path program 1 times [2025-03-08 18:24:02,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:24:02,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320781857] [2025-03-08 18:24:02,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:24:02,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:24:03,867 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-08 18:24:03,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-08 18:24:03,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:24:03,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:24:04,090 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-08 18:24:04,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:24:04,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320781857] [2025-03-08 18:24:04,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320781857] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 18:24:04,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 18:24:04,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 18:24:04,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211653880] [2025-03-08 18:24:04,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:24:04,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 18:24:04,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:24:04,092 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 18:24:04,092 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 18:24:04,093 INFO L87 Difference]: Start difference. First operand 4585 states and 6415 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 3 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12)