./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--phy--dp83640.ko-entry_point.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--phy--dp83640.ko-entry_point.cil.out.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 09c104d62ffc45fecdd321fcd218065640bd0081501b6da04b741d2fcf55e306 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 19:11:54,357 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 19:11:54,407 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-08 19:11:54,412 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 19:11:54,412 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 19:11:54,432 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 19:11:54,432 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 19:11:54,432 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 19:11:54,432 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 19:11:54,432 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 19:11:54,432 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 19:11:54,433 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 19:11:54,433 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 19:11:54,433 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 19:11:54,433 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 19:11:54,433 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 19:11:54,433 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 19:11:54,433 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 19:11:54,433 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 19:11:54,433 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 19:11:54,433 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 19:11:54,433 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 19:11:54,433 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 19:11:54,433 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 19:11:54,433 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 19:11:54,434 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 19:11:54,434 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 19:11:54,434 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 19:11:54,434 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 19:11:54,434 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 19:11:54,434 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 19:11:54,434 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 19:11:54,434 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 19:11:54,435 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 19:11:54,435 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 19:11:54,435 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 19:11:54,435 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 19:11:54,435 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 19:11:54,435 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 19:11:54,435 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 19:11:54,435 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 -> 09c104d62ffc45fecdd321fcd218065640bd0081501b6da04b741d2fcf55e306 [2025-03-08 19:11:54,638 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 19:11:54,645 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 19:11:54,648 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 19:11:54,648 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 19:11:54,648 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 19:11:54,649 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--phy--dp83640.ko-entry_point.cil.out.i [2025-03-08 19:11:55,776 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0941c5f5/ffac12cbaea7434b8ccd594ab693e0a9/FLAG1a7dd4784 [2025-03-08 19:11:56,248 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 19:11:56,250 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--phy--dp83640.ko-entry_point.cil.out.i [2025-03-08 19:11:56,286 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0941c5f5/ffac12cbaea7434b8ccd594ab693e0a9/FLAG1a7dd4784 [2025-03-08 19:11:56,339 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0941c5f5/ffac12cbaea7434b8ccd594ab693e0a9 [2025-03-08 19:11:56,341 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 19:11:56,342 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 19:11:56,343 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 19:11:56,343 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 19:11:56,346 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 19:11:56,347 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 07:11:56" (1/1) ... [2025-03-08 19:11:56,347 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2fdd72e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:11:56, skipping insertion in model container [2025-03-08 19:11:56,347 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 07:11:56" (1/1) ... [2025-03-08 19:11:56,409 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 19:11:57,139 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.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--phy--dp83640.ko-entry_point.cil.out.i[161372,161385] [2025-03-08 19:11:57,644 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 19:11:57,659 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 19:11:57,768 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.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--phy--dp83640.ko-entry_point.cil.out.i[161372,161385] [2025-03-08 19:11:57,818 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("1:\tud2\n.pushsection __bug_table,\"a\"\n2:\t.long 1b - 2b, %c0 - 2b\n\t.word %c1, 0\n\t.org 2b+%c2\n.popsection": : "i" ((char *)"/work/ldvuser/mutilin/launch/work/current--X--drivers/net/--X--defaultlinux-3.16-rc1.tar.xz--X--205_9a--X--cpachecker/linux-3.16-rc1.tar.xz/csd_deg_dscv/998/dscv_tempdir/dscv/ri/205_9a/drivers/net/phy/dp83640.o.c.prepared"), "i" (952), "i" (12UL)); [6659-6660] [2025-03-08 19:11:57,872 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 19:11:57,907 INFO L204 MainTranslator]: Completed translation [2025-03-08 19:11:57,907 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:11:57 WrapperNode [2025-03-08 19:11:57,907 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 19:11:57,908 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 19:11:57,908 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 19:11:57,908 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 19:11:57,912 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:11:57" (1/1) ... [2025-03-08 19:11:57,954 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:11:57" (1/1) ... [2025-03-08 19:11:58,076 INFO L138 Inliner]: procedures = 187, calls = 879, calls flagged for inlining = 75, calls inlined = 64, statements flattened = 2377 [2025-03-08 19:11:58,077 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 19:11:58,077 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 19:11:58,078 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 19:11:58,078 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 19:11:58,084 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:11:57" (1/1) ... [2025-03-08 19:11:58,085 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:11:57" (1/1) ... [2025-03-08 19:11:58,095 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:11:57" (1/1) ... [2025-03-08 19:11:58,318 INFO L175 MemorySlicer]: Split 387 memory accesses to 16 slices as follows [14, 2, 2, 6, 41, 245, 6, 16, 20, 2, 5, 3, 2, 2, 6, 15]. 63 percent of accesses are in the largest equivalence class. The 55 initializations are split as follows [0, 2, 0, 6, 0, 2, 0, 16, 15, 0, 0, 0, 0, 0, 6, 8]. The 172 writes are split as follows [12, 0, 2, 0, 41, 107, 2, 0, 2, 1, 0, 3, 1, 1, 0, 0]. [2025-03-08 19:11:58,322 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:11:57" (1/1) ... [2025-03-08 19:11:58,322 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:11:57" (1/1) ... [2025-03-08 19:11:58,385 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:11:57" (1/1) ... [2025-03-08 19:11:58,391 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:11:57" (1/1) ... [2025-03-08 19:11:58,406 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:11:57" (1/1) ... [2025-03-08 19:11:58,416 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:11:57" (1/1) ... [2025-03-08 19:11:58,439 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 19:11:58,440 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 19:11:58,440 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 19:11:58,441 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 19:11:58,442 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:11:57" (1/1) ... [2025-03-08 19:11:58,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 19:11:58,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 19:11:58,467 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 19:11:58,469 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 19:11:58,488 INFO L130 BoogieDeclarations]: Found specification of procedure broadcast_write [2025-03-08 19:11:58,489 INFO L138 BoogieDeclarations]: Found implementation of procedure broadcast_write [2025-03-08 19:11:58,489 INFO L130 BoogieDeclarations]: Found specification of procedure __raw_spin_lock_init [2025-03-08 19:11:58,489 INFO L138 BoogieDeclarations]: Found implementation of procedure __raw_spin_lock_init [2025-03-08 19:11:58,489 INFO L130 BoogieDeclarations]: Found specification of procedure genphy_config_aneg [2025-03-08 19:11:58,489 INFO L138 BoogieDeclarations]: Found implementation of procedure genphy_config_aneg [2025-03-08 19:11:58,489 INFO L130 BoogieDeclarations]: Found specification of procedure list_empty [2025-03-08 19:11:58,489 INFO L138 BoogieDeclarations]: Found implementation of procedure list_empty [2025-03-08 19:11:58,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-03-08 19:11:58,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-03-08 19:11:58,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-03-08 19:11:58,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-03-08 19:11:58,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-03-08 19:11:58,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-03-08 19:11:58,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2025-03-08 19:11:58,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2025-03-08 19:11:58,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#8 [2025-03-08 19:11:58,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#9 [2025-03-08 19:11:58,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#10 [2025-03-08 19:11:58,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#11 [2025-03-08 19:11:58,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#12 [2025-03-08 19:11:58,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#13 [2025-03-08 19:11:58,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#14 [2025-03-08 19:11:58,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#15 [2025-03-08 19:11:58,490 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume [2025-03-08 19:11:58,490 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume [2025-03-08 19:11:58,490 INFO L130 BoogieDeclarations]: Found specification of procedure dp83640_clock_put [2025-03-08 19:11:58,490 INFO L138 BoogieDeclarations]: Found implementation of procedure dp83640_clock_put [2025-03-08 19:11:58,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-03-08 19:11:58,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-03-08 19:11:58,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-03-08 19:11:58,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-03-08 19:11:58,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-03-08 19:11:58,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2025-03-08 19:11:58,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2025-03-08 19:11:58,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#7 [2025-03-08 19:11:58,491 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#8 [2025-03-08 19:11:58,491 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#9 [2025-03-08 19:11:58,491 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#10 [2025-03-08 19:11:58,491 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#11 [2025-03-08 19:11:58,491 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#12 [2025-03-08 19:11:58,491 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#13 [2025-03-08 19:11:58,491 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#14 [2025-03-08 19:11:58,491 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#15 [2025-03-08 19:11:58,491 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2025-03-08 19:11:58,491 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2025-03-08 19:11:58,491 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 19:11:58,491 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 19:11:58,491 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-08 19:11:58,491 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-08 19:11:58,491 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-08 19:11:58,491 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-08 19:11:58,491 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-08 19:11:58,491 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-08 19:11:58,491 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-03-08 19:11:58,491 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-03-08 19:11:58,491 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-03-08 19:11:58,491 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-03-08 19:11:58,491 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-03-08 19:11:58,491 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-03-08 19:11:58,491 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-03-08 19:11:58,491 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2025-03-08 19:11:58,491 INFO L130 BoogieDeclarations]: Found specification of procedure skb_queue_head_init [2025-03-08 19:11:58,491 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_queue_head_init [2025-03-08 19:11:58,491 INFO L130 BoogieDeclarations]: Found specification of procedure phy2txts [2025-03-08 19:11:58,491 INFO L138 BoogieDeclarations]: Found implementation of procedure phy2txts [2025-03-08 19:11:58,491 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_free [2025-03-08 19:11:58,491 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_free [2025-03-08 19:11:58,491 INFO L130 BoogieDeclarations]: Found specification of procedure dp83640_ts_info [2025-03-08 19:11:58,491 INFO L138 BoogieDeclarations]: Found implementation of procedure dp83640_ts_info [2025-03-08 19:11:58,492 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2025-03-08 19:11:58,492 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2025-03-08 19:11:58,492 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_destroy [2025-03-08 19:11:58,492 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_destroy [2025-03-08 19:11:58,492 INFO L130 BoogieDeclarations]: Found specification of procedure mdiobus_write [2025-03-08 19:11:58,492 INFO L138 BoogieDeclarations]: Found implementation of procedure mdiobus_write [2025-03-08 19:11:58,492 INFO L130 BoogieDeclarations]: Found specification of procedure dp83640_config_intr [2025-03-08 19:11:58,492 INFO L138 BoogieDeclarations]: Found implementation of procedure dp83640_config_intr [2025-03-08 19:11:58,492 INFO L130 BoogieDeclarations]: Found specification of procedure tdr_write [2025-03-08 19:11:58,492 INFO L138 BoogieDeclarations]: Found implementation of procedure tdr_write [2025-03-08 19:11:58,492 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_alloc [2025-03-08 19:11:58,492 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_alloc [2025-03-08 19:11:58,492 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2025-03-08 19:11:58,492 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2025-03-08 19:11:58,492 INFO L130 BoogieDeclarations]: Found specification of procedure exts_chan_to_edata [2025-03-08 19:11:58,492 INFO L138 BoogieDeclarations]: Found implementation of procedure exts_chan_to_edata [2025-03-08 19:11:58,492 INFO L130 BoogieDeclarations]: Found specification of procedure skb_complete_tx_timestamp [2025-03-08 19:11:58,492 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_complete_tx_timestamp [2025-03-08 19:11:58,492 INFO L130 BoogieDeclarations]: Found specification of procedure list_del_init [2025-03-08 19:11:58,492 INFO L138 BoogieDeclarations]: Found implementation of procedure list_del_init [2025-03-08 19:11:58,492 INFO L130 BoogieDeclarations]: Found specification of procedure list_add_tail [2025-03-08 19:11:58,492 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add_tail [2025-03-08 19:11:58,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 19:11:58,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 19:11:58,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-08 19:11:58,493 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-08 19:11:58,493 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-08 19:11:58,493 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-08 19:11:58,493 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-08 19:11:58,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-08 19:11:58,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-03-08 19:11:58,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-03-08 19:11:58,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-03-08 19:11:58,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-03-08 19:11:58,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-03-08 19:11:58,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-03-08 19:11:58,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-03-08 19:11:58,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2025-03-08 19:11:58,494 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2025-03-08 19:11:58,494 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2025-03-08 19:11:58,494 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2025-03-08 19:11:58,494 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2025-03-08 19:11:58,494 INFO L130 BoogieDeclarations]: Found specification of procedure dp83640_rxtstamp [2025-03-08 19:11:58,494 INFO L138 BoogieDeclarations]: Found implementation of procedure dp83640_rxtstamp [2025-03-08 19:11:58,494 INFO L130 BoogieDeclarations]: Found specification of procedure __dynamic_pr_debug [2025-03-08 19:11:58,494 INFO L138 BoogieDeclarations]: Found implementation of procedure __dynamic_pr_debug [2025-03-08 19:11:58,494 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2025-03-08 19:11:58,494 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2025-03-08 19:11:58,494 INFO L130 BoogieDeclarations]: Found specification of procedure phy_read [2025-03-08 19:11:58,494 INFO L138 BoogieDeclarations]: Found implementation of procedure phy_read [2025-03-08 19:11:58,494 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-03-08 19:11:58,494 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-03-08 19:11:58,494 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-03-08 19:11:58,494 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#3 [2025-03-08 19:11:58,494 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#4 [2025-03-08 19:11:58,494 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#5 [2025-03-08 19:11:58,494 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#6 [2025-03-08 19:11:58,494 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#7 [2025-03-08 19:11:58,494 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#8 [2025-03-08 19:11:58,494 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#9 [2025-03-08 19:11:58,494 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#10 [2025-03-08 19:11:58,494 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#11 [2025-03-08 19:11:58,495 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#12 [2025-03-08 19:11:58,495 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#13 [2025-03-08 19:11:58,495 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#14 [2025-03-08 19:11:58,495 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#15 [2025-03-08 19:11:58,495 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-03-08 19:11:58,495 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-03-08 19:11:58,495 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-03-08 19:11:58,495 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#3 [2025-03-08 19:11:58,495 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#4 [2025-03-08 19:11:58,495 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#5 [2025-03-08 19:11:58,495 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#6 [2025-03-08 19:11:58,495 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#7 [2025-03-08 19:11:58,495 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#8 [2025-03-08 19:11:58,495 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#9 [2025-03-08 19:11:58,495 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#10 [2025-03-08 19:11:58,495 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#11 [2025-03-08 19:11:58,495 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#12 [2025-03-08 19:11:58,495 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#13 [2025-03-08 19:11:58,495 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#14 [2025-03-08 19:11:58,495 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#15 [2025-03-08 19:11:58,495 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 19:11:58,495 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 19:11:58,495 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-08 19:11:58,495 INFO L130 BoogieDeclarations]: Found specification of procedure prune_rx_ts [2025-03-08 19:11:58,495 INFO L138 BoogieDeclarations]: Found implementation of procedure prune_rx_ts [2025-03-08 19:11:58,495 INFO L130 BoogieDeclarations]: Found specification of procedure spinlock_check [2025-03-08 19:11:58,495 INFO L138 BoogieDeclarations]: Found implementation of procedure spinlock_check [2025-03-08 19:11:58,495 INFO L130 BoogieDeclarations]: Found specification of procedure __list_add [2025-03-08 19:11:58,495 INFO L138 BoogieDeclarations]: Found implementation of procedure __list_add [2025-03-08 19:11:58,495 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 19:11:58,495 INFO L130 BoogieDeclarations]: Found specification of procedure dp83640_config_init [2025-03-08 19:11:58,495 INFO L138 BoogieDeclarations]: Found implementation of procedure dp83640_config_init [2025-03-08 19:11:58,495 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-08 19:11:58,495 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-08 19:11:58,495 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-08 19:11:58,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-08 19:11:58,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-08 19:11:58,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-03-08 19:11:58,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-03-08 19:11:58,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-03-08 19:11:58,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-03-08 19:11:58,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-03-08 19:11:58,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-03-08 19:11:58,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-03-08 19:11:58,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-03-08 19:11:58,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-03-08 19:11:58,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-03-08 19:11:58,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2025-03-08 19:11:58,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#15 [2025-03-08 19:11:58,497 INFO L130 BoogieDeclarations]: Found specification of procedure INIT_LIST_HEAD [2025-03-08 19:11:58,498 INFO L138 BoogieDeclarations]: Found implementation of procedure INIT_LIST_HEAD [2025-03-08 19:11:58,498 INFO L130 BoogieDeclarations]: Found specification of procedure ns_to_ktime [2025-03-08 19:11:58,498 INFO L138 BoogieDeclarations]: Found implementation of procedure ns_to_ktime [2025-03-08 19:11:58,498 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_to_user [2025-03-08 19:11:58,498 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_to_user [2025-03-08 19:11:58,498 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-08 19:11:58,498 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-08 19:11:58,498 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-08 19:11:58,498 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-08 19:11:58,498 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-03-08 19:11:58,498 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-03-08 19:11:58,498 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-03-08 19:11:58,498 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-03-08 19:11:58,498 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-03-08 19:11:58,498 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-03-08 19:11:58,499 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-03-08 19:11:58,499 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-03-08 19:11:58,499 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-03-08 19:11:58,499 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-03-08 19:11:58,499 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2025-03-08 19:11:58,499 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#15 [2025-03-08 19:11:58,499 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_set_remove [2025-03-08 19:11:58,499 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_set_remove [2025-03-08 19:11:58,499 INFO L130 BoogieDeclarations]: Found specification of procedure skb_end_pointer [2025-03-08 19:11:58,499 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_end_pointer [2025-03-08 19:11:58,499 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2025-03-08 19:11:58,499 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2025-03-08 19:11:58,499 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_irqrestore [2025-03-08 19:11:58,499 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_irqrestore [2025-03-08 19:11:58,500 INFO L130 BoogieDeclarations]: Found specification of procedure enable_status_frames [2025-03-08 19:11:58,500 INFO L138 BoogieDeclarations]: Found implementation of procedure enable_status_frames [2025-03-08 19:11:58,500 INFO L130 BoogieDeclarations]: Found specification of procedure dp83640_hwtstamp [2025-03-08 19:11:58,500 INFO L138 BoogieDeclarations]: Found implementation of procedure dp83640_hwtstamp [2025-03-08 19:11:58,500 INFO L130 BoogieDeclarations]: Found specification of procedure list_add [2025-03-08 19:11:58,500 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add [2025-03-08 19:11:58,500 INFO L130 BoogieDeclarations]: Found specification of procedure phy_write [2025-03-08 19:11:58,503 INFO L138 BoogieDeclarations]: Found implementation of procedure phy_write [2025-03-08 19:11:58,504 INFO L130 BoogieDeclarations]: Found specification of procedure schedule_work [2025-03-08 19:11:58,504 INFO L138 BoogieDeclarations]: Found implementation of procedure schedule_work [2025-03-08 19:11:58,504 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 19:11:58,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-08 19:11:58,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-08 19:11:58,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-08 19:11:58,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-03-08 19:11:58,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-03-08 19:11:58,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-03-08 19:11:58,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-03-08 19:11:58,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2025-03-08 19:11:58,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2025-03-08 19:11:58,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2025-03-08 19:11:58,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2025-03-08 19:11:58,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2025-03-08 19:11:58,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2025-03-08 19:11:58,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2025-03-08 19:11:58,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#14 [2025-03-08 19:11:58,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#15 [2025-03-08 19:11:58,504 INFO L130 BoogieDeclarations]: Found specification of procedure skb_queue_tail [2025-03-08 19:11:58,504 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_queue_tail [2025-03-08 19:11:58,504 INFO L130 BoogieDeclarations]: Found specification of procedure might_fault [2025-03-08 19:11:58,504 INFO L138 BoogieDeclarations]: Found implementation of procedure might_fault [2025-03-08 19:11:58,504 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2025-03-08 19:11:58,504 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2025-03-08 19:11:58,504 INFO L130 BoogieDeclarations]: Found specification of procedure dp83640_clock_get [2025-03-08 19:11:58,504 INFO L138 BoogieDeclarations]: Found implementation of procedure dp83640_clock_get [2025-03-08 19:11:58,504 INFO L130 BoogieDeclarations]: Found specification of procedure dp83640_ack_interrupt [2025-03-08 19:11:58,504 INFO L138 BoogieDeclarations]: Found implementation of procedure dp83640_ack_interrupt [2025-03-08 19:11:58,504 INFO L130 BoogieDeclarations]: Found specification of procedure ext_read [2025-03-08 19:11:58,504 INFO L138 BoogieDeclarations]: Found implementation of procedure ext_read [2025-03-08 19:11:58,504 INFO L130 BoogieDeclarations]: Found specification of procedure __mutex_init [2025-03-08 19:11:58,504 INFO L138 BoogieDeclarations]: Found implementation of procedure __mutex_init [2025-03-08 19:11:58,504 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2025-03-08 19:11:58,504 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2025-03-08 19:11:58,504 INFO L130 BoogieDeclarations]: Found specification of procedure _raw_spin_lock_irqsave [2025-03-08 19:11:58,504 INFO L138 BoogieDeclarations]: Found implementation of procedure _raw_spin_lock_irqsave [2025-03-08 19:11:58,504 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock_nested [2025-03-08 19:11:58,504 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock_nested [2025-03-08 19:11:58,504 INFO L130 BoogieDeclarations]: Found specification of procedure skb_mac_header [2025-03-08 19:11:58,504 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_mac_header [2025-03-08 19:11:58,504 INFO L130 BoogieDeclarations]: Found specification of procedure dp83640_txtstamp [2025-03-08 19:11:58,505 INFO L138 BoogieDeclarations]: Found implementation of procedure dp83640_txtstamp [2025-03-08 19:11:58,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 19:11:58,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 19:11:58,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 19:11:58,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-08 19:11:58,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-08 19:11:58,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-08 19:11:58,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-08 19:11:58,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-08 19:11:58,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-08 19:11:58,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-08 19:11:58,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-08 19:11:58,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-08 19:11:58,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-08 19:11:58,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-03-08 19:11:58,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-03-08 19:11:58,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-03-08 19:11:58,505 INFO L130 BoogieDeclarations]: Found specification of procedure enable_broadcast [2025-03-08 19:11:58,505 INFO L138 BoogieDeclarations]: Found implementation of procedure enable_broadcast [2025-03-08 19:11:58,505 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2025-03-08 19:11:58,505 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2025-03-08 19:11:58,505 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_from_user [2025-03-08 19:11:58,505 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_from_user [2025-03-08 19:11:58,505 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 19:11:58,505 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 19:11:58,505 INFO L130 BoogieDeclarations]: Found specification of procedure ns_to_timespec [2025-03-08 19:11:58,505 INFO L138 BoogieDeclarations]: Found implementation of procedure ns_to_timespec [2025-03-08 19:11:58,505 INFO L130 BoogieDeclarations]: Found specification of procedure ext_write [2025-03-08 19:11:58,505 INFO L138 BoogieDeclarations]: Found implementation of procedure ext_write [2025-03-08 19:11:58,505 INFO L130 BoogieDeclarations]: Found specification of procedure IS_ERR [2025-03-08 19:11:58,505 INFO L138 BoogieDeclarations]: Found implementation of procedure IS_ERR [2025-03-08 19:11:58,988 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 19:11:58,991 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 19:11:59,024 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2025-03-08 19:11:59,049 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5573: call ULTIMATE.dealloc(~#__key~0#1.base, ~#__key~0#1.offset);havoc ~#__key~0#1.base, ~#__key~0#1.offset; [2025-03-08 19:11:59,072 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7898: havoc #t~nondet542; [2025-03-08 19:11:59,120 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6370: havoc #t~bitwise312; [2025-03-08 19:11:59,139 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7894: havoc mdiobus_read_#t~nondet541#1; [2025-03-08 19:11:59,169 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6166: havoc expired_#t~mem243#1; [2025-03-08 19:11:59,196 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5420: havoc #t~mem44;call ULTIMATE.dealloc(~#ktime_zero~0.base, ~#ktime_zero~0.offset);havoc ~#ktime_zero~0.base, ~#ktime_zero~0.offset;call ULTIMATE.dealloc(~#__constr_expr_0~0.base, ~#__constr_expr_0~0.offset);havoc ~#__constr_expr_0~0.base, ~#__constr_expr_0~0.offset; [2025-03-08 19:11:59,226 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5549: havoc #t~mem81.base, #t~mem81.offset;havoc #t~mem82; [2025-03-08 19:11:59,259 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7873: havoc dev_mc_del_#t~nondet537#1; [2025-03-08 19:11:59,260 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7869: havoc dev_mc_add_#t~nondet536#1; [2025-03-08 19:11:59,267 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7924: havoc #t~nondet547; [2025-03-08 19:11:59,289 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5448: havoc __kmalloc_#t~ret56#1.base, __kmalloc_#t~ret56#1.offset; [2025-03-08 19:11:59,291 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7858: havoc #t~nondet534; [2025-03-08 19:11:59,343 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6582: havoc is_sync_#t~mem349#1; [2025-03-08 19:11:59,372 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7850: havoc #t~nondet532; [2025-03-08 19:11:59,376 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7877: havoc #t~nondet538; [2025-03-08 19:11:59,380 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5366: havoc #t~mem17.base, #t~mem17.offset; [2025-03-08 19:11:59,414 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7931: havoc ptp_clock_index_#t~nondet548#1; [2025-03-08 19:11:59,712 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6469: call ULTIMATE.dealloc(decode_txts_~#shhwtstamps~0#1.base, decode_txts_~#shhwtstamps~0#1.offset);havoc decode_txts_~#shhwtstamps~0#1.base, decode_txts_~#shhwtstamps~0#1.offset;call ULTIMATE.dealloc(decode_txts_~#descriptor~1#1.base, decode_txts_~#descriptor~1#1.offset);havoc decode_txts_~#descriptor~1#1.base, decode_txts_~#descriptor~1#1.offset; [2025-03-08 19:11:59,713 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5589: havoc skb_headlen_#t~mem87#1;havoc skb_headlen_#t~mem88#1; [2025-03-08 19:11:59,713 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6433: call ULTIMATE.dealloc(decode_rxts_~#descriptor~0#1.base, decode_rxts_~#descriptor~0#1.offset);havoc decode_rxts_~#descriptor~0#1.base, decode_rxts_~#descriptor~0#1.offset; [2025-03-08 19:11:59,713 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6376: call ULTIMATE.dealloc(decode_evnt_~#event~0#1.base, decode_evnt_~#event~0#1.offset);havoc decode_evnt_~#event~0#1.base, decode_evnt_~#event~0#1.offset; [2025-03-08 19:11:59,734 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7831: havoc #t~nondet531; [2025-03-08 19:11:59,947 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6219: call ULTIMATE.dealloc(recalibrate_~#event_ts~0#1.base, recalibrate_~#event_ts~0#1.offset);havoc recalibrate_~#event_ts~0#1.base, recalibrate_~#event_ts~0#1.offset;call ULTIMATE.dealloc(recalibrate_~#ts~1#1.base, recalibrate_~#ts~1#1.offset);havoc recalibrate_~#ts~1#1.base, recalibrate_~#ts~1#1.offset; [2025-03-08 19:11:59,950 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7854: havoc #t~nondet533; [2025-03-08 19:12:00,060 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7035: call ULTIMATE.dealloc(~#cfg~0#1.base, ~#cfg~0#1.offset);havoc ~#cfg~0#1.base, ~#cfg~0#1.offset; [2025-03-08 19:12:00,070 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7949: havoc queue_work_on_#t~nondet552#1; [2025-03-08 19:12:00,082 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5595: havoc #t~mem89.base, #t~mem89.offset;havoc #t~mem90; [2025-03-08 19:12:04,670 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7881: havoc genphy_read_status_#t~nondet539#1; [2025-03-08 19:12:04,670 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7865: havoc cancel_work_sync_#t~nondet535#1; [2025-03-08 19:12:04,671 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7884: havoc get_device_#t~ret540#1.base, get_device_#t~ret540#1.offset; [2025-03-08 19:12:04,671 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7917: havoc phy_driver_register_#t~nondet546#1; [2025-03-08 19:12:04,671 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7934: havoc ptp_clock_register_#t~ret549#1.base, ptp_clock_register_#t~ret549#1.offset; [2025-03-08 19:12:04,671 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7938: havoc ptp_clock_unregister_#t~nondet550#1; [2025-03-08 19:12:04,671 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6684: call ULTIMATE.dealloc(dp83640_clock_init_~#__key~1#1.base, dp83640_clock_init_~#__key~1#1.offset);havoc dp83640_clock_init_~#__key~1#1.base, dp83640_clock_init_~#__key~1#1.offset;call ULTIMATE.dealloc(dp83640_clock_init_~#__key___0~0#1.base, dp83640_clock_init_~#__key___0~0#1.offset);havoc dp83640_clock_init_~#__key___0~0#1.base, dp83640_clock_init_~#__key___0~0#1.offset; [2025-03-08 19:12:04,671 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6804: call ULTIMATE.dealloc(dp83640_probe_~#__key~2#1.base, dp83640_probe_~#__key~2#1.offset);havoc dp83640_probe_~#__key~2#1.base, dp83640_probe_~#__key~2#1.offset;call ULTIMATE.dealloc(dp83640_probe_~#__constr_expr_0~1#1.base, dp83640_probe_~#__constr_expr_0~1#1.offset);havoc dp83640_probe_~#__constr_expr_0~1#1.base, dp83640_probe_~#__constr_expr_0~1#1.offset;call ULTIMATE.dealloc(dp83640_probe_~#__key___0~1#1.base, dp83640_probe_~#__key___0~1#1.offset);havoc dp83640_probe_~#__key___0~1#1.base, dp83640_probe_~#__key___0~1#1.offset; [2025-03-08 19:12:04,681 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7913: havoc #t~ret543#1.base, #t~ret543#1.offset;havoc #t~mem544#1;havoc #t~mem545#1; [2025-03-08 19:12:04,978 INFO L? ?]: Removed 987 outVars from TransFormulas that were not future-live. [2025-03-08 19:12:04,978 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 19:12:05,028 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 19:12:05,031 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 19:12:05,032 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 07:12:05 BoogieIcfgContainer [2025-03-08 19:12:05,032 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 19:12:05,033 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 19:12:05,033 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 19:12:05,039 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 19:12:05,039 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 07:11:56" (1/3) ... [2025-03-08 19:12:05,039 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3adc04a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 07:12:05, skipping insertion in model container [2025-03-08 19:12:05,039 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:11:57" (2/3) ... [2025-03-08 19:12:05,040 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3adc04a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 07:12:05, skipping insertion in model container [2025-03-08 19:12:05,040 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 07:12:05" (3/3) ... [2025-03-08 19:12:05,040 INFO L128 eAbstractionObserver]: Analyzing ICFG 205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--phy--dp83640.ko-entry_point.cil.out.i [2025-03-08 19:12:05,050 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 19:12:05,053 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--phy--dp83640.ko-entry_point.cil.out.i that has 80 procedures, 1028 locations, 1 initial locations, 21 loop locations, and 1 error locations. [2025-03-08 19:12:05,110 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 19:12:05,118 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;@5d842350, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 19:12:05,120 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 19:12:05,125 INFO L276 IsEmpty]: Start isEmpty. Operand has 967 states, 694 states have (on average 1.3357348703170029) internal successors, (927), 712 states have internal predecessors, (927), 208 states have call successors, (208), 64 states have call predecessors, (208), 63 states have return successors, (205), 203 states have call predecessors, (205), 205 states have call successors, (205) [2025-03-08 19:12:05,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-08 19:12:05,135 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:12:05,136 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 19:12:05,136 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:12:05,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:12:05,140 INFO L85 PathProgramCache]: Analyzing trace with hash 1533464701, now seen corresponding path program 1 times [2025-03-08 19:12:05,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:12:05,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540168389] [2025-03-08 19:12:05,145 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:12:05,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:12:05,493 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-08 19:12:05,625 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-08 19:12:05,625 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:12:05,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:12:06,064 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 19:12:06,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:12:06,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540168389] [2025-03-08 19:12:06,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540168389] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:12:06,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:12:06,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 19:12:06,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420477121] [2025-03-08 19:12:06,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:12:06,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 19:12:06,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:12:06,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 19:12:06,085 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 19:12:06,088 INFO L87 Difference]: Start difference. First operand has 967 states, 694 states have (on average 1.3357348703170029) internal successors, (927), 712 states have internal predecessors, (927), 208 states have call successors, (208), 64 states have call predecessors, (208), 63 states have return successors, (205), 203 states have call predecessors, (205), 205 states have call successors, (205) Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 19:12:06,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:12:06,644 INFO L93 Difference]: Finished difference Result 2883 states and 4076 transitions. [2025-03-08 19:12:06,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 19:12:06,647 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 32 [2025-03-08 19:12:06,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:12:06,677 INFO L225 Difference]: With dead ends: 2883 [2025-03-08 19:12:06,677 INFO L226 Difference]: Without dead ends: 1869 [2025-03-08 19:12:06,690 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-08 19:12:06,692 INFO L435 NwaCegarLoop]: 1292 mSDtfsCounter, 1299 mSDsluCounter, 3857 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1299 SdHoareTripleChecker+Valid, 5149 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 19:12:06,693 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1299 Valid, 5149 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 19:12:06,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1869 states. [2025-03-08 19:12:06,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1869 to 1867. [2025-03-08 19:12:06,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1867 states, 1345 states have (on average 1.3070631970260222) internal successors, (1758), 1371 states have internal predecessors, (1758), 398 states have call successors, (398), 124 states have call predecessors, (398), 123 states have return successors, (405), 393 states have call predecessors, (405), 397 states have call successors, (405) [2025-03-08 19:12:06,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1867 states to 1867 states and 2561 transitions. [2025-03-08 19:12:06,861 INFO L78 Accepts]: Start accepts. Automaton has 1867 states and 2561 transitions. Word has length 32 [2025-03-08 19:12:06,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:12:06,861 INFO L471 AbstractCegarLoop]: Abstraction has 1867 states and 2561 transitions. [2025-03-08 19:12:06,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 19:12:06,861 INFO L276 IsEmpty]: Start isEmpty. Operand 1867 states and 2561 transitions. [2025-03-08 19:12:06,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-08 19:12:06,868 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:12:06,869 INFO L218 NwaCegarLoop]: trace histogram [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 19:12:06,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 19:12:06,869 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:12:06,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:12:06,870 INFO L85 PathProgramCache]: Analyzing trace with hash 1350896022, now seen corresponding path program 1 times [2025-03-08 19:12:06,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:12:06,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196038940] [2025-03-08 19:12:06,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:12:06,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:12:07,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-08 19:12:07,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-08 19:12:07,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:12:07,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:12:07,316 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 19:12:07,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:12:07,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196038940] [2025-03-08 19:12:07,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196038940] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:12:07,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:12:07,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 19:12:07,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995398635] [2025-03-08 19:12:07,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:12:07,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 19:12:07,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:12:07,322 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 19:12:07,322 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:12:07,322 INFO L87 Difference]: Start difference. First operand 1867 states and 2561 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-08 19:12:07,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:12:07,667 INFO L93 Difference]: Finished difference Result 3822 states and 5229 transitions. [2025-03-08 19:12:07,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 19:12:07,671 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 75 [2025-03-08 19:12:07,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:12:07,684 INFO L225 Difference]: With dead ends: 3822 [2025-03-08 19:12:07,687 INFO L226 Difference]: Without dead ends: 1963 [2025-03-08 19:12:07,696 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:12:07,697 INFO L435 NwaCegarLoop]: 1318 mSDtfsCounter, 96 mSDsluCounter, 1204 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 2522 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 19:12:07,697 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 2522 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 19:12:07,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1963 states. [2025-03-08 19:12:07,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1963 to 1954. [2025-03-08 19:12:07,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1954 states, 1412 states have (on average 1.3052407932011332) internal successors, (1843), 1439 states have internal predecessors, (1843), 409 states have call successors, (409), 133 states have call predecessors, (409), 132 states have return successors, (416), 403 states have call predecessors, (416), 408 states have call successors, (416) [2025-03-08 19:12:07,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1954 states to 1954 states and 2668 transitions. [2025-03-08 19:12:07,809 INFO L78 Accepts]: Start accepts. Automaton has 1954 states and 2668 transitions. Word has length 75 [2025-03-08 19:12:07,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:12:07,810 INFO L471 AbstractCegarLoop]: Abstraction has 1954 states and 2668 transitions. [2025-03-08 19:12:07,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-08 19:12:07,810 INFO L276 IsEmpty]: Start isEmpty. Operand 1954 states and 2668 transitions. [2025-03-08 19:12:07,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-08 19:12:07,821 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:12:07,821 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 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] [2025-03-08 19:12:07,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 19:12:07,822 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:12:07,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:12:07,824 INFO L85 PathProgramCache]: Analyzing trace with hash -2101813497, now seen corresponding path program 1 times [2025-03-08 19:12:07,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:12:07,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119922584] [2025-03-08 19:12:07,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:12:07,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:12:08,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-08 19:12:08,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-08 19:12:08,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:12:08,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:12:08,237 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-08 19:12:08,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:12:08,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119922584] [2025-03-08 19:12:08,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119922584] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:12:08,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:12:08,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 19:12:08,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158316140] [2025-03-08 19:12:08,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:12:08,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 19:12:08,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:12:08,238 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 19:12:08,238 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:12:08,238 INFO L87 Difference]: Start difference. First operand 1954 states and 2668 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-08 19:12:12,257 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 19:12:12,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:12:12,561 INFO L93 Difference]: Finished difference Result 5368 states and 7308 transitions. [2025-03-08 19:12:12,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 19:12:12,561 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 99 [2025-03-08 19:12:12,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:12:12,578 INFO L225 Difference]: With dead ends: 5368 [2025-03-08 19:12:12,579 INFO L226 Difference]: Without dead ends: 3443 [2025-03-08 19:12:12,587 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:12:12,587 INFO L435 NwaCegarLoop]: 1414 mSDtfsCounter, 1177 mSDsluCounter, 1020 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 37 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1177 SdHoareTripleChecker+Valid, 2434 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2025-03-08 19:12:12,587 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1177 Valid, 2434 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 117 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2025-03-08 19:12:12,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3443 states. [2025-03-08 19:12:12,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3443 to 3434. [2025-03-08 19:12:12,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3434 states, 2506 states have (on average 1.2968874700718276) internal successors, (3250), 2546 states have internal predecessors, (3250), 682 states have call successors, (682), 246 states have call predecessors, (682), 245 states have return successors, (692), 671 states have call predecessors, (692), 681 states have call successors, (692) [2025-03-08 19:12:12,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3434 states to 3434 states and 4624 transitions. [2025-03-08 19:12:12,687 INFO L78 Accepts]: Start accepts. Automaton has 3434 states and 4624 transitions. Word has length 99 [2025-03-08 19:12:12,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:12:12,688 INFO L471 AbstractCegarLoop]: Abstraction has 3434 states and 4624 transitions. [2025-03-08 19:12:12,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-08 19:12:12,688 INFO L276 IsEmpty]: Start isEmpty. Operand 3434 states and 4624 transitions. [2025-03-08 19:12:12,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-08 19:12:12,693 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:12:12,693 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 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] [2025-03-08 19:12:12,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 19:12:12,693 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:12:12,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:12:12,693 INFO L85 PathProgramCache]: Analyzing trace with hash -816192969, now seen corresponding path program 1 times [2025-03-08 19:12:12,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:12:12,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987264986] [2025-03-08 19:12:12,693 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:12:12,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:12:12,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-08 19:12:12,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-08 19:12:12,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:12:12,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:12:13,053 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-08 19:12:13,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:12:13,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987264986] [2025-03-08 19:12:13,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987264986] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:12:13,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:12:13,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 19:12:13,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135342619] [2025-03-08 19:12:13,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:12:13,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 19:12:13,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:12:13,054 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 19:12:13,054 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:12:13,054 INFO L87 Difference]: Start difference. First operand 3434 states and 4624 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-08 19:12:13,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:12:13,182 INFO L93 Difference]: Finished difference Result 5183 states and 6992 transitions. [2025-03-08 19:12:13,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 19:12:13,182 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) Word has length 99 [2025-03-08 19:12:13,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:12:13,224 INFO L225 Difference]: With dead ends: 5183 [2025-03-08 19:12:13,224 INFO L226 Difference]: Without dead ends: 3438 [2025-03-08 19:12:13,228 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:12:13,228 INFO L435 NwaCegarLoop]: 1273 mSDtfsCounter, 2 mSDsluCounter, 1267 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2540 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 19:12:13,228 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2540 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 19:12:13,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3438 states. [2025-03-08 19:12:13,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3438 to 3438. [2025-03-08 19:12:13,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3438 states, 2510 states have (on average 1.296414342629482) internal successors, (3254), 2550 states have internal predecessors, (3254), 682 states have call successors, (682), 246 states have call predecessors, (682), 245 states have return successors, (692), 671 states have call predecessors, (692), 681 states have call successors, (692) [2025-03-08 19:12:13,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3438 states to 3438 states and 4628 transitions. [2025-03-08 19:12:13,332 INFO L78 Accepts]: Start accepts. Automaton has 3438 states and 4628 transitions. Word has length 99 [2025-03-08 19:12:13,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:12:13,332 INFO L471 AbstractCegarLoop]: Abstraction has 3438 states and 4628 transitions. [2025-03-08 19:12:13,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-08 19:12:13,333 INFO L276 IsEmpty]: Start isEmpty. Operand 3438 states and 4628 transitions. [2025-03-08 19:12:13,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-08 19:12:13,338 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:12:13,339 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 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] [2025-03-08 19:12:13,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 19:12:13,339 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:12:13,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:12:13,339 INFO L85 PathProgramCache]: Analyzing trace with hash -1902000488, now seen corresponding path program 1 times [2025-03-08 19:12:13,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:12:13,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823633884] [2025-03-08 19:12:13,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:12:13,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:12:13,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-08 19:12:13,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-08 19:12:13,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:12:13,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:12:14,025 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-08 19:12:14,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:12:14,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823633884] [2025-03-08 19:12:14,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823633884] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:12:14,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:12:14,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 19:12:14,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534683261] [2025-03-08 19:12:14,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:12:14,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 19:12:14,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:12:14,026 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 19:12:14,026 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-08 19:12:14,026 INFO L87 Difference]: Start difference. First operand 3438 states and 4628 transitions. Second operand has 8 states, 8 states have (on average 9.125) internal successors, (73), 7 states have internal predecessors, (73), 4 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-08 19:12:18,039 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 19:12:22,047 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 19:12:27,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:12:27,691 INFO L93 Difference]: Finished difference Result 7643 states and 10335 transitions. [2025-03-08 19:12:27,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 19:12:27,692 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.125) internal successors, (73), 7 states have internal predecessors, (73), 4 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 3 states have call successors, (8) Word has length 100 [2025-03-08 19:12:27,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:12:27,716 INFO L225 Difference]: With dead ends: 7643 [2025-03-08 19:12:27,716 INFO L226 Difference]: Without dead ends: 4234 [2025-03-08 19:12:27,728 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2025-03-08 19:12:27,729 INFO L435 NwaCegarLoop]: 633 mSDtfsCounter, 2944 mSDsluCounter, 2329 mSDsCounter, 0 mSdLazyCounter, 4324 mSolverCounterSat, 852 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3180 SdHoareTripleChecker+Valid, 2962 SdHoareTripleChecker+Invalid, 5178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 852 IncrementalHoareTripleChecker+Valid, 4324 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.2s IncrementalHoareTripleChecker+Time [2025-03-08 19:12:27,730 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3180 Valid, 2962 Invalid, 5178 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [852 Valid, 4324 Invalid, 2 Unknown, 0 Unchecked, 13.2s Time] [2025-03-08 19:12:27,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4234 states. [2025-03-08 19:12:27,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4234 to 4188. [2025-03-08 19:12:27,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4188 states, 3074 states have (on average 1.2992843201040989) internal successors, (3994), 3128 states have internal predecessors, (3994), 818 states have call successors, (818), 290 states have call predecessors, (818), 295 states have return successors, (843), 807 states have call predecessors, (843), 817 states have call successors, (843) [2025-03-08 19:12:27,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4188 states to 4188 states and 5655 transitions. [2025-03-08 19:12:27,895 INFO L78 Accepts]: Start accepts. Automaton has 4188 states and 5655 transitions. Word has length 100 [2025-03-08 19:12:27,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:12:27,895 INFO L471 AbstractCegarLoop]: Abstraction has 4188 states and 5655 transitions. [2025-03-08 19:12:27,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.125) internal successors, (73), 7 states have internal predecessors, (73), 4 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-08 19:12:27,895 INFO L276 IsEmpty]: Start isEmpty. Operand 4188 states and 5655 transitions. [2025-03-08 19:12:27,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-08 19:12:27,901 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:12:27,901 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 19:12:27,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 19:12:27,902 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:12:27,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:12:27,902 INFO L85 PathProgramCache]: Analyzing trace with hash -930237679, now seen corresponding path program 1 times [2025-03-08 19:12:27,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:12:27,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170743003] [2025-03-08 19:12:27,902 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:12:27,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:12:28,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-08 19:12:28,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-08 19:12:28,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:12:28,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:12:28,501 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-08 19:12:28,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:12:28,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170743003] [2025-03-08 19:12:28,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170743003] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:12:28,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:12:28,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 19:12:28,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246343512] [2025-03-08 19:12:28,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:12:28,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 19:12:28,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:12:28,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 19:12:28,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 19:12:28,503 INFO L87 Difference]: Start difference. First operand 4188 states and 5655 transitions. Second operand has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-08 19:12:28,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:12:28,703 INFO L93 Difference]: Finished difference Result 8373 states and 11359 transitions. [2025-03-08 19:12:28,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 19:12:28,704 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) Word has length 129 [2025-03-08 19:12:28,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:12:28,722 INFO L225 Difference]: With dead ends: 8373 [2025-03-08 19:12:28,722 INFO L226 Difference]: Without dead ends: 4214 [2025-03-08 19:12:28,733 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 19:12:28,734 INFO L435 NwaCegarLoop]: 1272 mSDtfsCounter, 0 mSDsluCounter, 3811 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 5083 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 19:12:28,734 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 5083 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 19:12:28,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4214 states. [2025-03-08 19:12:28,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4214 to 4212. [2025-03-08 19:12:28,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4212 states, 3092 states have (on average 1.297542043984476) internal successors, (4012), 3146 states have internal predecessors, (4012), 818 states have call successors, (818), 290 states have call predecessors, (818), 301 states have return successors, (853), 813 states have call predecessors, (853), 817 states have call successors, (853) [2025-03-08 19:12:28,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4212 states to 4212 states and 5683 transitions. [2025-03-08 19:12:28,851 INFO L78 Accepts]: Start accepts. Automaton has 4212 states and 5683 transitions. Word has length 129 [2025-03-08 19:12:28,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:12:28,851 INFO L471 AbstractCegarLoop]: Abstraction has 4212 states and 5683 transitions. [2025-03-08 19:12:28,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-08 19:12:28,851 INFO L276 IsEmpty]: Start isEmpty. Operand 4212 states and 5683 transitions. [2025-03-08 19:12:28,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-08 19:12:28,857 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:12:28,857 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 19:12:28,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 19:12:28,857 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:12:28,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:12:28,858 INFO L85 PathProgramCache]: Analyzing trace with hash 1864558065, now seen corresponding path program 1 times [2025-03-08 19:12:28,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:12:28,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376199361] [2025-03-08 19:12:28,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:12:28,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:12:29,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-08 19:12:29,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-08 19:12:29,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:12:29,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:12:29,257 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2025-03-08 19:12:29,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:12:29,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376199361] [2025-03-08 19:12:29,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376199361] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:12:29,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:12:29,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 19:12:29,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847285724] [2025-03-08 19:12:29,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:12:29,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 19:12:29,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:12:29,259 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 19:12:29,259 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:12:29,259 INFO L87 Difference]: Start difference. First operand 4212 states and 5683 transitions. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 3 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 19:12:33,270 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 19:12:33,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:12:33,407 INFO L93 Difference]: Finished difference Result 8384 states and 11317 transitions. [2025-03-08 19:12:33,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 19:12:33,408 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 3 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 150 [2025-03-08 19:12:33,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:12:33,429 INFO L225 Difference]: With dead ends: 8384 [2025-03-08 19:12:33,429 INFO L226 Difference]: Without dead ends: 4188 [2025-03-08 19:12:33,439 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:12:33,440 INFO L435 NwaCegarLoop]: 1309 mSDtfsCounter, 1254 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1254 SdHoareTripleChecker+Valid, 1362 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-03-08 19:12:33,440 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1254 Valid, 1362 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-03-08 19:12:33,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4188 states. [2025-03-08 19:12:33,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4188 to 4188. [2025-03-08 19:12:33,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4188 states, 3070 states have (on average 1.293485342019544) internal successors, (3971), 3124 states have internal predecessors, (3971), 816 states have call successors, (816), 290 states have call predecessors, (816), 301 states have return successors, (849), 811 states have call predecessors, (849), 815 states have call successors, (849) [2025-03-08 19:12:33,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4188 states to 4188 states and 5636 transitions. [2025-03-08 19:12:33,557 INFO L78 Accepts]: Start accepts. Automaton has 4188 states and 5636 transitions. Word has length 150 [2025-03-08 19:12:33,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:12:33,558 INFO L471 AbstractCegarLoop]: Abstraction has 4188 states and 5636 transitions. [2025-03-08 19:12:33,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 3 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 19:12:33,558 INFO L276 IsEmpty]: Start isEmpty. Operand 4188 states and 5636 transitions. [2025-03-08 19:12:33,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-03-08 19:12:33,565 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:12:33,565 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 19:12:33,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 19:12:33,566 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:12:33,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:12:33,566 INFO L85 PathProgramCache]: Analyzing trace with hash -1926496177, now seen corresponding path program 1 times [2025-03-08 19:12:33,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:12:33,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936724556] [2025-03-08 19:12:33,566 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:12:33,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:12:33,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-03-08 19:12:33,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-03-08 19:12:33,845 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:12:33,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:12:34,384 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-03-08 19:12:34,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:12:34,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936724556] [2025-03-08 19:12:34,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936724556] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 19:12:34,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1271467404] [2025-03-08 19:12:34,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:12:34,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 19:12:34,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 19:12:34,388 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 19:12:34,389 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 19:12:35,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-03-08 19:12:35,193 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-03-08 19:12:35,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:12:35,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:12:35,204 INFO L256 TraceCheckSpWp]: Trace formula consists of 1778 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-08 19:12:35,214 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 19:12:35,558 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 24 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-08 19:12:35,561 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 19:12:36,612 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-03-08 19:12:36,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1271467404] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-08 19:12:36,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-08 19:12:36,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9, 8] total 21 [2025-03-08 19:12:36,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324050185] [2025-03-08 19:12:36,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:12:36,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 19:12:36,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:12:36,614 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 19:12:36,614 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=317, Unknown=0, NotChecked=0, Total=420 [2025-03-08 19:12:36,614 INFO L87 Difference]: Start difference. First operand 4188 states and 5636 transitions. Second operand has 9 states, 9 states have (on average 12.0) internal successors, (108), 9 states have internal predecessors, (108), 6 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (17), 7 states have call predecessors, (17), 6 states have call successors, (17) [2025-03-08 19:12:40,630 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 19:12:44,647 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 19:12:48,663 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 19:12:54,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:12:54,337 INFO L93 Difference]: Finished difference Result 9632 states and 13236 transitions. [2025-03-08 19:12:54,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 19:12:54,337 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.0) internal successors, (108), 9 states have internal predecessors, (108), 6 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (17), 7 states have call predecessors, (17), 6 states have call successors, (17) Word has length 158 [2025-03-08 19:12:54,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:12:54,366 INFO L225 Difference]: With dead ends: 9632 [2025-03-08 19:12:54,366 INFO L226 Difference]: Without dead ends: 7132 [2025-03-08 19:12:54,377 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 337 GetRequests, 309 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=198, Invalid=614, Unknown=0, NotChecked=0, Total=812 [2025-03-08 19:12:54,380 INFO L435 NwaCegarLoop]: 1117 mSDtfsCounter, 5270 mSDsluCounter, 2708 mSDsCounter, 0 mSdLazyCounter, 5577 mSolverCounterSat, 2094 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5407 SdHoareTripleChecker+Valid, 3825 SdHoareTripleChecker+Invalid, 7674 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2094 IncrementalHoareTripleChecker+Valid, 5577 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.2s IncrementalHoareTripleChecker+Time [2025-03-08 19:12:54,380 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5407 Valid, 3825 Invalid, 7674 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2094 Valid, 5577 Invalid, 3 Unknown, 0 Unchecked, 17.2s Time] [2025-03-08 19:12:54,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7132 states. [2025-03-08 19:12:54,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7132 to 6104. [2025-03-08 19:12:54,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6104 states, 4464 states have (on average 1.2941308243727598) internal successors, (5777), 4553 states have internal predecessors, (5777), 1197 states have call successors, (1197), 409 states have call predecessors, (1197), 442 states have return successors, (1289), 1196 states have call predecessors, (1289), 1196 states have call successors, (1289) [2025-03-08 19:12:54,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6104 states to 6104 states and 8263 transitions. [2025-03-08 19:12:54,622 INFO L78 Accepts]: Start accepts. Automaton has 6104 states and 8263 transitions. Word has length 158 [2025-03-08 19:12:54,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:12:54,624 INFO L471 AbstractCegarLoop]: Abstraction has 6104 states and 8263 transitions. [2025-03-08 19:12:54,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.0) internal successors, (108), 9 states have internal predecessors, (108), 6 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (17), 7 states have call predecessors, (17), 6 states have call successors, (17) [2025-03-08 19:12:54,624 INFO L276 IsEmpty]: Start isEmpty. Operand 6104 states and 8263 transitions. [2025-03-08 19:12:54,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-03-08 19:12:54,632 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:12:54,632 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 19:12:54,644 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 19:12:54,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 19:12:54,838 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:12:54,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:12:54,839 INFO L85 PathProgramCache]: Analyzing trace with hash 347270324, now seen corresponding path program 1 times [2025-03-08 19:12:54,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:12:54,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406733202] [2025-03-08 19:12:54,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:12:54,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:12:55,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-03-08 19:12:55,227 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-03-08 19:12:55,227 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:12:55,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:12:55,402 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2025-03-08 19:12:55,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:12:55,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406733202] [2025-03-08 19:12:55,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406733202] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:12:55,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:12:55,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 19:12:55,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508002179] [2025-03-08 19:12:55,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:12:55,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 19:12:55,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:12:55,403 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 19:12:55,403 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 19:12:55,404 INFO L87 Difference]: Start difference. First operand 6104 states and 8263 transitions. Second operand has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 19:12:55,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:12:55,680 INFO L93 Difference]: Finished difference Result 10530 states and 14313 transitions. [2025-03-08 19:12:55,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 19:12:55,681 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 159 [2025-03-08 19:12:55,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:12:55,708 INFO L225 Difference]: With dead ends: 10530 [2025-03-08 19:12:55,709 INFO L226 Difference]: Without dead ends: 6114 [2025-03-08 19:12:55,718 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 19:12:55,719 INFO L435 NwaCegarLoop]: 1268 mSDtfsCounter, 0 mSDsluCounter, 2531 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3799 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 19:12:55,719 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3799 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 19:12:55,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6114 states. [2025-03-08 19:12:55,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6114 to 6112. [2025-03-08 19:12:55,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6112 states, 4472 states have (on average 1.2949463327370303) internal successors, (5791), 4561 states have internal predecessors, (5791), 1197 states have call successors, (1197), 409 states have call predecessors, (1197), 442 states have return successors, (1289), 1196 states have call predecessors, (1289), 1196 states have call successors, (1289) [2025-03-08 19:12:56,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6112 states to 6112 states and 8277 transitions. [2025-03-08 19:12:56,014 INFO L78 Accepts]: Start accepts. Automaton has 6112 states and 8277 transitions. Word has length 159 [2025-03-08 19:12:56,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:12:56,018 INFO L471 AbstractCegarLoop]: Abstraction has 6112 states and 8277 transitions. [2025-03-08 19:12:56,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 19:12:56,018 INFO L276 IsEmpty]: Start isEmpty. Operand 6112 states and 8277 transitions. [2025-03-08 19:12:56,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-08 19:12:56,034 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:12:56,034 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 19:12:56,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 19:12:56,035 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:12:56,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:12:56,037 INFO L85 PathProgramCache]: Analyzing trace with hash -192642029, now seen corresponding path program 1 times [2025-03-08 19:12:56,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:12:56,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516281074] [2025-03-08 19:12:56,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:12:56,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:12:56,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-08 19:12:56,452 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-08 19:12:56,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:12:56,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:12:56,664 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2025-03-08 19:12:56,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:12:56,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516281074] [2025-03-08 19:12:56,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516281074] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:12:56,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:12:56,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 19:12:56,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056820625] [2025-03-08 19:12:56,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:12:56,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 19:12:56,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:12:56,667 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 19:12:56,667 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 19:12:56,667 INFO L87 Difference]: Start difference. First operand 6112 states and 8277 transitions. Second operand has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 19:12:57,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:12:57,066 INFO L93 Difference]: Finished difference Result 12228 states and 16614 transitions. [2025-03-08 19:12:57,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 19:12:57,066 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 160 [2025-03-08 19:12:57,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:12:57,096 INFO L225 Difference]: With dead ends: 12228 [2025-03-08 19:12:57,096 INFO L226 Difference]: Without dead ends: 6168 [2025-03-08 19:12:57,118 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 19:12:57,119 INFO L435 NwaCegarLoop]: 1269 mSDtfsCounter, 1 mSDsluCounter, 2524 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 3793 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 19:12:57,119 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 3793 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 19:12:57,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6168 states. [2025-03-08 19:12:57,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6168 to 6160. [2025-03-08 19:12:57,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6160 states, 4520 states have (on average 1.2918141592920354) internal successors, (5839), 4609 states have internal predecessors, (5839), 1197 states have call successors, (1197), 409 states have call predecessors, (1197), 442 states have return successors, (1289), 1196 states have call predecessors, (1289), 1196 states have call successors, (1289) [2025-03-08 19:12:57,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6160 states to 6160 states and 8325 transitions. [2025-03-08 19:12:57,427 INFO L78 Accepts]: Start accepts. Automaton has 6160 states and 8325 transitions. Word has length 160 [2025-03-08 19:12:57,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:12:57,427 INFO L471 AbstractCegarLoop]: Abstraction has 6160 states and 8325 transitions. [2025-03-08 19:12:57,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 19:12:57,428 INFO L276 IsEmpty]: Start isEmpty. Operand 6160 states and 8325 transitions. [2025-03-08 19:12:57,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-03-08 19:12:57,436 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:12:57,436 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 19:12:57,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 19:12:57,436 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:12:57,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:12:57,437 INFO L85 PathProgramCache]: Analyzing trace with hash 559177240, now seen corresponding path program 1 times [2025-03-08 19:12:57,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:12:57,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970163629] [2025-03-08 19:12:57,437 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:12:57,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:12:57,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-08 19:12:57,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-08 19:12:57,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:12:57,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:12:57,893 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2025-03-08 19:12:57,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:12:57,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970163629] [2025-03-08 19:12:57,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970163629] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:12:57,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:12:57,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 19:12:57,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461501421] [2025-03-08 19:12:57,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:12:57,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 19:12:57,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:12:57,895 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 19:12:57,895 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 19:12:57,895 INFO L87 Difference]: Start difference. First operand 6160 states and 8325 transitions. Second operand has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 19:12:58,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:12:58,169 INFO L93 Difference]: Finished difference Result 12324 states and 16710 transitions. [2025-03-08 19:12:58,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 19:12:58,169 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 161 [2025-03-08 19:12:58,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:12:58,196 INFO L225 Difference]: With dead ends: 12324 [2025-03-08 19:12:58,196 INFO L226 Difference]: Without dead ends: 6216 [2025-03-08 19:12:58,210 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 19:12:58,211 INFO L435 NwaCegarLoop]: 1273 mSDtfsCounter, 1 mSDsluCounter, 2527 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 3800 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 19:12:58,211 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 3800 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 19:12:58,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6216 states. [2025-03-08 19:12:58,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6216 to 6160. [2025-03-08 19:12:58,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6160 states, 4520 states have (on average 1.2918141592920354) internal successors, (5839), 4609 states have internal predecessors, (5839), 1197 states have call successors, (1197), 409 states have call predecessors, (1197), 442 states have return successors, (1289), 1196 states have call predecessors, (1289), 1196 states have call successors, (1289) [2025-03-08 19:12:58,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6160 states to 6160 states and 8325 transitions. [2025-03-08 19:12:58,468 INFO L78 Accepts]: Start accepts. Automaton has 6160 states and 8325 transitions. Word has length 161 [2025-03-08 19:12:58,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:12:58,470 INFO L471 AbstractCegarLoop]: Abstraction has 6160 states and 8325 transitions. [2025-03-08 19:12:58,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 19:12:58,470 INFO L276 IsEmpty]: Start isEmpty. Operand 6160 states and 8325 transitions. [2025-03-08 19:12:58,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-08 19:12:58,476 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:12:58,476 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 19:12:58,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 19:12:58,477 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:12:58,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:12:58,477 INFO L85 PathProgramCache]: Analyzing trace with hash 143099159, now seen corresponding path program 1 times [2025-03-08 19:12:58,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:12:58,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499436467] [2025-03-08 19:12:58,478 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:12:58,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:12:58,679 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-08 19:12:58,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-08 19:12:58,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:12:58,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:12:59,181 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-03-08 19:12:59,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:12:59,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499436467] [2025-03-08 19:12:59,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499436467] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:12:59,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:12:59,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 19:12:59,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586234003] [2025-03-08 19:12:59,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:12:59,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 19:12:59,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:12:59,183 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 19:12:59,183 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 19:12:59,184 INFO L87 Difference]: Start difference. First operand 6160 states and 8325 transitions. Second operand has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 19:12:59,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:12:59,480 INFO L93 Difference]: Finished difference Result 12280 states and 16630 transitions. [2025-03-08 19:12:59,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 19:12:59,482 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 162 [2025-03-08 19:12:59,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:12:59,513 INFO L225 Difference]: With dead ends: 12280 [2025-03-08 19:12:59,513 INFO L226 Difference]: Without dead ends: 6172 [2025-03-08 19:12:59,529 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 19:12:59,530 INFO L435 NwaCegarLoop]: 1271 mSDtfsCounter, 0 mSDsluCounter, 2536 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3807 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 19:12:59,530 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3807 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 19:12:59,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6172 states. [2025-03-08 19:12:59,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6172 to 6172. [2025-03-08 19:12:59,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6172 states, 4532 states have (on average 1.2910414827890555) internal successors, (5851), 4621 states have internal predecessors, (5851), 1197 states have call successors, (1197), 409 states have call predecessors, (1197), 442 states have return successors, (1289), 1196 states have call predecessors, (1289), 1196 states have call successors, (1289) [2025-03-08 19:12:59,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6172 states to 6172 states and 8337 transitions. [2025-03-08 19:12:59,820 INFO L78 Accepts]: Start accepts. Automaton has 6172 states and 8337 transitions. Word has length 162 [2025-03-08 19:12:59,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:12:59,820 INFO L471 AbstractCegarLoop]: Abstraction has 6172 states and 8337 transitions. [2025-03-08 19:12:59,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 19:12:59,821 INFO L276 IsEmpty]: Start isEmpty. Operand 6172 states and 8337 transitions. [2025-03-08 19:12:59,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-03-08 19:12:59,828 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:12:59,828 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 19:12:59,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 19:12:59,829 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:12:59,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:12:59,829 INFO L85 PathProgramCache]: Analyzing trace with hash -555634008, now seen corresponding path program 1 times [2025-03-08 19:12:59,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:12:59,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887061455] [2025-03-08 19:12:59,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:12:59,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:13:00,170 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-03-08 19:13:00,352 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-03-08 19:13:00,352 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:13:00,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:13:01,681 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 16 proven. 3 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-08 19:13:01,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:13:01,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887061455] [2025-03-08 19:13:01,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887061455] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 19:13:01,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1301670456] [2025-03-08 19:13:01,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:13:01,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 19:13:01,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 19:13:01,686 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 19:13:01,686 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 19:13:02,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-03-08 19:13:02,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-03-08 19:13:02,529 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:13:02,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:13:02,537 INFO L256 TraceCheckSpWp]: Trace formula consists of 1791 conjuncts, 66 conjuncts are in the unsatisfiable core [2025-03-08 19:13:02,543 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 19:13:02,736 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 16 proven. 3 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-08 19:13:02,736 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 19:13:03,465 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 16 proven. 3 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-08 19:13:03,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1301670456] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 19:13:03,466 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 19:13:03,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 12] total 25 [2025-03-08 19:13:03,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656947278] [2025-03-08 19:13:03,466 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 19:13:03,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-08 19:13:03,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:13:03,467 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-08 19:13:03,467 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=540, Unknown=0, NotChecked=0, Total=600 [2025-03-08 19:13:03,467 INFO L87 Difference]: Start difference. First operand 6172 states and 8337 transitions. Second operand has 25 states, 22 states have (on average 6.7272727272727275) internal successors, (148), 19 states have internal predecessors, (148), 7 states have call successors, (28), 2 states have call predecessors, (28), 7 states have return successors, (29), 8 states have call predecessors, (29), 7 states have call successors, (29) [2025-03-08 19:13:04,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:13:04,202 INFO L93 Difference]: Finished difference Result 12492 states and 16939 transitions. [2025-03-08 19:13:04,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 19:13:04,203 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 22 states have (on average 6.7272727272727275) internal successors, (148), 19 states have internal predecessors, (148), 7 states have call successors, (28), 2 states have call predecessors, (28), 7 states have return successors, (29), 8 states have call predecessors, (29), 7 states have call successors, (29) Word has length 163 [2025-03-08 19:13:04,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:13:04,231 INFO L225 Difference]: With dead ends: 12492 [2025-03-08 19:13:04,231 INFO L226 Difference]: Without dead ends: 6372 [2025-03-08 19:13:04,247 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 312 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=60, Invalid=540, Unknown=0, NotChecked=0, Total=600 [2025-03-08 19:13:04,248 INFO L435 NwaCegarLoop]: 1285 mSDtfsCounter, 19 mSDsluCounter, 21775 mSDsCounter, 0 mSdLazyCounter, 814 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 23060 SdHoareTripleChecker+Invalid, 816 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 814 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 19:13:04,248 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 23060 Invalid, 816 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 814 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 19:13:04,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6372 states. [2025-03-08 19:13:04,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6372 to 6230. [2025-03-08 19:13:04,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6230 states, 4582 states have (on average 1.2861195984286338) internal successors, (5893), 4665 states have internal predecessors, (5893), 1197 states have call successors, (1197), 409 states have call predecessors, (1197), 450 states have return successors, (1309), 1210 states have call predecessors, (1309), 1196 states have call successors, (1309) [2025-03-08 19:13:04,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6230 states to 6230 states and 8399 transitions. [2025-03-08 19:13:04,487 INFO L78 Accepts]: Start accepts. Automaton has 6230 states and 8399 transitions. Word has length 163 [2025-03-08 19:13:04,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:13:04,488 INFO L471 AbstractCegarLoop]: Abstraction has 6230 states and 8399 transitions. [2025-03-08 19:13:04,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 22 states have (on average 6.7272727272727275) internal successors, (148), 19 states have internal predecessors, (148), 7 states have call successors, (28), 2 states have call predecessors, (28), 7 states have return successors, (29), 8 states have call predecessors, (29), 7 states have call successors, (29) [2025-03-08 19:13:04,488 INFO L276 IsEmpty]: Start isEmpty. Operand 6230 states and 8399 transitions. [2025-03-08 19:13:04,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-03-08 19:13:04,494 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:13:04,494 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 19:13:04,505 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 19:13:04,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-08 19:13:04,699 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:13:04,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:13:04,699 INFO L85 PathProgramCache]: Analyzing trace with hash -1845675620, now seen corresponding path program 1 times [2025-03-08 19:13:04,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:13:04,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983798674] [2025-03-08 19:13:04,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:13:04,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:13:04,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-03-08 19:13:04,976 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-03-08 19:13:04,977 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:13:04,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:13:05,187 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2025-03-08 19:13:05,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:13:05,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983798674] [2025-03-08 19:13:05,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983798674] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:13:05,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:13:05,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 19:13:05,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47540670] [2025-03-08 19:13:05,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:13:05,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 19:13:05,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:13:05,188 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 19:13:05,188 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 19:13:05,189 INFO L87 Difference]: Start difference. First operand 6230 states and 8399 transitions. Second operand has 4 states, 4 states have (on average 31.25) internal successors, (125), 4 states have internal predecessors, (125), 2 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-08 19:13:05,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:13:05,437 INFO L93 Difference]: Finished difference Result 12432 states and 16798 transitions. [2025-03-08 19:13:05,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 19:13:05,438 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.25) internal successors, (125), 4 states have internal predecessors, (125), 2 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 181 [2025-03-08 19:13:05,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:13:05,465 INFO L225 Difference]: With dead ends: 12432 [2025-03-08 19:13:05,465 INFO L226 Difference]: Without dead ends: 6238 [2025-03-08 19:13:05,479 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 19:13:05,479 INFO L435 NwaCegarLoop]: 1271 mSDtfsCounter, 0 mSDsluCounter, 2540 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3811 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 19:13:05,479 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3811 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 19:13:05,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6238 states. [2025-03-08 19:13:05,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6238 to 6238. [2025-03-08 19:13:05,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6238 states, 4590 states have (on average 1.2856209150326798) internal successors, (5901), 4673 states have internal predecessors, (5901), 1197 states have call successors, (1197), 409 states have call predecessors, (1197), 450 states have return successors, (1309), 1210 states have call predecessors, (1309), 1196 states have call successors, (1309) [2025-03-08 19:13:05,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6238 states to 6238 states and 8407 transitions. [2025-03-08 19:13:05,748 INFO L78 Accepts]: Start accepts. Automaton has 6238 states and 8407 transitions. Word has length 181 [2025-03-08 19:13:05,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:13:05,749 INFO L471 AbstractCegarLoop]: Abstraction has 6238 states and 8407 transitions. [2025-03-08 19:13:05,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.25) internal successors, (125), 4 states have internal predecessors, (125), 2 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-08 19:13:05,749 INFO L276 IsEmpty]: Start isEmpty. Operand 6238 states and 8407 transitions. [2025-03-08 19:13:05,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2025-03-08 19:13:05,755 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:13:05,755 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 19:13:05,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 19:13:05,756 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:13:05,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:13:05,756 INFO L85 PathProgramCache]: Analyzing trace with hash 1062288696, now seen corresponding path program 1 times [2025-03-08 19:13:05,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:13:05,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616602612] [2025-03-08 19:13:05,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:13:05,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:13:05,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-03-08 19:13:06,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-03-08 19:13:06,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:13:06,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:13:06,262 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2025-03-08 19:13:06,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:13:06,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616602612] [2025-03-08 19:13:06,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616602612] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 19:13:06,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2035225272] [2025-03-08 19:13:06,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:13:06,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 19:13:06,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 19:13:06,264 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 19:13:06,266 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 19:13:06,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-03-08 19:13:07,453 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-03-08 19:13:07,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:13:07,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:13:07,462 INFO L256 TraceCheckSpWp]: Trace formula consists of 1887 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 19:13:07,465 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 19:13:07,497 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2025-03-08 19:13:07,497 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 19:13:07,679 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2025-03-08 19:13:07,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2035225272] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 19:13:07,679 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 19:13:07,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-03-08 19:13:07,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810264367] [2025-03-08 19:13:07,679 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 19:13:07,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 19:13:07,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:13:07,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 19:13:07,680 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2025-03-08 19:13:07,680 INFO L87 Difference]: Start difference. First operand 6238 states and 8407 transitions. Second operand has 9 states, 9 states have (on average 16.444444444444443) internal successors, (148), 9 states have internal predecessors, (148), 2 states have call successors, (27), 2 states have call predecessors, (27), 4 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-03-08 19:13:08,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:13:08,027 INFO L93 Difference]: Finished difference Result 12480 states and 16868 transitions. [2025-03-08 19:13:08,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 19:13:08,027 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 16.444444444444443) internal successors, (148), 9 states have internal predecessors, (148), 2 states have call successors, (27), 2 states have call predecessors, (27), 4 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 182 [2025-03-08 19:13:08,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:13:08,058 INFO L225 Difference]: With dead ends: 12480 [2025-03-08 19:13:08,058 INFO L226 Difference]: Without dead ends: 6262 [2025-03-08 19:13:08,075 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 368 GetRequests, 360 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2025-03-08 19:13:08,076 INFO L435 NwaCegarLoop]: 1271 mSDtfsCounter, 0 mSDsluCounter, 5079 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6350 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 19:13:08,077 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6350 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 19:13:08,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6262 states. [2025-03-08 19:13:08,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6262 to 6262. [2025-03-08 19:13:08,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6262 states, 4614 states have (on average 1.2841352405721715) internal successors, (5925), 4697 states have internal predecessors, (5925), 1197 states have call successors, (1197), 409 states have call predecessors, (1197), 450 states have return successors, (1309), 1210 states have call predecessors, (1309), 1196 states have call successors, (1309) [2025-03-08 19:13:08,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6262 states to 6262 states and 8431 transitions. [2025-03-08 19:13:08,286 INFO L78 Accepts]: Start accepts. Automaton has 6262 states and 8431 transitions. Word has length 182 [2025-03-08 19:13:08,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:13:08,287 INFO L471 AbstractCegarLoop]: Abstraction has 6262 states and 8431 transitions. [2025-03-08 19:13:08,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 16.444444444444443) internal successors, (148), 9 states have internal predecessors, (148), 2 states have call successors, (27), 2 states have call predecessors, (27), 4 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-03-08 19:13:08,287 INFO L276 IsEmpty]: Start isEmpty. Operand 6262 states and 8431 transitions. [2025-03-08 19:13:08,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2025-03-08 19:13:08,295 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:13:08,295 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 19:13:08,316 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-08 19:13:08,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 19:13:08,496 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:13:08,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:13:08,496 INFO L85 PathProgramCache]: Analyzing trace with hash 1219444892, now seen corresponding path program 2 times [2025-03-08 19:13:08,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:13:08,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964507844] [2025-03-08 19:13:08,497 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 19:13:08,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:13:08,693 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 185 statements into 2 equivalence classes. [2025-03-08 19:13:08,770 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 185 of 185 statements. [2025-03-08 19:13:08,770 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 19:13:08,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:13:09,175 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2025-03-08 19:13:09,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:13:09,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964507844] [2025-03-08 19:13:09,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964507844] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 19:13:09,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1104608060] [2025-03-08 19:13:09,176 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 19:13:09,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 19:13:09,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 19:13:09,178 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 19:13:09,180 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 19:13:09,902 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 185 statements into 2 equivalence classes.