./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-consumption/32_7a_cilled_linux-3.8-rc1-drivers--block--paride--pg.ko-main.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-consumption/32_7a_cilled_linux-3.8-rc1-drivers--block--paride--pg.ko-main.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 410663f06ff647e412b04b4e33dc5a0aa773139e9be33f59003b35b6e81927a8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 19:01:41,337 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 19:01:41,390 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-08 19:01:41,393 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 19:01:41,394 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 19:01:41,415 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 19:01:41,416 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 19:01:41,416 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 19:01:41,416 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 19:01:41,417 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 19:01:41,417 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 19:01:41,417 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 19:01:41,417 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 19:01:41,418 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 19:01:41,418 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 19:01:41,418 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 19:01:41,418 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 19:01:41,418 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 19:01:41,418 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 19:01:41,419 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 19:01:41,419 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 19:01:41,419 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 19:01:41,419 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 19:01:41,419 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 19:01:41,419 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 19:01:41,419 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 19:01:41,419 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 19:01:41,419 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 19:01:41,419 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 19:01:41,419 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 19:01:41,420 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 19:01:41,420 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 19:01:41,420 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 19:01:41,420 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 19:01:41,420 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 19:01:41,420 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 19:01:41,420 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 19:01:41,421 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 19:01:41,421 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 19:01:41,421 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 19:01:41,421 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 -> 410663f06ff647e412b04b4e33dc5a0aa773139e9be33f59003b35b6e81927a8 [2025-03-08 19:01:41,686 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 19:01:41,694 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 19:01:41,696 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 19:01:41,697 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 19:01:41,700 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 19:01:41,701 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-consumption/32_7a_cilled_linux-3.8-rc1-drivers--block--paride--pg.ko-main.cil.out.i [2025-03-08 19:01:42,870 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/493385e84/fe2c943dc7554f3fb8cee1e0c6771689/FLAG8afd1f2a0 [2025-03-08 19:01:43,257 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 19:01:43,258 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-consumption/32_7a_cilled_linux-3.8-rc1-drivers--block--paride--pg.ko-main.cil.out.i [2025-03-08 19:01:43,284 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/493385e84/fe2c943dc7554f3fb8cee1e0c6771689/FLAG8afd1f2a0 [2025-03-08 19:01:43,444 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/493385e84/fe2c943dc7554f3fb8cee1e0c6771689 [2025-03-08 19:01:43,446 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 19:01:43,447 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 19:01:43,448 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 19:01:43,448 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 19:01:43,451 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 19:01:43,452 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 07:01:43" (1/1) ... [2025-03-08 19:01:43,452 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30e9581e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:01:43, skipping insertion in model container [2025-03-08 19:01:43,453 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 07:01:43" (1/1) ... [2025-03-08 19:01:43,522 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 19:01:44,040 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-consumption/32_7a_cilled_linux-3.8-rc1-drivers--block--paride--pg.ko-main.cil.out.i[108133,108146] [2025-03-08 19:01:44,084 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 19:01:44,118 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 19:01:44,176 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile (".pushsection .smp_locks,\"a\"\n.balign 4\n.long 671f - .\n.popsection\n671:\n\tlock; btr %1,%0": "+m" (*((long volatile *)addr)): "Ir" (nr)); [2808] [2025-03-08 19:01:44,178 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile (".pushsection .smp_locks,\"a\"\n.balign 4\n.long 671f - .\n.popsection\n671:\n\tlock; bts %2,%1\n\tsbb %0,%0": "=r" (oldbit), "+m" (*((long volatile *)addr)): "Ir" (nr): "memory"); [2815-2816] [2025-03-08 19:01:44,248 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-consumption/32_7a_cilled_linux-3.8-rc1-drivers--block--paride--pg.ko-main.cil.out.i[108133,108146] [2025-03-08 19:01:44,263 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 19:01:44,313 INFO L204 MainTranslator]: Completed translation [2025-03-08 19:01:44,313 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:01:44 WrapperNode [2025-03-08 19:01:44,313 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 19:01:44,314 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 19:01:44,314 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 19:01:44,314 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 19:01:44,318 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:01:44" (1/1) ... [2025-03-08 19:01:44,347 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:01:44" (1/1) ... [2025-03-08 19:01:44,427 INFO L138 Inliner]: procedures = 133, calls = 1232, calls flagged for inlining = 49, calls inlined = 41, statements flattened = 1948 [2025-03-08 19:01:44,428 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 19:01:44,428 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 19:01:44,429 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 19:01:44,429 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 19:01:44,438 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:01:44" (1/1) ... [2025-03-08 19:01:44,439 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:01:44" (1/1) ... [2025-03-08 19:01:44,458 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:01:44" (1/1) ... [2025-03-08 19:01:44,544 INFO L175 MemorySlicer]: Split 952 memory accesses to 22 slices as follows [2, 1, 3, 5, 32, 1, 512, 273, 6, 24, 2, 14, 2, 28, 11, 3, 1, 6, 5, 3, 13, 5]. 54 percent of accesses are in the largest equivalence class. The 780 initializations are split as follows [2, 0, 3, 5, 24, 1, 512, 180, 4, 0, 0, 14, 0, 0, 11, 0, 0, 6, 0, 0, 13, 5]. The 103 writes are split as follows [0, 0, 0, 0, 0, 0, 0, 40, 0, 24, 2, 0, 1, 28, 0, 2, 0, 0, 5, 1, 0, 0]. [2025-03-08 19:01:44,544 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:01:44" (1/1) ... [2025-03-08 19:01:44,544 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:01:44" (1/1) ... [2025-03-08 19:01:44,625 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:01:44" (1/1) ... [2025-03-08 19:01:44,630 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:01:44" (1/1) ... [2025-03-08 19:01:44,651 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:01:44" (1/1) ... [2025-03-08 19:01:44,661 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:01:44" (1/1) ... [2025-03-08 19:01:44,688 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 19:01:44,689 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 19:01:44,689 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 19:01:44,689 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 19:01:44,690 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:01:44" (1/1) ... [2025-03-08 19:01:44,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 19:01:44,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 19:01:44,719 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:01:44,723 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:01:44,740 INFO L130 BoogieDeclarations]: Found specification of procedure pi_release [2025-03-08 19:01:44,740 INFO L138 BoogieDeclarations]: Found implementation of procedure pi_release [2025-03-08 19:01:44,740 INFO L130 BoogieDeclarations]: Found specification of procedure write_reg [2025-03-08 19:01:44,741 INFO L138 BoogieDeclarations]: Found implementation of procedure write_reg [2025-03-08 19:01:44,741 INFO L130 BoogieDeclarations]: Found specification of procedure pi_disconnect [2025-03-08 19:01:44,741 INFO L138 BoogieDeclarations]: Found implementation of procedure pi_disconnect [2025-03-08 19:01:44,741 INFO L130 BoogieDeclarations]: Found specification of procedure status_reg [2025-03-08 19:01:44,741 INFO L138 BoogieDeclarations]: Found implementation of procedure status_reg [2025-03-08 19:01:44,741 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-03-08 19:01:44,741 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-03-08 19:01:44,741 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-03-08 19:01:44,741 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-03-08 19:01:44,741 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-03-08 19:01:44,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-03-08 19:01:44,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2025-03-08 19:01:44,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2025-03-08 19:01:44,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#8 [2025-03-08 19:01:44,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#9 [2025-03-08 19:01:44,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#10 [2025-03-08 19:01:44,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#11 [2025-03-08 19:01:44,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#12 [2025-03-08 19:01:44,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#13 [2025-03-08 19:01:44,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#14 [2025-03-08 19:01:44,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#15 [2025-03-08 19:01:44,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#16 [2025-03-08 19:01:44,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#17 [2025-03-08 19:01:44,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#18 [2025-03-08 19:01:44,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#19 [2025-03-08 19:01:44,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#20 [2025-03-08 19:01:44,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#21 [2025-03-08 19:01:44,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-03-08 19:01:44,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-03-08 19:01:44,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-03-08 19:01:44,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-03-08 19:01:44,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-03-08 19:01:44,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2025-03-08 19:01:44,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2025-03-08 19:01:44,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#7 [2025-03-08 19:01:44,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#8 [2025-03-08 19:01:44,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#9 [2025-03-08 19:01:44,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#10 [2025-03-08 19:01:44,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#11 [2025-03-08 19:01:44,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#12 [2025-03-08 19:01:44,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#13 [2025-03-08 19:01:44,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#14 [2025-03-08 19:01:44,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#15 [2025-03-08 19:01:44,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#16 [2025-03-08 19:01:44,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#17 [2025-03-08 19:01:44,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#18 [2025-03-08 19:01:44,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#19 [2025-03-08 19:01:44,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#20 [2025-03-08 19:01:44,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#21 [2025-03-08 19:01:44,744 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 19:01:44,744 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 19:01:44,744 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-08 19:01:44,744 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-08 19:01:44,744 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-08 19:01:44,744 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-08 19:01:44,744 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-08 19:01:44,744 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-08 19:01:44,744 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-03-08 19:01:44,744 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-03-08 19:01:44,744 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-03-08 19:01:44,744 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-03-08 19:01:44,744 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-03-08 19:01:44,744 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-03-08 19:01:44,744 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-03-08 19:01:44,744 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2025-03-08 19:01:44,744 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2025-03-08 19:01:44,744 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#17 [2025-03-08 19:01:44,744 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#18 [2025-03-08 19:01:44,744 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#19 [2025-03-08 19:01:44,744 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#20 [2025-03-08 19:01:44,744 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#21 [2025-03-08 19:01:44,744 INFO L130 BoogieDeclarations]: Found specification of procedure read_reg [2025-03-08 19:01:44,744 INFO L138 BoogieDeclarations]: Found implementation of procedure read_reg [2025-03-08 19:01:44,744 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2025-03-08 19:01:44,744 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2025-03-08 19:01:44,744 INFO L130 BoogieDeclarations]: Found specification of procedure pg_sleep [2025-03-08 19:01:44,744 INFO L138 BoogieDeclarations]: Found implementation of procedure pg_sleep [2025-03-08 19:01:44,744 INFO L130 BoogieDeclarations]: Found specification of procedure pg_completion [2025-03-08 19:01:44,744 INFO L138 BoogieDeclarations]: Found implementation of procedure pg_completion [2025-03-08 19:01:44,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 19:01:44,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 19:01:44,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-08 19:01:44,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-08 19:01:44,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-08 19:01:44,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-08 19:01:44,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-08 19:01:44,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-08 19:01:44,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-03-08 19:01:44,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-03-08 19:01:44,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-03-08 19:01:44,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-03-08 19:01:44,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-03-08 19:01:44,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-03-08 19:01:44,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-03-08 19:01:44,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2025-03-08 19:01:44,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2025-03-08 19:01:44,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#17 [2025-03-08 19:01:44,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#18 [2025-03-08 19:01:44,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#19 [2025-03-08 19:01:44,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#20 [2025-03-08 19:01:44,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#21 [2025-03-08 19:01:44,745 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2025-03-08 19:01:44,745 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2025-03-08 19:01:44,748 INFO L130 BoogieDeclarations]: Found specification of procedure copy_to_user [2025-03-08 19:01:44,748 INFO L138 BoogieDeclarations]: Found implementation of procedure copy_to_user [2025-03-08 19:01:44,748 INFO L130 BoogieDeclarations]: Found specification of procedure pg_wait [2025-03-08 19:01:44,748 INFO L138 BoogieDeclarations]: Found implementation of procedure pg_wait [2025-03-08 19:01:44,748 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2025-03-08 19:01:44,748 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2025-03-08 19:01:44,748 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2025-03-08 19:01:44,748 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2025-03-08 19:01:44,749 INFO L130 BoogieDeclarations]: Found specification of procedure clear_bit [2025-03-08 19:01:44,749 INFO L138 BoogieDeclarations]: Found implementation of procedure clear_bit [2025-03-08 19:01:44,749 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-08 19:01:44,749 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock [2025-03-08 19:01:44,749 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock [2025-03-08 19:01:44,749 INFO L130 BoogieDeclarations]: Found specification of procedure copy_from_user [2025-03-08 19:01:44,749 INFO L138 BoogieDeclarations]: Found implementation of procedure copy_from_user [2025-03-08 19:01:44,749 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 19:01:44,749 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_unregister_chrdev_11 [2025-03-08 19:01:44,749 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_unregister_chrdev_11 [2025-03-08 19:01:44,749 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-08 19:01:44,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-08 19:01:44,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-08 19:01:44,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-08 19:01:44,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-08 19:01:44,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-03-08 19:01:44,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-03-08 19:01:44,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-03-08 19:01:44,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-03-08 19:01:44,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-03-08 19:01:44,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-03-08 19:01:44,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-03-08 19:01:44,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-03-08 19:01:44,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-03-08 19:01:44,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-03-08 19:01:44,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2025-03-08 19:01:44,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#15 [2025-03-08 19:01:44,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#16 [2025-03-08 19:01:44,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#17 [2025-03-08 19:01:44,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#18 [2025-03-08 19:01:44,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#19 [2025-03-08 19:01:44,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#20 [2025-03-08 19:01:44,750 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#21 [2025-03-08 19:01:44,750 INFO L130 BoogieDeclarations]: Found specification of procedure DRIVE [2025-03-08 19:01:44,750 INFO L138 BoogieDeclarations]: Found implementation of procedure DRIVE [2025-03-08 19:01:44,750 INFO L130 BoogieDeclarations]: Found specification of procedure pg_write [2025-03-08 19:01:44,750 INFO L138 BoogieDeclarations]: Found implementation of procedure pg_write [2025-03-08 19:01:44,750 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-08 19:01:44,750 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-08 19:01:44,750 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-08 19:01:44,750 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-08 19:01:44,750 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-03-08 19:01:44,750 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-03-08 19:01:44,750 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-03-08 19:01:44,750 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-03-08 19:01:44,750 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-03-08 19:01:44,750 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-03-08 19:01:44,750 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-03-08 19:01:44,750 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-03-08 19:01:44,750 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-03-08 19:01:44,750 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-03-08 19:01:44,750 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2025-03-08 19:01:44,750 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#15 [2025-03-08 19:01:44,750 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#16 [2025-03-08 19:01:44,750 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#17 [2025-03-08 19:01:44,750 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#18 [2025-03-08 19:01:44,750 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#19 [2025-03-08 19:01:44,750 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#20 [2025-03-08 19:01:44,750 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#21 [2025-03-08 19:01:44,750 INFO L130 BoogieDeclarations]: Found specification of procedure pg_reset [2025-03-08 19:01:44,750 INFO L138 BoogieDeclarations]: Found implementation of procedure pg_reset [2025-03-08 19:01:44,750 INFO L130 BoogieDeclarations]: Found specification of procedure pg_identify [2025-03-08 19:01:44,750 INFO L138 BoogieDeclarations]: Found implementation of procedure pg_identify [2025-03-08 19:01:44,750 INFO L130 BoogieDeclarations]: Found specification of procedure pi_write_block [2025-03-08 19:01:44,750 INFO L138 BoogieDeclarations]: Found implementation of procedure pi_write_block [2025-03-08 19:01:44,750 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 19:01:44,750 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-08 19:01:44,750 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-08 19:01:44,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-08 19:01:44,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-03-08 19:01:44,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-03-08 19:01:44,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-03-08 19:01:44,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-03-08 19:01:44,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2025-03-08 19:01:44,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2025-03-08 19:01:44,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2025-03-08 19:01:44,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2025-03-08 19:01:44,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2025-03-08 19:01:44,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2025-03-08 19:01:44,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2025-03-08 19:01:44,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#14 [2025-03-08 19:01:44,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#15 [2025-03-08 19:01:44,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#16 [2025-03-08 19:01:44,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#17 [2025-03-08 19:01:44,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#18 [2025-03-08 19:01:44,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#19 [2025-03-08 19:01:44,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#20 [2025-03-08 19:01:44,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#21 [2025-03-08 19:01:44,751 INFO L130 BoogieDeclarations]: Found specification of procedure pi_init [2025-03-08 19:01:44,751 INFO L138 BoogieDeclarations]: Found implementation of procedure pi_init [2025-03-08 19:01:44,751 INFO L130 BoogieDeclarations]: Found specification of procedure pi_read_regr [2025-03-08 19:01:44,751 INFO L138 BoogieDeclarations]: Found implementation of procedure pi_read_regr [2025-03-08 19:01:44,751 INFO L130 BoogieDeclarations]: Found specification of procedure might_fault [2025-03-08 19:01:44,751 INFO L138 BoogieDeclarations]: Found implementation of procedure might_fault [2025-03-08 19:01:44,751 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2025-03-08 19:01:44,751 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2025-03-08 19:01:44,751 INFO L130 BoogieDeclarations]: Found specification of procedure pg_probe [2025-03-08 19:01:44,751 INFO L138 BoogieDeclarations]: Found implementation of procedure pg_probe [2025-03-08 19:01:44,751 INFO L130 BoogieDeclarations]: Found specification of procedure pi_connect [2025-03-08 19:01:44,751 INFO L138 BoogieDeclarations]: Found implementation of procedure pi_connect [2025-03-08 19:01:44,753 INFO L130 BoogieDeclarations]: Found specification of procedure pg_command [2025-03-08 19:01:44,753 INFO L138 BoogieDeclarations]: Found implementation of procedure pg_command [2025-03-08 19:01:44,753 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 19:01:44,753 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 19:01:44,753 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 19:01:44,753 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-08 19:01:44,753 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-08 19:01:44,753 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-08 19:01:44,753 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-08 19:01:44,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-08 19:01:44,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-08 19:01:44,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-08 19:01:44,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-08 19:01:44,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-08 19:01:44,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-08 19:01:44,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-03-08 19:01:44,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-03-08 19:01:44,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-03-08 19:01:44,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-03-08 19:01:44,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-03-08 19:01:44,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-03-08 19:01:44,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-03-08 19:01:44,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#20 [2025-03-08 19:01:44,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#21 [2025-03-08 19:01:44,755 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_from_user [2025-03-08 19:01:44,755 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_from_user [2025-03-08 19:01:44,755 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 19:01:44,755 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 19:01:44,755 INFO L130 BoogieDeclarations]: Found specification of procedure xs [2025-03-08 19:01:44,755 INFO L138 BoogieDeclarations]: Found implementation of procedure xs [2025-03-08 19:01:45,128 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 19:01:45,130 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 19:01:45,221 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2923: havoc ~res~0#1.base, ~res~0#1.offset; [2025-03-08 19:01:45,251 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3073: havoc #t~mem103; [2025-03-08 19:01:45,359 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3248: call ULTIMATE.dealloc(~#expect~0.base, ~#expect~0.offset);havoc ~#expect~0.base, ~#expect~0.offset;call ULTIMATE.dealloc(~#got~0.base, ~#got~0.offset);havoc ~#got~0.base, ~#got~0.offset; [2025-03-08 19:01:45,692 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3367: call ULTIMATE.dealloc(~#ms~0.base, ~#ms~0.offset);havoc ~#ms~0.base, ~#ms~0.offset;call ULTIMATE.dealloc(~#mf~0.base, ~#mf~0.offset);havoc ~#mf~0.base, ~#mf~0.offset;call ULTIMATE.dealloc(~#id~0.base, ~#id~0.offset);havoc ~#id~0.base, ~#id~0.offset;call ULTIMATE.dealloc(~#id_cmd~0.base, ~#id_cmd~0.offset);havoc ~#id_cmd~0.base, ~#id_cmd~0.offset;call ULTIMATE.dealloc(~#buf~0.base, ~#buf~0.offset);havoc ~#buf~0.base, ~#buf~0.offset; [2025-03-08 19:01:45,702 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4557: havoc #t~nondet285; [2025-03-08 19:01:45,705 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4564: havoc #t~nondet286; [2025-03-08 19:01:45,709 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4577: havoc #t~nondet287; [2025-03-08 19:01:45,741 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4517: havoc #t~nondet280; [2025-03-08 19:01:45,766 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4581: havoc schedule_timeout_interruptible_#t~nondet288#1; [2025-03-08 19:01:45,838 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4521: havoc _copy_to_user_#t~nondet281#1; [2025-03-08 19:01:45,997 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3565: call ULTIMATE.dealloc(~#hdr~0.base, ~#hdr~0.offset);havoc ~#hdr~0.base, ~#hdr~0.offset; [2025-03-08 19:01:50,848 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3702: call ULTIMATE.dealloc(pg_init_~#__key~0#1.base, pg_init_~#__key~0#1.offset);havoc pg_init_~#__key~0#1.base, pg_init_~#__key~0#1.offset; [2025-03-08 19:01:50,848 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4547: havoc noop_llseek_#t~nondet284#1; [2025-03-08 19:01:50,848 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3639: call ULTIMATE.dealloc(pg_read_~#hdr~1#1.base, pg_read_~#hdr~1#1.offset);havoc pg_read_~#hdr~1#1.base, pg_read_~#hdr~1#1.offset; [2025-03-08 19:01:50,848 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2883: havoc iminor_#t~mem18#1; [2025-03-08 19:01:50,848 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2933: havoc __kmalloc_#t~ret37#1.base, __kmalloc_#t~ret37#1.offset; [2025-03-08 19:01:50,848 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4503: havoc __class_create_#t~ret278#1.base, __class_create_#t~ret278#1.offset; [2025-03-08 19:01:50,848 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4510: havoc __register_chrdev_#t~nondet279#1; [2025-03-08 19:01:50,848 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4527: havoc device_create_#t~ret282#1.base, device_create_#t~ret282#1.offset; [2025-03-08 19:01:50,982 INFO L? ?]: Removed 571 outVars from TransFormulas that were not future-live. [2025-03-08 19:01:50,982 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 19:01:51,008 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 19:01:51,008 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 19:01:51,009 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 07:01:51 BoogieIcfgContainer [2025-03-08 19:01:51,009 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 19:01:51,010 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 19:01:51,011 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 19:01:51,016 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 19:01:51,017 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 07:01:43" (1/3) ... [2025-03-08 19:01:51,017 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e3a3bbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 07:01:51, skipping insertion in model container [2025-03-08 19:01:51,017 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:01:44" (2/3) ... [2025-03-08 19:01:51,017 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e3a3bbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 07:01:51, skipping insertion in model container [2025-03-08 19:01:51,017 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 07:01:51" (3/3) ... [2025-03-08 19:01:51,019 INFO L128 eAbstractionObserver]: Analyzing ICFG 32_7a_cilled_linux-3.8-rc1-drivers--block--paride--pg.ko-main.cil.out.i [2025-03-08 19:01:51,032 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 19:01:51,037 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 32_7a_cilled_linux-3.8-rc1-drivers--block--paride--pg.ko-main.cil.out.i that has 32 procedures, 529 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-03-08 19:01:51,126 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 19:01:51,137 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;@636b92c5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 19:01:51,137 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 19:01:51,144 INFO L276 IsEmpty]: Start isEmpty. Operand has 529 states, 394 states have (on average 1.368020304568528) internal successors, (539), 404 states have internal predecessors, (539), 102 states have call successors, (102), 31 states have call predecessors, (102), 31 states have return successors, (102), 102 states have call predecessors, (102), 102 states have call successors, (102) [2025-03-08 19:01:51,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-08 19:01:51,154 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:01:51,154 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 19:01:51,154 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:01:51,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:01:51,158 INFO L85 PathProgramCache]: Analyzing trace with hash -1502829815, now seen corresponding path program 1 times [2025-03-08 19:01:51,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:01:51,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017876705] [2025-03-08 19:01:51,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:01:51,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:01:51,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-08 19:01:51,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-08 19:01:51,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:01:51,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:01:52,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 19:01:52,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:01:52,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017876705] [2025-03-08 19:01:52,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017876705] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:01:52,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:01:52,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 19:01:52,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522898737] [2025-03-08 19:01:52,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:01:52,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 19:01:52,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:01:52,286 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 19:01:52,286 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:01:52,290 INFO L87 Difference]: Start difference. First operand has 529 states, 394 states have (on average 1.368020304568528) internal successors, (539), 404 states have internal predecessors, (539), 102 states have call successors, (102), 31 states have call predecessors, (102), 31 states have return successors, (102), 102 states have call predecessors, (102), 102 states have call successors, (102) Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 19:01:52,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:01:52,624 INFO L93 Difference]: Finished difference Result 1382 states and 1968 transitions. [2025-03-08 19:01:52,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 19:01:52,628 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-03-08 19:01:52,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:01:52,647 INFO L225 Difference]: With dead ends: 1382 [2025-03-08 19:01:52,649 INFO L226 Difference]: Without dead ends: 848 [2025-03-08 19:01:52,658 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:01:52,662 INFO L435 NwaCegarLoop]: 887 mSDtfsCounter, 462 mSDsluCounter, 683 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 462 SdHoareTripleChecker+Valid, 1570 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 19:01:52,663 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [462 Valid, 1570 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 19:01:52,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 848 states. [2025-03-08 19:01:52,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 848 to 820. [2025-03-08 19:01:52,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 820 states, 604 states have (on average 1.3526490066225165) internal successors, (817), 614 states have internal predecessors, (817), 165 states have call successors, (165), 51 states have call predecessors, (165), 50 states have return successors, (159), 159 states have call predecessors, (159), 159 states have call successors, (159) [2025-03-08 19:01:52,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 820 states to 820 states and 1141 transitions. [2025-03-08 19:01:52,769 INFO L78 Accepts]: Start accepts. Automaton has 820 states and 1141 transitions. Word has length 16 [2025-03-08 19:01:52,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:01:52,769 INFO L471 AbstractCegarLoop]: Abstraction has 820 states and 1141 transitions. [2025-03-08 19:01:52,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 19:01:52,769 INFO L276 IsEmpty]: Start isEmpty. Operand 820 states and 1141 transitions. [2025-03-08 19:01:52,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-08 19:01:52,770 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:01:52,770 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 19:01:52,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 19:01:52,770 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:01:52,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:01:52,773 INFO L85 PathProgramCache]: Analyzing trace with hash 1649139218, now seen corresponding path program 1 times [2025-03-08 19:01:52,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:01:52,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108583059] [2025-03-08 19:01:52,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:01:52,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:01:53,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-08 19:01:53,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-08 19:01:53,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:01:53,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:01:53,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 19:01:53,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:01:53,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108583059] [2025-03-08 19:01:53,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108583059] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:01:53,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:01:53,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 19:01:53,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617980555] [2025-03-08 19:01:53,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:01:53,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 19:01:53,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:01:53,397 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 19:01:53,397 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:01:53,398 INFO L87 Difference]: Start difference. First operand 820 states and 1141 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 19:01:53,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:01:53,512 INFO L93 Difference]: Finished difference Result 1637 states and 2279 transitions. [2025-03-08 19:01:53,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 19:01:53,512 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-03-08 19:01:53,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:01:53,521 INFO L225 Difference]: With dead ends: 1637 [2025-03-08 19:01:53,521 INFO L226 Difference]: Without dead ends: 820 [2025-03-08 19:01:53,524 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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:01:53,526 INFO L435 NwaCegarLoop]: 716 mSDtfsCounter, 718 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 718 SdHoareTripleChecker+Valid, 716 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 19:01:53,527 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [718 Valid, 716 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 19:01:53,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 820 states. [2025-03-08 19:01:53,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 820 to 820. [2025-03-08 19:01:53,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 820 states, 604 states have (on average 1.349337748344371) internal successors, (815), 614 states have internal predecessors, (815), 165 states have call successors, (165), 51 states have call predecessors, (165), 50 states have return successors, (159), 159 states have call predecessors, (159), 159 states have call successors, (159) [2025-03-08 19:01:53,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 820 states to 820 states and 1139 transitions. [2025-03-08 19:01:53,582 INFO L78 Accepts]: Start accepts. Automaton has 820 states and 1139 transitions. Word has length 19 [2025-03-08 19:01:53,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:01:53,582 INFO L471 AbstractCegarLoop]: Abstraction has 820 states and 1139 transitions. [2025-03-08 19:01:53,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 19:01:53,582 INFO L276 IsEmpty]: Start isEmpty. Operand 820 states and 1139 transitions. [2025-03-08 19:01:53,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-08 19:01:53,585 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:01:53,585 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 19:01:53,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 19:01:53,586 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:01:53,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:01:53,586 INFO L85 PathProgramCache]: Analyzing trace with hash -768075619, now seen corresponding path program 1 times [2025-03-08 19:01:53,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:01:53,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21629349] [2025-03-08 19:01:53,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:01:53,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:01:53,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-08 19:01:54,072 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-08 19:01:54,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:01:54,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:01:54,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 19:01:54,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:01:54,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21629349] [2025-03-08 19:01:54,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21629349] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:01:54,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:01:54,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 19:01:54,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913311259] [2025-03-08 19:01:54,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:01:54,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 19:01:54,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:01:54,327 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 19:01:54,328 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:01:54,328 INFO L87 Difference]: Start difference. First operand 820 states and 1139 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 19:01:58,374 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 19:01:58,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:01:58,550 INFO L93 Difference]: Finished difference Result 2049 states and 2849 transitions. [2025-03-08 19:01:58,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 19:01:58,551 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2025-03-08 19:01:58,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:01:58,560 INFO L225 Difference]: With dead ends: 2049 [2025-03-08 19:01:58,560 INFO L226 Difference]: Without dead ends: 1232 [2025-03-08 19:01:58,564 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:01:58,564 INFO L435 NwaCegarLoop]: 1098 mSDtfsCounter, 675 mSDsluCounter, 573 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 675 SdHoareTripleChecker+Valid, 1671 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-03-08 19:01:58,565 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [675 Valid, 1671 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 41 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-03-08 19:01:58,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1232 states. [2025-03-08 19:01:58,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1232 to 1228. [2025-03-08 19:01:58,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1228 states, 909 states have (on average 1.353135313531353) internal successors, (1230), 921 states have internal predecessors, (1230), 240 states have call successors, (240), 79 states have call predecessors, (240), 78 states have return successors, (234), 234 states have call predecessors, (234), 234 states have call successors, (234) [2025-03-08 19:01:58,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1228 states to 1228 states and 1704 transitions. [2025-03-08 19:01:58,643 INFO L78 Accepts]: Start accepts. Automaton has 1228 states and 1704 transitions. Word has length 25 [2025-03-08 19:01:58,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:01:58,643 INFO L471 AbstractCegarLoop]: Abstraction has 1228 states and 1704 transitions. [2025-03-08 19:01:58,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 19:01:58,644 INFO L276 IsEmpty]: Start isEmpty. Operand 1228 states and 1704 transitions. [2025-03-08 19:01:58,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-08 19:01:58,644 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:01:58,644 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 19:01:58,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 19:01:58,645 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:01:58,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:01:58,645 INFO L85 PathProgramCache]: Analyzing trace with hash -1837227844, now seen corresponding path program 1 times [2025-03-08 19:01:58,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:01:58,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038638114] [2025-03-08 19:01:58,645 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:01:58,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:01:58,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-08 19:01:59,026 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-08 19:01:59,026 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:01:59,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:01:59,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 19:01:59,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:01:59,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038638114] [2025-03-08 19:01:59,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038638114] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:01:59,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:01:59,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 19:01:59,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84532543] [2025-03-08 19:01:59,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:01:59,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 19:01:59,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:01:59,202 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 19:01:59,202 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:01:59,202 INFO L87 Difference]: Start difference. First operand 1228 states and 1704 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 19:01:59,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:01:59,294 INFO L93 Difference]: Finished difference Result 2467 states and 3427 transitions. [2025-03-08 19:01:59,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 19:01:59,294 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2025-03-08 19:01:59,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:01:59,302 INFO L225 Difference]: With dead ends: 2467 [2025-03-08 19:01:59,302 INFO L226 Difference]: Without dead ends: 1242 [2025-03-08 19:01:59,306 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:01:59,307 INFO L435 NwaCegarLoop]: 714 mSDtfsCounter, 7 mSDsluCounter, 711 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 1425 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 19:01:59,308 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 1425 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 19:01:59,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1242 states. [2025-03-08 19:01:59,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1242 to 1230. [2025-03-08 19:01:59,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1230 states, 911 states have (on average 1.3523600439077936) internal successors, (1232), 923 states have internal predecessors, (1232), 240 states have call successors, (240), 79 states have call predecessors, (240), 78 states have return successors, (234), 234 states have call predecessors, (234), 234 states have call successors, (234) [2025-03-08 19:01:59,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1230 states to 1230 states and 1706 transitions. [2025-03-08 19:01:59,365 INFO L78 Accepts]: Start accepts. Automaton has 1230 states and 1706 transitions. Word has length 30 [2025-03-08 19:01:59,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:01:59,366 INFO L471 AbstractCegarLoop]: Abstraction has 1230 states and 1706 transitions. [2025-03-08 19:01:59,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 19:01:59,366 INFO L276 IsEmpty]: Start isEmpty. Operand 1230 states and 1706 transitions. [2025-03-08 19:01:59,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-08 19:01:59,368 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:01:59,368 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 19:01:59,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 19:01:59,368 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:01:59,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:01:59,369 INFO L85 PathProgramCache]: Analyzing trace with hash 96895766, now seen corresponding path program 1 times [2025-03-08 19:01:59,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:01:59,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66308712] [2025-03-08 19:01:59,369 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:01:59,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:01:59,693 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-08 19:01:59,729 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-08 19:01:59,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:01:59,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:01:59,993 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 19:01:59,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:01:59,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66308712] [2025-03-08 19:01:59,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66308712] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 19:01:59,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1283071898] [2025-03-08 19:01:59,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:01:59,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 19:01:59,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 19:01:59,996 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:01:59,998 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:02:00,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-08 19:02:00,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-08 19:02:00,975 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:02:00,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:02:00,990 INFO L256 TraceCheckSpWp]: Trace formula consists of 2581 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 19:02:00,995 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 19:02:01,013 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 19:02:01,015 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 19:02:01,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1283071898] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:02:01,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 19:02:01,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-08 19:02:01,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761650536] [2025-03-08 19:02:01,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:02:01,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 19:02:01,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:02:01,016 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 19:02:01,016 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 19:02:01,017 INFO L87 Difference]: Start difference. First operand 1230 states and 1706 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (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:02:01,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:02:01,111 INFO L93 Difference]: Finished difference Result 2483 states and 3451 transitions. [2025-03-08 19:02:01,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 19:02:01,112 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (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 40 [2025-03-08 19:02:01,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:02:01,119 INFO L225 Difference]: With dead ends: 2483 [2025-03-08 19:02:01,120 INFO L226 Difference]: Without dead ends: 1256 [2025-03-08 19:02:01,124 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 19:02:01,125 INFO L435 NwaCegarLoop]: 714 mSDtfsCounter, 19 mSDsluCounter, 699 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 1413 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 19:02:01,125 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 1413 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 19:02:01,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1256 states. [2025-03-08 19:02:01,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1256 to 1256. [2025-03-08 19:02:01,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1256 states, 931 states have (on average 1.3533834586466165) internal successors, (1260), 943 states have internal predecessors, (1260), 246 states have call successors, (246), 79 states have call predecessors, (246), 78 states have return successors, (240), 240 states have call predecessors, (240), 240 states have call successors, (240) [2025-03-08 19:02:01,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1256 states to 1256 states and 1746 transitions. [2025-03-08 19:02:01,176 INFO L78 Accepts]: Start accepts. Automaton has 1256 states and 1746 transitions. Word has length 40 [2025-03-08 19:02:01,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:02:01,176 INFO L471 AbstractCegarLoop]: Abstraction has 1256 states and 1746 transitions. [2025-03-08 19:02:01,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (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:02:01,177 INFO L276 IsEmpty]: Start isEmpty. Operand 1256 states and 1746 transitions. [2025-03-08 19:02:01,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-08 19:02:01,177 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:02:01,178 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 19:02:01,190 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 19:02:01,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 19:02:01,382 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:02:01,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:02:01,382 INFO L85 PathProgramCache]: Analyzing trace with hash 589931981, now seen corresponding path program 1 times [2025-03-08 19:02:01,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:02:01,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751500324] [2025-03-08 19:02:01,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:02:01,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:02:01,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-08 19:02:01,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-08 19:02:01,748 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:02:01,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:02:01,978 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 19:02:01,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:02:01,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751500324] [2025-03-08 19:02:01,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751500324] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 19:02:01,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [780638128] [2025-03-08 19:02:01,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:02:01,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 19:02:01,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 19:02:01,981 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:02:01,983 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:02:02,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-08 19:02:02,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-08 19:02:02,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:02:02,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:02:02,815 INFO L256 TraceCheckSpWp]: Trace formula consists of 2599 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 19:02:02,818 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 19:02:02,829 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:02:02,830 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 19:02:02,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [780638128] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:02:02,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 19:02:02,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-08 19:02:02,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736591844] [2025-03-08 19:02:02,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:02:02,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 19:02:02,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:02:02,831 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 19:02:02,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 19:02:02,832 INFO L87 Difference]: Start difference. First operand 1256 states and 1746 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 19:02:02,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:02:02,918 INFO L93 Difference]: Finished difference Result 1278 states and 1772 transitions. [2025-03-08 19:02:02,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 19:02:02,919 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 45 [2025-03-08 19:02:02,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:02:02,925 INFO L225 Difference]: With dead ends: 1278 [2025-03-08 19:02:02,926 INFO L226 Difference]: Without dead ends: 1267 [2025-03-08 19:02:02,926 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 19:02:02,928 INFO L435 NwaCegarLoop]: 729 mSDtfsCounter, 723 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 723 SdHoareTripleChecker+Valid, 742 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 19:02:02,928 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [723 Valid, 742 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 19:02:02,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1267 states. [2025-03-08 19:02:02,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1267 to 1256. [2025-03-08 19:02:02,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1256 states, 931 states have (on average 1.351235230934479) internal successors, (1258), 943 states have internal predecessors, (1258), 246 states have call successors, (246), 79 states have call predecessors, (246), 78 states have return successors, (240), 240 states have call predecessors, (240), 240 states have call successors, (240) [2025-03-08 19:02:02,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1256 states to 1256 states and 1744 transitions. [2025-03-08 19:02:02,975 INFO L78 Accepts]: Start accepts. Automaton has 1256 states and 1744 transitions. Word has length 45 [2025-03-08 19:02:02,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:02:02,976 INFO L471 AbstractCegarLoop]: Abstraction has 1256 states and 1744 transitions. [2025-03-08 19:02:02,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 19:02:02,976 INFO L276 IsEmpty]: Start isEmpty. Operand 1256 states and 1744 transitions. [2025-03-08 19:02:02,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-08 19:02:02,978 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:02:02,978 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 19:02:02,990 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 19:02:03,178 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,SelfDestructingSolverStorable5 [2025-03-08 19:02:03,179 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:02:03,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:02:03,179 INFO L85 PathProgramCache]: Analyzing trace with hash 618561132, now seen corresponding path program 1 times [2025-03-08 19:02:03,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:02:03,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692837462] [2025-03-08 19:02:03,179 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:02:03,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:02:03,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-08 19:02:03,629 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-08 19:02:03,629 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:02:03,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:02:03,847 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 19:02:03,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:02:03,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692837462] [2025-03-08 19:02:03,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692837462] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 19:02:03,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [919775404] [2025-03-08 19:02:03,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:02:03,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 19:02:03,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 19:02:03,852 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:02:03,855 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:02:04,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-08 19:02:04,696 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-08 19:02:04,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:02:04,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:02:04,707 INFO L256 TraceCheckSpWp]: Trace formula consists of 2596 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 19:02:04,710 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 19:02:04,778 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:02:04,778 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 19:02:04,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [919775404] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:02:04,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 19:02:04,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-08 19:02:04,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106125919] [2025-03-08 19:02:04,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:02:04,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 19:02:04,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:02:04,779 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 19:02:04,779 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 19:02:04,779 INFO L87 Difference]: Start difference. First operand 1256 states and 1744 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 19:02:08,814 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 19:02:08,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:02:08,885 INFO L93 Difference]: Finished difference Result 1258 states and 1745 transitions. [2025-03-08 19:02:08,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 19:02:08,886 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 45 [2025-03-08 19:02:08,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:02:08,892 INFO L225 Difference]: With dead ends: 1258 [2025-03-08 19:02:08,893 INFO L226 Difference]: Without dead ends: 1255 [2025-03-08 19:02:08,893 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 19:02:08,894 INFO L435 NwaCegarLoop]: 714 mSDtfsCounter, 686 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 686 SdHoareTripleChecker+Valid, 714 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-03-08 19:02:08,895 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [686 Valid, 714 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-03-08 19:02:08,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1255 states. [2025-03-08 19:02:08,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1255 to 1255. [2025-03-08 19:02:08,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1255 states, 931 states have (on average 1.3501611170784102) internal successors, (1257), 942 states have internal predecessors, (1257), 245 states have call successors, (245), 79 states have call predecessors, (245), 78 states have return successors, (240), 240 states have call predecessors, (240), 240 states have call successors, (240) [2025-03-08 19:02:08,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1255 states to 1255 states and 1742 transitions. [2025-03-08 19:02:08,947 INFO L78 Accepts]: Start accepts. Automaton has 1255 states and 1742 transitions. Word has length 45 [2025-03-08 19:02:08,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:02:08,948 INFO L471 AbstractCegarLoop]: Abstraction has 1255 states and 1742 transitions. [2025-03-08 19:02:08,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 19:02:08,948 INFO L276 IsEmpty]: Start isEmpty. Operand 1255 states and 1742 transitions. [2025-03-08 19:02:08,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-08 19:02:08,949 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:02:08,949 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 19:02:08,962 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 19:02:09,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 19:02:09,150 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:02:09,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:02:09,150 INFO L85 PathProgramCache]: Analyzing trace with hash 1995021162, now seen corresponding path program 1 times [2025-03-08 19:02:09,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:02:09,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788789063] [2025-03-08 19:02:09,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:02:09,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:02:09,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-08 19:02:09,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-08 19:02:09,635 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:02:09,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:02:09,784 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 19:02:09,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:02:09,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788789063] [2025-03-08 19:02:09,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788789063] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 19:02:09,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1467171961] [2025-03-08 19:02:09,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:02:09,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 19:02:09,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 19:02:09,787 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:02:09,788 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:02:10,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-08 19:02:10,579 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-08 19:02:10,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:02:10,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:02:10,588 INFO L256 TraceCheckSpWp]: Trace formula consists of 2598 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 19:02:10,591 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 19:02:10,649 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:02:10,649 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 19:02:10,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1467171961] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:02:10,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 19:02:10,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-08 19:02:10,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562234180] [2025-03-08 19:02:10,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:02:10,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 19:02:10,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:02:10,650 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 19:02:10,650 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 19:02:10,650 INFO L87 Difference]: Start difference. First operand 1255 states and 1742 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 19:02:14,681 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 19:02:14,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:02:14,742 INFO L93 Difference]: Finished difference Result 1257 states and 1743 transitions. [2025-03-08 19:02:14,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 19:02:14,743 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 46 [2025-03-08 19:02:14,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:02:14,749 INFO L225 Difference]: With dead ends: 1257 [2025-03-08 19:02:14,749 INFO L226 Difference]: Without dead ends: 1254 [2025-03-08 19:02:14,750 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 19:02:14,750 INFO L435 NwaCegarLoop]: 712 mSDtfsCounter, 683 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 683 SdHoareTripleChecker+Valid, 712 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-03-08 19:02:14,751 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [683 Valid, 712 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-03-08 19:02:14,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1254 states. [2025-03-08 19:02:14,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1254 to 1254. [2025-03-08 19:02:14,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1254 states, 931 states have (on average 1.3490870032223417) internal successors, (1256), 941 states have internal predecessors, (1256), 244 states have call successors, (244), 79 states have call predecessors, (244), 78 states have return successors, (240), 240 states have call predecessors, (240), 240 states have call successors, (240) [2025-03-08 19:02:14,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1254 states to 1254 states and 1740 transitions. [2025-03-08 19:02:14,791 INFO L78 Accepts]: Start accepts. Automaton has 1254 states and 1740 transitions. Word has length 46 [2025-03-08 19:02:14,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:02:14,791 INFO L471 AbstractCegarLoop]: Abstraction has 1254 states and 1740 transitions. [2025-03-08 19:02:14,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 19:02:14,791 INFO L276 IsEmpty]: Start isEmpty. Operand 1254 states and 1740 transitions. [2025-03-08 19:02:14,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-08 19:02:14,792 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:02:14,792 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 19:02:14,805 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-08 19:02:14,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 19:02:14,993 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:02:14,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:02:14,994 INFO L85 PathProgramCache]: Analyzing trace with hash 1715608109, now seen corresponding path program 1 times [2025-03-08 19:02:14,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:02:14,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182472860] [2025-03-08 19:02:14,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:02:14,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:02:15,311 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-08 19:02:15,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-08 19:02:15,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:02:15,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:02:15,473 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 19:02:15,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:02:15,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182472860] [2025-03-08 19:02:15,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182472860] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 19:02:15,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1855945892] [2025-03-08 19:02:15,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:02:15,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 19:02:15,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 19:02:15,476 INFO L229 MonitoredProcess]: Starting monitored process 6 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:02:15,478 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 19:02:16,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-08 19:02:16,276 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-08 19:02:16,276 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:02:16,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:02:16,285 INFO L256 TraceCheckSpWp]: Trace formula consists of 2600 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 19:02:16,287 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 19:02:16,349 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:02:16,349 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 19:02:16,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1855945892] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:02:16,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 19:02:16,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-08 19:02:16,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521526899] [2025-03-08 19:02:16,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:02:16,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 19:02:16,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:02:16,350 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 19:02:16,350 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 19:02:16,350 INFO L87 Difference]: Start difference. First operand 1254 states and 1740 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 19:02:20,384 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 19:02:20,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:02:20,453 INFO L93 Difference]: Finished difference Result 1256 states and 1741 transitions. [2025-03-08 19:02:20,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 19:02:20,453 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 47 [2025-03-08 19:02:20,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:02:20,459 INFO L225 Difference]: With dead ends: 1256 [2025-03-08 19:02:20,459 INFO L226 Difference]: Without dead ends: 1253 [2025-03-08 19:02:20,460 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 19:02:20,461 INFO L435 NwaCegarLoop]: 710 mSDtfsCounter, 680 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 680 SdHoareTripleChecker+Valid, 710 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-03-08 19:02:20,461 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [680 Valid, 710 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-03-08 19:02:20,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1253 states. [2025-03-08 19:02:20,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1253 to 1253. [2025-03-08 19:02:20,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1253 states, 931 states have (on average 1.3480128893662728) internal successors, (1255), 940 states have internal predecessors, (1255), 243 states have call successors, (243), 79 states have call predecessors, (243), 78 states have return successors, (240), 240 states have call predecessors, (240), 240 states have call successors, (240) [2025-03-08 19:02:20,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1253 states to 1253 states and 1738 transitions. [2025-03-08 19:02:20,504 INFO L78 Accepts]: Start accepts. Automaton has 1253 states and 1738 transitions. Word has length 47 [2025-03-08 19:02:20,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:02:20,505 INFO L471 AbstractCegarLoop]: Abstraction has 1253 states and 1738 transitions. [2025-03-08 19:02:20,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 19:02:20,505 INFO L276 IsEmpty]: Start isEmpty. Operand 1253 states and 1738 transitions. [2025-03-08 19:02:20,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-08 19:02:20,506 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:02:20,506 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 19:02:20,521 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-08 19:02:20,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 19:02:20,707 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:02:20,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:02:20,708 INFO L85 PathProgramCache]: Analyzing trace with hash 1643737035, now seen corresponding path program 1 times [2025-03-08 19:02:20,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:02:20,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484443965] [2025-03-08 19:02:20,708 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:02:20,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:02:21,106 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-08 19:02:21,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-08 19:02:21,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:02:21,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:02:21,273 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 19:02:21,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:02:21,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484443965] [2025-03-08 19:02:21,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484443965] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 19:02:21,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1027787440] [2025-03-08 19:02:21,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:02:21,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 19:02:21,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 19:02:21,276 INFO L229 MonitoredProcess]: Starting monitored process 7 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:02:21,278 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-08 19:02:21,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-08 19:02:22,100 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-08 19:02:22,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:02:22,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:02:22,110 INFO L256 TraceCheckSpWp]: Trace formula consists of 2602 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 19:02:22,114 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 19:02:22,171 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:02:22,171 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 19:02:22,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1027787440] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:02:22,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 19:02:22,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-08 19:02:22,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227574680] [2025-03-08 19:02:22,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:02:22,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 19:02:22,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:02:22,172 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 19:02:22,172 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 19:02:22,172 INFO L87 Difference]: Start difference. First operand 1253 states and 1738 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 19:02:26,210 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 19:02:26,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:02:26,309 INFO L93 Difference]: Finished difference Result 1677 states and 2306 transitions. [2025-03-08 19:02:26,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 19:02:26,310 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 48 [2025-03-08 19:02:26,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:02:26,320 INFO L225 Difference]: With dead ends: 1677 [2025-03-08 19:02:26,320 INFO L226 Difference]: Without dead ends: 1640 [2025-03-08 19:02:26,321 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 19:02:26,322 INFO L435 NwaCegarLoop]: 775 mSDtfsCounter, 635 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 635 SdHoareTripleChecker+Valid, 1108 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-03-08 19:02:26,322 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [635 Valid, 1108 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-03-08 19:02:26,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1640 states. [2025-03-08 19:02:26,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1640 to 1640. [2025-03-08 19:02:26,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1640 states, 1196 states have (on average 1.330267558528428) internal successors, (1591), 1207 states have internal predecessors, (1591), 334 states have call successors, (334), 110 states have call predecessors, (334), 109 states have return successors, (333), 333 states have call predecessors, (333), 333 states have call successors, (333) [2025-03-08 19:02:26,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1640 states to 1640 states and 2258 transitions. [2025-03-08 19:02:26,390 INFO L78 Accepts]: Start accepts. Automaton has 1640 states and 2258 transitions. Word has length 48 [2025-03-08 19:02:26,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:02:26,390 INFO L471 AbstractCegarLoop]: Abstraction has 1640 states and 2258 transitions. [2025-03-08 19:02:26,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 19:02:26,390 INFO L276 IsEmpty]: Start isEmpty. Operand 1640 states and 2258 transitions. [2025-03-08 19:02:26,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-08 19:02:26,392 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:02:26,392 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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:02:26,404 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-08 19:02:26,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 19:02:26,597 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:02:26,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:02:26,597 INFO L85 PathProgramCache]: Analyzing trace with hash 265659414, now seen corresponding path program 1 times [2025-03-08 19:02:26,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:02:26,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220059536] [2025-03-08 19:02:26,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:02:26,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:02:26,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-08 19:02:26,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-08 19:02:26,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:02:26,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:02:27,118 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-08 19:02:27,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:02:27,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220059536] [2025-03-08 19:02:27,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220059536] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 19:02:27,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1165888288] [2025-03-08 19:02:27,119 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:02:27,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 19:02:27,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 19:02:27,121 INFO L229 MonitoredProcess]: Starting monitored process 8 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:02:27,123 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-08 19:02:27,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-08 19:02:28,009 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-08 19:02:28,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:02:28,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:02:28,018 INFO L256 TraceCheckSpWp]: Trace formula consists of 2821 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 19:02:28,021 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 19:02:28,035 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-08 19:02:28,035 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 19:02:28,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1165888288] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:02:28,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 19:02:28,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-08 19:02:28,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758765845] [2025-03-08 19:02:28,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:02:28,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 19:02:28,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:02:28,037 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 19:02:28,037 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 19:02:28,037 INFO L87 Difference]: Start difference. First operand 1640 states and 2258 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 19:02:28,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:02:28,163 INFO L93 Difference]: Finished difference Result 3294 states and 4538 transitions. [2025-03-08 19:02:28,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 19:02:28,163 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 75 [2025-03-08 19:02:28,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:02:28,172 INFO L225 Difference]: With dead ends: 3294 [2025-03-08 19:02:28,172 INFO L226 Difference]: Without dead ends: 1657 [2025-03-08 19:02:28,177 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 19:02:28,178 INFO L435 NwaCegarLoop]: 667 mSDtfsCounter, 17 mSDsluCounter, 658 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 1325 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 19:02:28,178 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 1325 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 19:02:28,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1657 states. [2025-03-08 19:02:28,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1657 to 1642. [2025-03-08 19:02:28,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1642 states, 1198 states have (on average 1.3297161936560935) internal successors, (1593), 1209 states have internal predecessors, (1593), 334 states have call successors, (334), 110 states have call predecessors, (334), 109 states have return successors, (333), 333 states have call predecessors, (333), 333 states have call successors, (333) [2025-03-08 19:02:28,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1642 states to 1642 states and 2260 transitions. [2025-03-08 19:02:28,245 INFO L78 Accepts]: Start accepts. Automaton has 1642 states and 2260 transitions. Word has length 75 [2025-03-08 19:02:28,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:02:28,246 INFO L471 AbstractCegarLoop]: Abstraction has 1642 states and 2260 transitions. [2025-03-08 19:02:28,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 19:02:28,246 INFO L276 IsEmpty]: Start isEmpty. Operand 1642 states and 2260 transitions. [2025-03-08 19:02:28,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-08 19:02:28,250 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:02:28,250 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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] [2025-03-08 19:02:28,264 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-08 19:02:28,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 19:02:28,451 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:02:28,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:02:28,452 INFO L85 PathProgramCache]: Analyzing trace with hash 121724659, now seen corresponding path program 1 times [2025-03-08 19:02:28,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:02:28,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778841121] [2025-03-08 19:02:28,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:02:28,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:02:28,819 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-08 19:02:28,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-08 19:02:28,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:02:28,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:02:28,995 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-08 19:02:28,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:02:28,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778841121] [2025-03-08 19:02:28,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778841121] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 19:02:28,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1385113311] [2025-03-08 19:02:28,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:02:28,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 19:02:28,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 19:02:29,004 INFO L229 MonitoredProcess]: Starting monitored process 9 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:02:29,005 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-08 19:02:29,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-08 19:02:29,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-08 19:02:29,926 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:02:29,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:02:29,936 INFO L256 TraceCheckSpWp]: Trace formula consists of 2832 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 19:02:29,939 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 19:02:29,954 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-08 19:02:29,955 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 19:02:29,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1385113311] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:02:29,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 19:02:29,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-08 19:02:29,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203071619] [2025-03-08 19:02:29,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:02:29,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 19:02:29,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:02:29,955 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 19:02:29,955 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 19:02:29,956 INFO L87 Difference]: Start difference. First operand 1642 states and 2260 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 19:02:33,985 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 19:02:34,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:02:34,084 INFO L93 Difference]: Finished difference Result 1642 states and 2260 transitions. [2025-03-08 19:02:34,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 19:02:34,084 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 79 [2025-03-08 19:02:34,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:02:34,086 INFO L225 Difference]: With dead ends: 1642 [2025-03-08 19:02:34,086 INFO L226 Difference]: Without dead ends: 0 [2025-03-08 19:02:34,090 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 19:02:34,090 INFO L435 NwaCegarLoop]: 898 mSDtfsCounter, 330 mSDsluCounter, 631 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 330 SdHoareTripleChecker+Valid, 1529 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-03-08 19:02:34,091 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [330 Valid, 1529 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-03-08 19:02:34,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-08 19:02:34,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-08 19:02:34,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 19:02:34,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-08 19:02:34,092 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 79 [2025-03-08 19:02:34,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:02:34,092 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-08 19:02:34,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 19:02:34,093 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-08 19:02:34,093 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-08 19:02:34,095 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 19:02:34,108 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-08 19:02:34,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-08 19:02:34,298 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 19:02:34,300 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-08 19:02:43,381 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 19:02:43,397 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 07:02:43 BoogieIcfgContainer [2025-03-08 19:02:43,398 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 19:02:43,399 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 19:02:43,399 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 19:02:43,399 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 19:02:43,399 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 07:01:51" (3/4) ... [2025-03-08 19:02:43,401 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-08 19:02:43,405 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure copy_from_user [2025-03-08 19:02:43,405 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure pi_release [2025-03-08 19:02:43,405 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure pi_init [2025-03-08 19:02:43,405 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure write_reg [2025-03-08 19:02:43,405 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure pg_sleep [2025-03-08 19:02:43,405 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure pi_read_regr [2025-03-08 19:02:43,405 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure might_fault [2025-03-08 19:02:43,405 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure printk [2025-03-08 19:02:43,405 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure pi_disconnect [2025-03-08 19:02:43,406 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure pg_probe [2025-03-08 19:02:43,406 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure status_reg [2025-03-08 19:02:43,406 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure pg_completion [2025-03-08 19:02:43,406 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure ldv_unregister_chrdev_11 [2025-03-08 19:02:43,406 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure DRIVE [2025-03-08 19:02:43,406 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure mutex_unlock [2025-03-08 19:02:43,406 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure copy_to_user [2025-03-08 19:02:43,406 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure pg_wait [2025-03-08 19:02:43,406 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure ldv_error [2025-03-08 19:02:43,406 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure pg_write [2025-03-08 19:02:43,406 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure pi_connect [2025-03-08 19:02:43,406 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure pg_command [2025-03-08 19:02:43,406 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure ldv__builtin_expect [2025-03-08 19:02:43,406 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure clear_bit [2025-03-08 19:02:43,406 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure read_reg [2025-03-08 19:02:43,406 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure pg_reset [2025-03-08 19:02:43,406 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2025-03-08 19:02:43,406 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure mutex_lock [2025-03-08 19:02:43,406 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure _copy_from_user [2025-03-08 19:02:43,406 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure xs [2025-03-08 19:02:43,406 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure pg_identify [2025-03-08 19:02:43,406 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure pi_write_block [2025-03-08 19:02:43,427 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 208 nodes and edges [2025-03-08 19:02:43,429 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 94 nodes and edges [2025-03-08 19:02:43,431 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 33 nodes and edges [2025-03-08 19:02:43,433 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2025-03-08 19:02:43,435 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-08 19:02:43,437 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-03-08 19:02:43,438 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-08 19:02:43,602 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-08 19:02:43,602 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-08 19:02:43,602 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 19:02:43,603 INFO L158 Benchmark]: Toolchain (without parser) took 60155.87ms. Allocated memory was 201.3MB in the beginning and 830.5MB in the end (delta: 629.1MB). Free memory was 148.8MB in the beginning and 323.3MB in the end (delta: -174.5MB). Peak memory consumption was 446.6MB. Max. memory is 16.1GB. [2025-03-08 19:02:43,603 INFO L158 Benchmark]: CDTParser took 1.13ms. Allocated memory is still 201.3MB. Free memory is still 118.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 19:02:43,603 INFO L158 Benchmark]: CACSL2BoogieTranslator took 865.62ms. Allocated memory is still 201.3MB. Free memory was 148.8MB in the beginning and 73.7MB in the end (delta: 75.0MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. [2025-03-08 19:02:43,603 INFO L158 Benchmark]: Boogie Procedure Inliner took 113.40ms. Allocated memory is still 201.3MB. Free memory was 73.7MB in the beginning and 59.9MB in the end (delta: 13.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 19:02:43,603 INFO L158 Benchmark]: Boogie Preprocessor took 259.95ms. Allocated memory is still 201.3MB. Free memory was 59.9MB in the beginning and 126.8MB in the end (delta: -66.9MB). Peak memory consumption was 35.0MB. Max. memory is 16.1GB. [2025-03-08 19:02:43,603 INFO L158 Benchmark]: IcfgBuilder took 6320.09ms. Allocated memory is still 201.3MB. Free memory was 126.8MB in the beginning and 53.5MB in the end (delta: 73.3MB). Peak memory consumption was 95.8MB. Max. memory is 16.1GB. [2025-03-08 19:02:43,604 INFO L158 Benchmark]: TraceAbstraction took 52387.85ms. Allocated memory was 201.3MB in the beginning and 830.5MB in the end (delta: 629.1MB). Free memory was 51.9MB in the beginning and 352.5MB in the end (delta: -300.6MB). Peak memory consumption was 423.6MB. Max. memory is 16.1GB. [2025-03-08 19:02:43,604 INFO L158 Benchmark]: Witness Printer took 203.40ms. Allocated memory is still 830.5MB. Free memory was 352.5MB in the beginning and 323.3MB in the end (delta: 29.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-08 19:02:43,605 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.13ms. Allocated memory is still 201.3MB. Free memory is still 118.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 865.62ms. Allocated memory is still 201.3MB. Free memory was 148.8MB in the beginning and 73.7MB in the end (delta: 75.0MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 113.40ms. Allocated memory is still 201.3MB. Free memory was 73.7MB in the beginning and 59.9MB in the end (delta: 13.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 259.95ms. Allocated memory is still 201.3MB. Free memory was 59.9MB in the beginning and 126.8MB in the end (delta: -66.9MB). Peak memory consumption was 35.0MB. Max. memory is 16.1GB. * IcfgBuilder took 6320.09ms. Allocated memory is still 201.3MB. Free memory was 126.8MB in the beginning and 53.5MB in the end (delta: 73.3MB). Peak memory consumption was 95.8MB. Max. memory is 16.1GB. * TraceAbstraction took 52387.85ms. Allocated memory was 201.3MB in the beginning and 830.5MB in the end (delta: 629.1MB). Free memory was 51.9MB in the beginning and 352.5MB in the end (delta: -300.6MB). Peak memory consumption was 423.6MB. Max. memory is 16.1GB. * Witness Printer took 203.40ms. Allocated memory is still 830.5MB. Free memory was 352.5MB in the beginning and 323.3MB in the end (delta: 29.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 2808]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ volatile (".pushsection .smp_locks,\"a\"\n.balign 4\n.long 671f - .\n.popsection\n671:\n\tlock; btr %1,%0": "+m" (*((long volatile *)addr)): "Ir" (nr)); [2808] - GenericResultAtLocation [Line: 2815]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ volatile (".pushsection .smp_locks,\"a\"\n.balign 4\n.long 671f - .\n.popsection\n671:\n\tlock; bts %2,%1\n\tsbb %0,%0": "=r" (oldbit), "+m" (*((long volatile *)addr)): "Ir" (nr): "memory"); [2815-2816] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 4044]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 32 procedures, 529 locations, 845 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 43.2s, OverallIterations: 12, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 25.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 6 mSolverCounterUnknown, 5644 SdHoareTripleChecker+Valid, 24.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5635 mSDsluCounter, 13635 SdHoareTripleChecker+Invalid, 24.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4301 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 310 IncrementalHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 9334 mSDtfsCounter, 310 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 460 GetRequests, 432 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1642occurred in iteration=11, InterpolantAutomatonStates: 36, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 12 MinimizatonAttempts, 70 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 2.4s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 940 NumberOfCodeBlocks, 940 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 920 ConstructedInterpolants, 0 QuantifiedInterpolants, 1456 SizeOfPredicates, 0 NumberOfNonLiveVariables, 21229 ConjunctsInSsa, 23 ConjunctsInUnsatCore, 20 InterpolantComputations, 12 PerfectInterpolantSequences, 84/92 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 3033]: Location Invariant Derived location invariant: (((((((ldv_state_variable_0 == 1) && (1 == ldv_mutex_mutex_of_device)) && (disable == 0)) && (ldv_retval_1 == 0)) && (ldv_mutex_lock == 1)) && (ldv_mutex_pg_mutex == 1)) && (ldv_mutex_cred_guard_mutex_of_signal_struct == 1)) RESULT: Ultimate proved your program to be correct! [2025-03-08 19:02:43,636 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE