./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--pt.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--pt.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 3b154baf348652a9aadd484f41053a90df6581eb3d7346fd488d4cc05040e74b --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 19:01:44,017 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 19:01:44,079 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:44,083 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 19:01:44,087 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 19:01:44,106 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 19:01:44,107 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 19:01:44,107 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 19:01:44,108 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 19:01:44,108 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 19:01:44,108 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 19:01:44,108 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 19:01:44,109 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 19:01:44,109 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 19:01:44,109 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 19:01:44,109 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 19:01:44,110 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 19:01:44,110 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 19:01:44,110 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 19:01:44,110 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 19:01:44,111 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 19:01:44,111 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 19:01:44,111 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 19:01:44,111 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 19:01:44,111 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 19:01:44,111 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 19:01:44,111 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 19:01:44,111 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 19:01:44,111 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 19:01:44,111 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 19:01:44,111 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 19:01:44,111 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 19:01:44,111 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 19:01:44,112 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 19:01:44,112 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 19:01:44,112 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 19:01:44,112 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 19:01:44,112 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 19:01:44,112 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 19:01:44,112 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 19:01:44,112 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 -> 3b154baf348652a9aadd484f41053a90df6581eb3d7346fd488d4cc05040e74b [2025-03-08 19:01:44,341 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 19:01:44,350 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 19:01:44,354 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 19:01:44,355 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 19:01:44,357 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 19:01:44,358 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--pt.ko-main.cil.out.i [2025-03-08 19:01:45,606 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39abcbccd/126e168007d941169538e888a5079098/FLAG438a0f61e [2025-03-08 19:01:46,010 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 19:01:46,010 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-consumption/32_7a_cilled_linux-3.8-rc1-drivers--block--paride--pt.ko-main.cil.out.i [2025-03-08 19:01:46,040 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39abcbccd/126e168007d941169538e888a5079098/FLAG438a0f61e [2025-03-08 19:01:46,188 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39abcbccd/126e168007d941169538e888a5079098 [2025-03-08 19:01:46,190 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 19:01:46,192 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 19:01:46,193 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 19:01:46,193 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 19:01:46,195 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 19:01:46,196 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 07:01:46" (1/1) ... [2025-03-08 19:01:46,196 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@600e9271 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:01:46, skipping insertion in model container [2025-03-08 19:01:46,197 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 07:01:46" (1/1) ... [2025-03-08 19:01:46,250 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 19:01:46,912 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--pt.ko-main.cil.out.i[119285,119298] [2025-03-08 19:01:46,946 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 19:01:46,979 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 19:01:47,037 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile (".pushsection .smp_locks,\"a\"\n.balign 4\n.long 671f - .\n.popsection\n671:\n\tlock; incl %0": "+m" (v->counter)); [2827] [2025-03-08 19:01:47,040 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile (".pushsection .smp_locks,\"a\"\n.balign 4\n.long 671f - .\n.popsection\n671:\n\tlock; decl %0; sete %1": "+m" (v->counter), "=qm" (c): : "memory"); [2834-2835] [2025-03-08 19:01:47,146 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--pt.ko-main.cil.out.i[119285,119298] [2025-03-08 19:01:47,158 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 19:01:47,245 INFO L204 MainTranslator]: Completed translation [2025-03-08 19:01:47,246 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:01:47 WrapperNode [2025-03-08 19:01:47,246 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 19:01:47,248 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 19:01:47,248 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 19:01:47,248 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 19:01:47,253 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:47" (1/1) ... [2025-03-08 19:01:47,300 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:47" (1/1) ... [2025-03-08 19:01:47,374 INFO L138 Inliner]: procedures = 146, calls = 1519, calls flagged for inlining = 50, calls inlined = 42, statements flattened = 2396 [2025-03-08 19:01:47,374 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 19:01:47,375 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 19:01:47,375 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 19:01:47,375 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 19:01:47,382 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:47" (1/1) ... [2025-03-08 19:01:47,383 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:47" (1/1) ... [2025-03-08 19:01:47,402 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:47" (1/1) ... [2025-03-08 19:01:47,480 INFO L175 MemorySlicer]: Split 1097 memory accesses to 21 slices as follows [2, 28, 24, 5, 11, 1, 11, 6, 1, 392, 6, 29, 3, 31, 13, 1, 11, 2, 3, 5, 512]. 47 percent of accesses are in the largest equivalence class. The 797 initializations are split as follows [2, 0, 0, 5, 11, 0, 11, 0, 1, 176, 6, 29, 3, 24, 13, 0, 4, 0, 0, 0, 512]. The 201 writes are split as follows [0, 28, 24, 0, 0, 0, 0, 5, 0, 139, 0, 0, 0, 0, 0, 0, 0, 2, 2, 1, 0]. [2025-03-08 19:01:47,480 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:47" (1/1) ... [2025-03-08 19:01:47,480 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:47" (1/1) ... [2025-03-08 19:01:47,549 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:47" (1/1) ... [2025-03-08 19:01:47,554 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:47" (1/1) ... [2025-03-08 19:01:47,571 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:47" (1/1) ... [2025-03-08 19:01:47,582 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:47" (1/1) ... [2025-03-08 19:01:47,602 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 19:01:47,604 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 19:01:47,604 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 19:01:47,604 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 19:01:47,605 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:01:47" (1/1) ... [2025-03-08 19:01:47,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 19:01:47,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 19:01:47,632 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:47,635 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:47,652 INFO L130 BoogieDeclarations]: Found specification of procedure pi_release [2025-03-08 19:01:47,652 INFO L138 BoogieDeclarations]: Found implementation of procedure pi_release [2025-03-08 19:01:47,652 INFO L130 BoogieDeclarations]: Found specification of procedure write_reg [2025-03-08 19:01:47,652 INFO L138 BoogieDeclarations]: Found implementation of procedure write_reg [2025-03-08 19:01:47,652 INFO L130 BoogieDeclarations]: Found specification of procedure pi_disconnect [2025-03-08 19:01:47,653 INFO L138 BoogieDeclarations]: Found implementation of procedure pi_disconnect [2025-03-08 19:01:47,653 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_pt_mutex [2025-03-08 19:01:47,653 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_pt_mutex [2025-03-08 19:01:47,653 INFO L130 BoogieDeclarations]: Found specification of procedure status_reg [2025-03-08 19:01:47,653 INFO L138 BoogieDeclarations]: Found implementation of procedure status_reg [2025-03-08 19:01:47,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-03-08 19:01:47,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-03-08 19:01:47,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-03-08 19:01:47,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-03-08 19:01:47,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-03-08 19:01:47,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-03-08 19:01:47,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2025-03-08 19:01:47,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2025-03-08 19:01:47,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#8 [2025-03-08 19:01:47,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#9 [2025-03-08 19:01:47,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#10 [2025-03-08 19:01:47,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#11 [2025-03-08 19:01:47,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#12 [2025-03-08 19:01:47,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#13 [2025-03-08 19:01:47,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#14 [2025-03-08 19:01:47,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#15 [2025-03-08 19:01:47,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#16 [2025-03-08 19:01:47,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#17 [2025-03-08 19:01:47,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#18 [2025-03-08 19:01:47,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#19 [2025-03-08 19:01:47,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#20 [2025-03-08 19:01:47,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-03-08 19:01:47,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-03-08 19:01:47,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-03-08 19:01:47,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-03-08 19:01:47,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-03-08 19:01:47,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2025-03-08 19:01:47,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2025-03-08 19:01:47,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#7 [2025-03-08 19:01:47,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#8 [2025-03-08 19:01:47,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#9 [2025-03-08 19:01:47,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#10 [2025-03-08 19:01:47,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#11 [2025-03-08 19:01:47,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#12 [2025-03-08 19:01:47,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#13 [2025-03-08 19:01:47,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#14 [2025-03-08 19:01:47,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#15 [2025-03-08 19:01:47,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#16 [2025-03-08 19:01:47,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#17 [2025-03-08 19:01:47,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#18 [2025-03-08 19:01:47,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#19 [2025-03-08 19:01:47,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#20 [2025-03-08 19:01:47,656 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 19:01:47,656 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 19:01:47,656 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-08 19:01:47,656 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-08 19:01:47,656 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-08 19:01:47,657 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-08 19:01:47,657 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-08 19:01:47,657 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-08 19:01:47,657 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-03-08 19:01:47,657 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-03-08 19:01:47,657 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-03-08 19:01:47,657 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-03-08 19:01:47,657 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-03-08 19:01:47,657 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-03-08 19:01:47,657 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-03-08 19:01:47,657 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2025-03-08 19:01:47,657 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2025-03-08 19:01:47,657 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#17 [2025-03-08 19:01:47,657 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#18 [2025-03-08 19:01:47,657 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#19 [2025-03-08 19:01:47,657 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#20 [2025-03-08 19:01:47,657 INFO L130 BoogieDeclarations]: Found specification of procedure pi_read_block [2025-03-08 19:01:47,657 INFO L138 BoogieDeclarations]: Found implementation of procedure pi_read_block [2025-03-08 19:01:47,657 INFO L130 BoogieDeclarations]: Found specification of procedure read_reg [2025-03-08 19:01:47,657 INFO L138 BoogieDeclarations]: Found implementation of procedure read_reg [2025-03-08 19:01:47,657 INFO L130 BoogieDeclarations]: Found specification of procedure pt_media_access_cmd [2025-03-08 19:01:47,657 INFO L138 BoogieDeclarations]: Found implementation of procedure pt_media_access_cmd [2025-03-08 19:01:47,657 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2025-03-08 19:01:47,657 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2025-03-08 19:01:47,657 INFO L130 BoogieDeclarations]: Found specification of procedure pt_reset [2025-03-08 19:01:47,657 INFO L138 BoogieDeclarations]: Found implementation of procedure pt_reset [2025-03-08 19:01:47,657 INFO L130 BoogieDeclarations]: Found specification of procedure pt_identify [2025-03-08 19:01:47,657 INFO L138 BoogieDeclarations]: Found implementation of procedure pt_identify [2025-03-08 19:01:47,657 INFO L130 BoogieDeclarations]: Found specification of procedure pt_command [2025-03-08 19:01:47,657 INFO L138 BoogieDeclarations]: Found implementation of procedure pt_command [2025-03-08 19:01:47,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 19:01:47,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 19:01:47,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-08 19:01:47,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-08 19:01:47,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-08 19:01:47,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-08 19:01:47,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-08 19:01:47,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-08 19:01:47,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-03-08 19:01:47,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-03-08 19:01:47,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-03-08 19:01:47,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-03-08 19:01:47,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-03-08 19:01:47,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-03-08 19:01:47,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-03-08 19:01:47,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2025-03-08 19:01:47,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2025-03-08 19:01:47,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#17 [2025-03-08 19:01:47,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#18 [2025-03-08 19:01:47,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#19 [2025-03-08 19:01:47,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#20 [2025-03-08 19:01:47,659 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2025-03-08 19:01:47,659 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2025-03-08 19:01:47,659 INFO L130 BoogieDeclarations]: Found specification of procedure pt_write [2025-03-08 19:01:47,659 INFO L138 BoogieDeclarations]: Found implementation of procedure pt_write [2025-03-08 19:01:47,659 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2025-03-08 19:01:47,659 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2025-03-08 19:01:47,659 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2025-03-08 19:01:47,659 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2025-03-08 19:01:47,660 INFO L130 BoogieDeclarations]: Found specification of procedure pt_atapi [2025-03-08 19:01:47,660 INFO L138 BoogieDeclarations]: Found implementation of procedure pt_atapi [2025-03-08 19:01:47,660 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-08 19:01:47,660 INFO L130 BoogieDeclarations]: Found specification of procedure pt_poll_dsc [2025-03-08 19:01:47,660 INFO L138 BoogieDeclarations]: Found implementation of procedure pt_poll_dsc [2025-03-08 19:01:47,660 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_pt_mutex [2025-03-08 19:01:47,660 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_pt_mutex [2025-03-08 19:01:47,660 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock [2025-03-08 19:01:47,660 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock [2025-03-08 19:01:47,660 INFO L130 BoogieDeclarations]: Found specification of procedure pt_req_sense [2025-03-08 19:01:47,660 INFO L138 BoogieDeclarations]: Found implementation of procedure pt_req_sense [2025-03-08 19:01:47,660 INFO L130 BoogieDeclarations]: Found specification of procedure copy_from_user [2025-03-08 19:01:47,660 INFO L138 BoogieDeclarations]: Found implementation of procedure copy_from_user [2025-03-08 19:01:47,660 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 19:01:47,660 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_unregister_chrdev_17 [2025-03-08 19:01:47,660 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_unregister_chrdev_17 [2025-03-08 19:01:47,661 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_inc [2025-03-08 19:01:47,661 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_inc [2025-03-08 19:01:47,661 INFO L130 BoogieDeclarations]: Found specification of procedure __const_udelay [2025-03-08 19:01:47,661 INFO L138 BoogieDeclarations]: Found implementation of procedure __const_udelay [2025-03-08 19:01:47,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-08 19:01:47,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-08 19:01:47,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-08 19:01:47,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-08 19:01:47,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-03-08 19:01:47,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-03-08 19:01:47,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-03-08 19:01:47,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-03-08 19:01:47,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-03-08 19:01:47,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-03-08 19:01:47,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-03-08 19:01:47,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-03-08 19:01:47,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-03-08 19:01:47,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-03-08 19:01:47,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2025-03-08 19:01:47,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#15 [2025-03-08 19:01:47,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#16 [2025-03-08 19:01:47,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#17 [2025-03-08 19:01:47,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#18 [2025-03-08 19:01:47,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#19 [2025-03-08 19:01:47,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#20 [2025-03-08 19:01:47,662 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-08 19:01:47,662 INFO L130 BoogieDeclarations]: Found specification of procedure DRIVE [2025-03-08 19:01:47,662 INFO L138 BoogieDeclarations]: Found implementation of procedure DRIVE [2025-03-08 19:01:47,662 INFO L130 BoogieDeclarations]: Found specification of procedure pt_completion [2025-03-08 19:01:47,662 INFO L138 BoogieDeclarations]: Found implementation of procedure pt_completion [2025-03-08 19:01:47,662 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-08 19:01:47,662 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-08 19:01:47,662 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-08 19:01:47,662 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-08 19:01:47,662 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-03-08 19:01:47,662 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-03-08 19:01:47,662 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-03-08 19:01:47,662 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-03-08 19:01:47,662 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-03-08 19:01:47,662 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-03-08 19:01:47,662 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-03-08 19:01:47,662 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-03-08 19:01:47,662 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-03-08 19:01:47,662 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-03-08 19:01:47,662 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2025-03-08 19:01:47,663 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#15 [2025-03-08 19:01:47,663 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#16 [2025-03-08 19:01:47,663 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#17 [2025-03-08 19:01:47,663 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#18 [2025-03-08 19:01:47,663 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#19 [2025-03-08 19:01:47,663 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#20 [2025-03-08 19:01:47,663 INFO L130 BoogieDeclarations]: Found specification of procedure pt_sleep [2025-03-08 19:01:47,663 INFO L138 BoogieDeclarations]: Found implementation of procedure pt_sleep [2025-03-08 19:01:47,663 INFO L130 BoogieDeclarations]: Found specification of procedure pt_write_fm [2025-03-08 19:01:47,663 INFO L138 BoogieDeclarations]: Found implementation of procedure pt_write_fm [2025-03-08 19:01:47,663 INFO L130 BoogieDeclarations]: Found specification of procedure iminor [2025-03-08 19:01:47,663 INFO L138 BoogieDeclarations]: Found implementation of procedure iminor [2025-03-08 19:01:47,663 INFO L130 BoogieDeclarations]: Found specification of procedure pi_write_block [2025-03-08 19:01:47,663 INFO L138 BoogieDeclarations]: Found implementation of procedure pi_write_block [2025-03-08 19:01:47,663 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 19:01:47,663 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-08 19:01:47,663 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-08 19:01:47,663 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-08 19:01:47,663 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-03-08 19:01:47,663 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-03-08 19:01:47,663 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-03-08 19:01:47,663 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-03-08 19:01:47,663 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2025-03-08 19:01:47,663 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2025-03-08 19:01:47,663 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2025-03-08 19:01:47,663 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2025-03-08 19:01:47,663 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2025-03-08 19:01:47,663 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2025-03-08 19:01:47,663 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2025-03-08 19:01:47,663 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#14 [2025-03-08 19:01:47,663 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#15 [2025-03-08 19:01:47,663 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#16 [2025-03-08 19:01:47,663 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#17 [2025-03-08 19:01:47,663 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#18 [2025-03-08 19:01:47,663 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#19 [2025-03-08 19:01:47,663 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#20 [2025-03-08 19:01:47,663 INFO L130 BoogieDeclarations]: Found specification of procedure pi_init [2025-03-08 19:01:47,666 INFO L138 BoogieDeclarations]: Found implementation of procedure pi_init [2025-03-08 19:01:47,666 INFO L130 BoogieDeclarations]: Found specification of procedure pi_read_regr [2025-03-08 19:01:47,666 INFO L138 BoogieDeclarations]: Found implementation of procedure pi_read_regr [2025-03-08 19:01:47,666 INFO L130 BoogieDeclarations]: Found specification of procedure might_fault [2025-03-08 19:01:47,666 INFO L138 BoogieDeclarations]: Found implementation of procedure might_fault [2025-03-08 19:01:47,666 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2025-03-08 19:01:47,666 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2025-03-08 19:01:47,666 INFO L130 BoogieDeclarations]: Found specification of procedure pt_wait [2025-03-08 19:01:47,666 INFO L138 BoogieDeclarations]: Found implementation of procedure pt_wait [2025-03-08 19:01:47,666 INFO L130 BoogieDeclarations]: Found specification of procedure pi_connect [2025-03-08 19:01:47,666 INFO L138 BoogieDeclarations]: Found implementation of procedure pi_connect [2025-03-08 19:01:47,666 INFO L130 BoogieDeclarations]: Found specification of procedure device_destroy [2025-03-08 19:01:47,666 INFO L138 BoogieDeclarations]: Found implementation of procedure device_destroy [2025-03-08 19:01:47,666 INFO L130 BoogieDeclarations]: Found specification of procedure pt_probe [2025-03-08 19:01:47,666 INFO L138 BoogieDeclarations]: Found implementation of procedure pt_probe [2025-03-08 19:01:47,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 19:01:47,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 19:01:47,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 19:01:47,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-08 19:01:47,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-08 19:01:47,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-08 19:01:47,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-08 19:01:47,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-08 19:01:47,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-08 19:01:47,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-08 19:01:47,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-08 19:01:47,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-08 19:01:47,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-08 19:01:47,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-03-08 19:01:47,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-03-08 19:01:47,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-03-08 19:01:47,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-03-08 19:01:47,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-03-08 19:01:47,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-03-08 19:01:47,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-03-08 19:01:47,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#20 [2025-03-08 19:01:47,666 INFO L130 BoogieDeclarations]: Found specification of procedure pt_rewind [2025-03-08 19:01:47,667 INFO L138 BoogieDeclarations]: Found implementation of procedure pt_rewind [2025-03-08 19:01:47,667 INFO L130 BoogieDeclarations]: Found specification of procedure device_create [2025-03-08 19:01:47,667 INFO L138 BoogieDeclarations]: Found implementation of procedure device_create [2025-03-08 19:01:47,667 INFO L130 BoogieDeclarations]: Found specification of procedure xn [2025-03-08 19:01:47,667 INFO L138 BoogieDeclarations]: Found implementation of procedure xn [2025-03-08 19:01:47,667 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_from_user [2025-03-08 19:01:47,667 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_from_user [2025-03-08 19:01:47,667 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 19:01:47,667 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 19:01:47,667 INFO L130 BoogieDeclarations]: Found specification of procedure xs [2025-03-08 19:01:47,667 INFO L138 BoogieDeclarations]: Found implementation of procedure xs [2025-03-08 19:01:48,084 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 19:01:48,086 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 19:01:48,160 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2927: havoc ~res~0#1.base, ~res~0#1.offset; [2025-03-08 19:01:48,256 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3370: call ULTIMATE.dealloc(~#expect~0.base, ~#expect~0.offset);havoc ~#expect~0.base, ~#expect~0.offset; [2025-03-08 19:01:53,865 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3554: call ULTIMATE.dealloc(~#ms~0#1.base, ~#ms~0#1.offset);havoc ~#ms~0#1.base, ~#ms~0#1.offset;call ULTIMATE.dealloc(~#mf~0#1.base, ~#mf~0#1.offset);havoc ~#mf~0#1.base, ~#mf~0#1.offset;call ULTIMATE.dealloc(~#id~0#1.base, ~#id~0#1.offset);havoc ~#id~0#1.base, ~#id~0#1.offset;call ULTIMATE.dealloc(~#id_cmd~0#1.base, ~#id_cmd~0#1.offset);havoc ~#id_cmd~0#1.base, ~#id_cmd~0#1.offset;call ULTIMATE.dealloc(~#ms_cmd~0#1.base, ~#ms_cmd~0#1.offset);havoc ~#ms_cmd~0#1.base, ~#ms_cmd~0#1.offset;call ULTIMATE.dealloc(~#ls_cmd~0#1.base, ~#ls_cmd~0#1.offset);havoc ~#ls_cmd~0#1.base, ~#ls_cmd~0#1.offset;call ULTIMATE.dealloc(~#buf~1#1.base, ~#buf~1#1.offset);havoc ~#buf~1#1.base, ~#buf~1#1.offset; [2025-03-08 19:01:53,866 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3447: call ULTIMATE.dealloc(pt_ready_wait_~#tr_cmd~0#1.base, pt_ready_wait_~#tr_cmd~0#1.offset);havoc pt_ready_wait_~#tr_cmd~0#1.base, pt_ready_wait_~#tr_cmd~0#1.offset; [2025-03-08 19:01:54,231 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4058: call ULTIMATE.dealloc(~#wr_cmd~0.base, ~#wr_cmd~0.offset);havoc ~#wr_cmd~0.base, ~#wr_cmd~0.offset; [2025-03-08 19:01:54,277 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3045: havoc #t~mem89; [2025-03-08 19:01:54,346 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5126: havoc #t~nondet374; [2025-03-08 19:01:54,349 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5133: havoc #t~nondet375; [2025-03-08 19:01:54,352 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5146: havoc #t~nondet376; [2025-03-08 19:01:54,708 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3328: call ULTIMATE.dealloc(~#rw_cmd~0.base, ~#rw_cmd~0.offset);havoc ~#rw_cmd~0.base, ~#rw_cmd~0.offset; [2025-03-08 19:01:54,731 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5090: havoc #t~nondet370; [2025-03-08 19:01:54,998 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3174: call ULTIMATE.dealloc(~#rs_cmd~0.base, ~#rs_cmd~0.offset);havoc ~#rs_cmd~0.base, ~#rs_cmd~0.offset;call ULTIMATE.dealloc(~#buf~0.base, ~#buf~0.offset);havoc ~#buf~0.base, ~#buf~0.offset; [2025-03-08 19:01:55,040 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5150: havoc schedule_timeout_interruptible_#t~nondet377#1; [2025-03-08 19:01:55,241 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3347: call ULTIMATE.dealloc(~#wm_cmd~0.base, ~#wm_cmd~0.offset);havoc ~#wm_cmd~0.base, ~#wm_cmd~0.offset; [2025-03-08 19:01:55,245 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2887: havoc #t~mem13; [2025-03-08 19:01:55,255 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5100: havoc #t~ret372.base, #t~ret372.offset; [2025-03-08 19:02:00,190 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4233: call ULTIMATE.dealloc(pt_init_~#__key~0#1.base, pt_init_~#__key~0#1.offset);havoc pt_init_~#__key~0#1.base, pt_init_~#__key~0#1.offset; [2025-03-08 19:02:00,191 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2814: havoc atomic_read_#t~mem9#1; [2025-03-08 19:02:00,191 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5094: havoc _copy_to_user_#t~nondet371#1; [2025-03-08 19:02:00,191 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5076: havoc __class_create_#t~ret368#1.base, __class_create_#t~ret368#1.offset; [2025-03-08 19:02:00,191 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3888: call ULTIMATE.dealloc(pt_read_~#rd_cmd~0#1.base, pt_read_~#rd_cmd~0#1.offset);havoc pt_read_~#rd_cmd~0#1.base, pt_read_~#rd_cmd~0#1.offset; [2025-03-08 19:02:00,191 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5083: havoc __register_chrdev_#t~nondet369#1; [2025-03-08 19:02:00,191 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2937: havoc __kmalloc_#t~ret32#1.base, __kmalloc_#t~ret32#1.offset; [2025-03-08 19:02:00,396 INFO L? ?]: Removed 705 outVars from TransFormulas that were not future-live. [2025-03-08 19:02:00,396 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 19:02:00,456 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 19:02:00,456 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 19:02:00,457 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 07:02:00 BoogieIcfgContainer [2025-03-08 19:02:00,457 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 19:02:00,459 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 19:02:00,459 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 19:02:00,462 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 19:02:00,462 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 07:01:46" (1/3) ... [2025-03-08 19:02:00,462 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bc976cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 07:02:00, skipping insertion in model container [2025-03-08 19:02:00,462 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:01:47" (2/3) ... [2025-03-08 19:02:00,463 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bc976cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 07:02:00, skipping insertion in model container [2025-03-08 19:02:00,463 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 07:02:00" (3/3) ... [2025-03-08 19:02:00,463 INFO L128 eAbstractionObserver]: Analyzing ICFG 32_7a_cilled_linux-3.8-rc1-drivers--block--paride--pt.ko-main.cil.out.i [2025-03-08 19:02:00,473 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 19:02:00,474 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 32_7a_cilled_linux-3.8-rc1-drivers--block--paride--pt.ko-main.cil.out.i that has 45 procedures, 871 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 19:02:00,534 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 19:02:00,544 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;@458e85f4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 19:02:00,546 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 19:02:00,553 INFO L276 IsEmpty]: Start isEmpty. Operand has 871 states, 634 states have (on average 1.3974763406940063) internal successors, (886), 659 states have internal predecessors, (886), 191 states have call successors, (191), 44 states have call predecessors, (191), 44 states have return successors, (191), 191 states have call predecessors, (191), 191 states have call successors, (191) [2025-03-08 19:02:00,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-08 19:02:00,559 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:02:00,559 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:02:00,560 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:02:00,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:02:00,564 INFO L85 PathProgramCache]: Analyzing trace with hash 698913639, now seen corresponding path program 1 times [2025-03-08 19:02:00,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:02:00,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994867642] [2025-03-08 19:02:00,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:02:00,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:02:01,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-08 19:02:01,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-08 19:02:01,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:02:01,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:02:01,529 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:02:01,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:02:01,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994867642] [2025-03-08 19:02:01,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994867642] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:02:01,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:02:01,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 19:02:01,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987140045] [2025-03-08 19:02:01,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:02:01,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 19:02:01,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:02:01,552 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 19:02:01,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:02:01,556 INFO L87 Difference]: Start difference. First operand has 871 states, 634 states have (on average 1.3974763406940063) internal successors, (886), 659 states have internal predecessors, (886), 191 states have call successors, (191), 44 states have call predecessors, (191), 44 states have return successors, (191), 191 states have call predecessors, (191), 191 states have call successors, (191) 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, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 19:02:02,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:02:02,073 INFO L93 Difference]: Finished difference Result 2127 states and 3152 transitions. [2025-03-08 19:02:02,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 19:02:02,075 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, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2025-03-08 19:02:02,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:02:02,099 INFO L225 Difference]: With dead ends: 2127 [2025-03-08 19:02:02,100 INFO L226 Difference]: Without dead ends: 1251 [2025-03-08 19:02:02,111 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:02:02,113 INFO L435 NwaCegarLoop]: 1505 mSDtfsCounter, 569 mSDsluCounter, 1149 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 569 SdHoareTripleChecker+Valid, 2654 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 19:02:02,115 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [569 Valid, 2654 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 19:02:02,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1251 states. [2025-03-08 19:02:02,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1251 to 1215. [2025-03-08 19:02:02,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1215 states, 881 states have (on average 1.368898978433598) internal successors, (1206), 902 states have internal predecessors, (1206), 266 states have call successors, (266), 68 states have call predecessors, (266), 67 states have return successors, (260), 260 states have call predecessors, (260), 260 states have call successors, (260) [2025-03-08 19:02:02,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1215 states to 1215 states and 1732 transitions. [2025-03-08 19:02:02,235 INFO L78 Accepts]: Start accepts. Automaton has 1215 states and 1732 transitions. Word has length 19 [2025-03-08 19:02:02,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:02:02,235 INFO L471 AbstractCegarLoop]: Abstraction has 1215 states and 1732 transitions. [2025-03-08 19:02:02,236 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, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 19:02:02,236 INFO L276 IsEmpty]: Start isEmpty. Operand 1215 states and 1732 transitions. [2025-03-08 19:02:02,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-08 19:02:02,237 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:02:02,237 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:02:02,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 19:02:02,238 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:02:02,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:02:02,238 INFO L85 PathProgramCache]: Analyzing trace with hash -863310227, now seen corresponding path program 1 times [2025-03-08 19:02:02,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:02:02,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007811210] [2025-03-08 19:02:02,238 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:02:02,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:02:02,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-08 19:02:02,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-08 19:02:02,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:02:02,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:02:02,829 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:02:02,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:02:02,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007811210] [2025-03-08 19:02:02,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007811210] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:02:02,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:02:02,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 19:02:02,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144619242] [2025-03-08 19:02:02,830 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,832 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 19:02:02,832 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:02:02,832 INFO L87 Difference]: Start difference. First operand 1215 states and 1732 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:02:02,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:02:02,946 INFO L93 Difference]: Finished difference Result 2427 states and 3461 transitions. [2025-03-08 19:02:02,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 19:02:02,947 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:02:02,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:02:02,955 INFO L225 Difference]: With dead ends: 2427 [2025-03-08 19:02:02,955 INFO L226 Difference]: Without dead ends: 1215 [2025-03-08 19:02:02,962 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:02:02,963 INFO L435 NwaCegarLoop]: 1182 mSDtfsCounter, 1213 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1213 SdHoareTripleChecker+Valid, 1182 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 19:02:02,963 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1213 Valid, 1182 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 19:02:02,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1215 states. [2025-03-08 19:02:03,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1215 to 1215. [2025-03-08 19:02:03,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1215 states, 881 states have (on average 1.3666288308740069) internal successors, (1204), 902 states have internal predecessors, (1204), 266 states have call successors, (266), 68 states have call predecessors, (266), 67 states have return successors, (260), 260 states have call predecessors, (260), 260 states have call successors, (260) [2025-03-08 19:02:03,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1215 states to 1215 states and 1730 transitions. [2025-03-08 19:02:03,020 INFO L78 Accepts]: Start accepts. Automaton has 1215 states and 1730 transitions. Word has length 19 [2025-03-08 19:02:03,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:02:03,021 INFO L471 AbstractCegarLoop]: Abstraction has 1215 states and 1730 transitions. [2025-03-08 19:02:03,021 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:02:03,021 INFO L276 IsEmpty]: Start isEmpty. Operand 1215 states and 1730 transitions. [2025-03-08 19:02:03,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-08 19:02:03,023 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:02:03,023 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:02:03,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 19:02:03,023 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:02:03,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:02:03,025 INFO L85 PathProgramCache]: Analyzing trace with hash 1756627551, now seen corresponding path program 1 times [2025-03-08 19:02:03,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:02:03,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511639336] [2025-03-08 19:02:03,025 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:02:03,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:02:03,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-08 19:02:03,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-08 19:02:03,381 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:02:03,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:02:03,545 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:02:03,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:02:03,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511639336] [2025-03-08 19:02:03,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511639336] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:02:03,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:02:03,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 19:02:03,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965364866] [2025-03-08 19:02:03,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:02:03,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 19:02:03,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:02:03,547 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 19:02:03,547 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:02:03,547 INFO L87 Difference]: Start difference. First operand 1215 states and 1730 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:02:07,581 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:07,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:02:07,817 INFO L93 Difference]: Finished difference Result 3118 states and 4449 transitions. [2025-03-08 19:02:07,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 19:02:07,818 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:02:07,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:02:07,830 INFO L225 Difference]: With dead ends: 3118 [2025-03-08 19:02:07,830 INFO L226 Difference]: Without dead ends: 1906 [2025-03-08 19:02:07,835 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:02:07,837 INFO L435 NwaCegarLoop]: 2072 mSDtfsCounter, 1159 mSDsluCounter, 976 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1159 SdHoareTripleChecker+Valid, 3048 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2025-03-08 19:02:07,837 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1159 Valid, 3048 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 122 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2025-03-08 19:02:07,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1906 states. [2025-03-08 19:02:07,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1906 to 1902. [2025-03-08 19:02:07,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1902 states, 1387 states have (on average 1.3705839942321558) internal successors, (1901), 1416 states have internal predecessors, (1901), 409 states have call successors, (409), 106 states have call predecessors, (409), 105 states have return successors, (403), 403 states have call predecessors, (403), 403 states have call successors, (403) [2025-03-08 19:02:07,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1902 states to 1902 states and 2713 transitions. [2025-03-08 19:02:07,915 INFO L78 Accepts]: Start accepts. Automaton has 1902 states and 2713 transitions. Word has length 25 [2025-03-08 19:02:07,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:02:07,915 INFO L471 AbstractCegarLoop]: Abstraction has 1902 states and 2713 transitions. [2025-03-08 19:02:07,916 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:02:07,916 INFO L276 IsEmpty]: Start isEmpty. Operand 1902 states and 2713 transitions. [2025-03-08 19:02:07,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-08 19:02:07,917 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:02:07,917 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] [2025-03-08 19:02:07,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 19:02:07,918 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:02:07,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:02:07,918 INFO L85 PathProgramCache]: Analyzing trace with hash 1401643240, now seen corresponding path program 1 times [2025-03-08 19:02:07,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:02:07,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709072096] [2025-03-08 19:02:07,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:02:07,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:02:08,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-08 19:02:08,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-08 19:02:08,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:02:08,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:02:08,451 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:02:08,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:02:08,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709072096] [2025-03-08 19:02:08,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709072096] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:02:08,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:02:08,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 19:02:08,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787816209] [2025-03-08 19:02:08,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:02:08,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 19:02:08,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:02:08,454 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 19:02:08,454 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:02:08,454 INFO L87 Difference]: Start difference. First operand 1902 states and 2713 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 2 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:02:08,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:02:08,655 INFO L93 Difference]: Finished difference Result 3829 states and 5467 transitions. [2025-03-08 19:02:08,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 19:02:08,655 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 2 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 29 [2025-03-08 19:02:08,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:02:08,665 INFO L225 Difference]: With dead ends: 3829 [2025-03-08 19:02:08,666 INFO L226 Difference]: Without dead ends: 1930 [2025-03-08 19:02:08,671 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:02:08,673 INFO L435 NwaCegarLoop]: 1177 mSDtfsCounter, 14 mSDsluCounter, 1173 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 2350 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 19:02:08,674 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 2350 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 19:02:08,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1930 states. [2025-03-08 19:02:08,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1930 to 1904. [2025-03-08 19:02:08,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1904 states, 1389 states have (on average 1.3700503959683226) internal successors, (1903), 1418 states have internal predecessors, (1903), 409 states have call successors, (409), 106 states have call predecessors, (409), 105 states have return successors, (403), 403 states have call predecessors, (403), 403 states have call successors, (403) [2025-03-08 19:02:08,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1904 states to 1904 states and 2715 transitions. [2025-03-08 19:02:08,741 INFO L78 Accepts]: Start accepts. Automaton has 1904 states and 2715 transitions. Word has length 29 [2025-03-08 19:02:08,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:02:08,742 INFO L471 AbstractCegarLoop]: Abstraction has 1904 states and 2715 transitions. [2025-03-08 19:02:08,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 2 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:02:08,742 INFO L276 IsEmpty]: Start isEmpty. Operand 1904 states and 2715 transitions. [2025-03-08 19:02:08,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-08 19:02:08,743 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:02:08,743 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] [2025-03-08 19:02:08,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 19:02:08,744 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:02:08,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:02:08,745 INFO L85 PathProgramCache]: Analyzing trace with hash -1835888191, now seen corresponding path program 1 times [2025-03-08 19:02:08,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:02:08,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693591680] [2025-03-08 19:02:08,745 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:02:08,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:02:09,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-08 19:02:09,151 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-08 19:02:09,152 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:02:09,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:02:09,254 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:09,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:02:09,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693591680] [2025-03-08 19:02:09,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693591680] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:02:09,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:02:09,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 19:02:09,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587965101] [2025-03-08 19:02:09,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:02:09,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 19:02:09,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:02:09,255 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 19:02:09,255 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:02:09,255 INFO L87 Difference]: Start difference. First operand 1904 states and 2715 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 2 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:02:09,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:02:09,395 INFO L93 Difference]: Finished difference Result 3819 states and 5449 transitions. [2025-03-08 19:02:09,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 19:02:09,395 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 2 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 35 [2025-03-08 19:02:09,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:02:09,406 INFO L225 Difference]: With dead ends: 3819 [2025-03-08 19:02:09,406 INFO L226 Difference]: Without dead ends: 1918 [2025-03-08 19:02:09,412 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:02:09,413 INFO L435 NwaCegarLoop]: 1181 mSDtfsCounter, 1 mSDsluCounter, 1178 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2359 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 19:02:09,413 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2359 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 19:02:09,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1918 states. [2025-03-08 19:02:09,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1918 to 1918. [2025-03-08 19:02:09,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1918 states, 1403 states have (on average 1.3706343549536708) internal successors, (1923), 1432 states have internal predecessors, (1923), 409 states have call successors, (409), 106 states have call predecessors, (409), 105 states have return successors, (403), 403 states have call predecessors, (403), 403 states have call successors, (403) [2025-03-08 19:02:09,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1918 states to 1918 states and 2735 transitions. [2025-03-08 19:02:09,474 INFO L78 Accepts]: Start accepts. Automaton has 1918 states and 2735 transitions. Word has length 35 [2025-03-08 19:02:09,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:02:09,475 INFO L471 AbstractCegarLoop]: Abstraction has 1918 states and 2735 transitions. [2025-03-08 19:02:09,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 2 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:02:09,475 INFO L276 IsEmpty]: Start isEmpty. Operand 1918 states and 2735 transitions. [2025-03-08 19:02:09,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-08 19:02:09,477 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:02:09,477 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 19:02:09,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 19:02:09,477 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:02:09,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:02:09,478 INFO L85 PathProgramCache]: Analyzing trace with hash -2065331325, now seen corresponding path program 1 times [2025-03-08 19:02:09,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:02:09,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555159348] [2025-03-08 19:02:09,478 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:02:09,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:02:09,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-08 19:02:09,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-08 19:02:09,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:02:09,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:02:10,001 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:02:10,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:02:10,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555159348] [2025-03-08 19:02:10,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555159348] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 19:02:10,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [766823129] [2025-03-08 19:02:10,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:02:10,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 19:02:10,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 19:02:10,005 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:02:10,006 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:10,609 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-08 19:02:10,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-08 19:02:10,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:02:10,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:02:10,872 INFO L256 TraceCheckSpWp]: Trace formula consists of 2780 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 19:02:10,877 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 19:02:10,910 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:10,910 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 19:02:10,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [766823129] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:02:10,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 19:02:10,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-08 19:02:10,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31763123] [2025-03-08 19:02:10,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:02:10,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 19:02:10,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:02:10,911 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 19:02:10,911 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 19:02:10,911 INFO L87 Difference]: Start difference. First operand 1918 states and 2735 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, (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:11,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:02:11,086 INFO L93 Difference]: Finished difference Result 3881 states and 5545 transitions. [2025-03-08 19:02:11,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 19:02:11,086 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, (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 41 [2025-03-08 19:02:11,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:02:11,099 INFO L225 Difference]: With dead ends: 3881 [2025-03-08 19:02:11,099 INFO L226 Difference]: Without dead ends: 1966 [2025-03-08 19:02:11,106 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 41 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:11,107 INFO L435 NwaCegarLoop]: 1182 mSDtfsCounter, 13 mSDsluCounter, 1175 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 2357 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 19:02:11,107 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 2357 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 19:02:11,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1966 states. [2025-03-08 19:02:11,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1966 to 1966. [2025-03-08 19:02:11,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1966 states, 1439 states have (on average 1.3724808895066019) internal successors, (1975), 1468 states have internal predecessors, (1975), 421 states have call successors, (421), 106 states have call predecessors, (421), 105 states have return successors, (415), 415 states have call predecessors, (415), 415 states have call successors, (415) [2025-03-08 19:02:11,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1966 states to 1966 states and 2811 transitions. [2025-03-08 19:02:11,174 INFO L78 Accepts]: Start accepts. Automaton has 1966 states and 2811 transitions. Word has length 41 [2025-03-08 19:02:11,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:02:11,176 INFO L471 AbstractCegarLoop]: Abstraction has 1966 states and 2811 transitions. [2025-03-08 19:02:11,176 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, (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:11,176 INFO L276 IsEmpty]: Start isEmpty. Operand 1966 states and 2811 transitions. [2025-03-08 19:02:11,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-08 19:02:11,177 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:02:11,177 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:11,192 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 19:02:11,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-08 19:02:11,380 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:02:11,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:02:11,380 INFO L85 PathProgramCache]: Analyzing trace with hash 1951573658, now seen corresponding path program 1 times [2025-03-08 19:02:11,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:02:11,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499062697] [2025-03-08 19:02:11,380 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:02:11,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:02:11,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-08 19:02:11,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-08 19:02:11,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:02:11,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:02:11,980 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:11,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:02:11,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499062697] [2025-03-08 19:02:11,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499062697] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 19:02:11,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1912460200] [2025-03-08 19:02:11,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:02:11,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 19:02:11,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 19:02:11,984 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:11,985 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:12,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-08 19:02:12,842 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-08 19:02:12,842 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:02:12,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:02:12,851 INFO L256 TraceCheckSpWp]: Trace formula consists of 2798 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 19:02:12,854 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 19:02:12,865 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:12,866 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 19:02:12,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1912460200] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:02:12,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 19:02:12,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-08 19:02:12,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465432111] [2025-03-08 19:02:12,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:02:12,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 19:02:12,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:02:12,867 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 19:02:12,867 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 19:02:12,867 INFO L87 Difference]: Start difference. First operand 1966 states and 2811 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:13,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:02:13,006 INFO L93 Difference]: Finished difference Result 1988 states and 2837 transitions. [2025-03-08 19:02:13,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 19:02:13,007 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:13,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:02:13,017 INFO L225 Difference]: With dead ends: 1988 [2025-03-08 19:02:13,017 INFO L226 Difference]: Without dead ends: 1977 [2025-03-08 19:02:13,019 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:13,019 INFO L435 NwaCegarLoop]: 1195 mSDtfsCounter, 1218 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1218 SdHoareTripleChecker+Valid, 1208 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 19:02:13,020 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1218 Valid, 1208 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 19:02:13,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1977 states. [2025-03-08 19:02:13,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1977 to 1966. [2025-03-08 19:02:13,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1966 states, 1439 states have (on average 1.3710910354412786) internal successors, (1973), 1468 states have internal predecessors, (1973), 421 states have call successors, (421), 106 states have call predecessors, (421), 105 states have return successors, (415), 415 states have call predecessors, (415), 415 states have call successors, (415) [2025-03-08 19:02:13,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1966 states to 1966 states and 2809 transitions. [2025-03-08 19:02:13,085 INFO L78 Accepts]: Start accepts. Automaton has 1966 states and 2809 transitions. Word has length 46 [2025-03-08 19:02:13,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:02:13,086 INFO L471 AbstractCegarLoop]: Abstraction has 1966 states and 2809 transitions. [2025-03-08 19:02:13,086 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:13,086 INFO L276 IsEmpty]: Start isEmpty. Operand 1966 states and 2809 transitions. [2025-03-08 19:02:13,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-08 19:02:13,087 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:02:13,087 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:13,099 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:13,288 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,SelfDestructingSolverStorable6 [2025-03-08 19:02:13,288 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:02:13,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:02:13,289 INFO L85 PathProgramCache]: Analyzing trace with hash 1980202809, now seen corresponding path program 1 times [2025-03-08 19:02:13,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:02:13,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886723314] [2025-03-08 19:02:13,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:02:13,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:02:13,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-08 19:02:13,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-08 19:02:13,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:02:13,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:02:13,799 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:13,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:02:13,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886723314] [2025-03-08 19:02:13,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886723314] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 19:02:13,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1156753813] [2025-03-08 19:02:13,800 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:02:13,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 19:02:13,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 19:02:13,803 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:13,804 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:14,486 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-08 19:02:14,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-08 19:02:14,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:02:14,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:02:14,722 INFO L256 TraceCheckSpWp]: Trace formula consists of 2795 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 19:02:14,725 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 19:02:14,793 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:14,793 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 19:02:14,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1156753813] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:02:14,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 19:02:14,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-08 19:02:14,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42775077] [2025-03-08 19:02:14,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:02:14,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 19:02:14,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:02:14,794 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 19:02:14,794 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 19:02:14,794 INFO L87 Difference]: Start difference. First operand 1966 states and 2809 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:18,824 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:18,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:02:18,960 INFO L93 Difference]: Finished difference Result 1968 states and 2810 transitions. [2025-03-08 19:02:18,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 19:02:18,960 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:18,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:02:18,970 INFO L225 Difference]: With dead ends: 1968 [2025-03-08 19:02:18,970 INFO L226 Difference]: Without dead ends: 1965 [2025-03-08 19:02:18,971 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:18,971 INFO L435 NwaCegarLoop]: 1180 mSDtfsCounter, 1180 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1180 SdHoareTripleChecker+Valid, 1180 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-03-08 19:02:18,971 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1180 Valid, 1180 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-03-08 19:02:18,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1965 states. [2025-03-08 19:02:19,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1965 to 1965. [2025-03-08 19:02:19,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1965 states, 1439 states have (on average 1.3703961084086171) internal successors, (1972), 1467 states have internal predecessors, (1972), 420 states have call successors, (420), 106 states have call predecessors, (420), 105 states have return successors, (415), 415 states have call predecessors, (415), 415 states have call successors, (415) [2025-03-08 19:02:19,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1965 states to 1965 states and 2807 transitions. [2025-03-08 19:02:19,031 INFO L78 Accepts]: Start accepts. Automaton has 1965 states and 2807 transitions. Word has length 46 [2025-03-08 19:02:19,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:02:19,031 INFO L471 AbstractCegarLoop]: Abstraction has 1965 states and 2807 transitions. [2025-03-08 19:02:19,031 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:19,032 INFO L276 IsEmpty]: Start isEmpty. Operand 1965 states and 2807 transitions. [2025-03-08 19:02:19,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-08 19:02:19,032 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:02:19,032 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:19,045 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:19,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 19:02:19,234 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:02:19,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:02:19,234 INFO L85 PathProgramCache]: Analyzing trace with hash 1255929652, now seen corresponding path program 1 times [2025-03-08 19:02:19,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:02:19,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369003359] [2025-03-08 19:02:19,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:02:19,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:02:19,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-08 19:02:19,545 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-08 19:02:19,545 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:02:19,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:02:19,719 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:19,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:02:19,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369003359] [2025-03-08 19:02:19,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369003359] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 19:02:19,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1117937353] [2025-03-08 19:02:19,720 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:02:19,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 19:02:19,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 19:02:19,722 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:19,723 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:20,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-08 19:02:20,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-08 19:02:20,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:02:20,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:02:20,547 INFO L256 TraceCheckSpWp]: Trace formula consists of 2797 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 19:02:20,550 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 19:02:20,622 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:20,622 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 19:02:20,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1117937353] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:02:20,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 19:02:20,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-08 19:02:20,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566177183] [2025-03-08 19:02:20,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:02:20,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 19:02:20,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:02:20,623 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 19:02:20,623 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 19:02:20,623 INFO L87 Difference]: Start difference. First operand 1965 states and 2807 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:24,653 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:24,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:02:24,765 INFO L93 Difference]: Finished difference Result 1967 states and 2808 transitions. [2025-03-08 19:02:24,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 19:02:24,765 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:24,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:02:24,774 INFO L225 Difference]: With dead ends: 1967 [2025-03-08 19:02:24,774 INFO L226 Difference]: Without dead ends: 1964 [2025-03-08 19:02:24,775 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:24,776 INFO L435 NwaCegarLoop]: 1178 mSDtfsCounter, 1177 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1177 SdHoareTripleChecker+Valid, 1178 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-03-08 19:02:24,777 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1177 Valid, 1178 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-03-08 19:02:24,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1964 states. [2025-03-08 19:02:24,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1964 to 1964. [2025-03-08 19:02:24,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1964 states, 1439 states have (on average 1.3697011813759554) internal successors, (1971), 1466 states have internal predecessors, (1971), 419 states have call successors, (419), 106 states have call predecessors, (419), 105 states have return successors, (415), 415 states have call predecessors, (415), 415 states have call successors, (415) [2025-03-08 19:02:24,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1964 states to 1964 states and 2805 transitions. [2025-03-08 19:02:24,839 INFO L78 Accepts]: Start accepts. Automaton has 1964 states and 2805 transitions. Word has length 47 [2025-03-08 19:02:24,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:02:24,839 INFO L471 AbstractCegarLoop]: Abstraction has 1964 states and 2805 transitions. [2025-03-08 19:02:24,839 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:24,839 INFO L276 IsEmpty]: Start isEmpty. Operand 1964 states and 2805 transitions. [2025-03-08 19:02:24,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-08 19:02:24,841 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:02:24,841 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:24,853 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:25,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 19:02:25,042 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:02:25,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:02:25,043 INFO L85 PathProgramCache]: Analyzing trace with hash 278297242, now seen corresponding path program 1 times [2025-03-08 19:02:25,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:02:25,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537617847] [2025-03-08 19:02:25,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:02:25,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:02:25,347 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-08 19:02:25,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-08 19:02:25,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:02:25,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:02:25,487 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:25,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:02:25,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537617847] [2025-03-08 19:02:25,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537617847] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 19:02:25,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [33297663] [2025-03-08 19:02:25,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:02:25,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 19:02:25,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 19:02:25,489 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:25,491 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:26,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-08 19:02:26,356 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-08 19:02:26,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:02:26,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:02:26,365 INFO L256 TraceCheckSpWp]: Trace formula consists of 2799 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 19:02:26,367 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 19:02:26,416 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:26,416 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 19:02:26,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [33297663] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:02:26,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 19:02:26,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-08 19:02:26,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279181329] [2025-03-08 19:02:26,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:02:26,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 19:02:26,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:02:26,417 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 19:02:26,417 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 19:02:26,417 INFO L87 Difference]: Start difference. First operand 1964 states and 2805 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:30,446 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:30,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:02:30,548 INFO L93 Difference]: Finished difference Result 1966 states and 2806 transitions. [2025-03-08 19:02:30,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 19:02:30,548 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:30,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:02:30,557 INFO L225 Difference]: With dead ends: 1966 [2025-03-08 19:02:30,557 INFO L226 Difference]: Without dead ends: 1963 [2025-03-08 19:02:30,557 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:30,558 INFO L435 NwaCegarLoop]: 1176 mSDtfsCounter, 1174 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1174 SdHoareTripleChecker+Valid, 1176 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-03-08 19:02:30,558 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1174 Valid, 1176 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-03-08 19:02:30,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1963 states. [2025-03-08 19:02:30,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1963 to 1963. [2025-03-08 19:02:30,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1963 states, 1439 states have (on average 1.369006254343294) internal successors, (1970), 1465 states have internal predecessors, (1970), 418 states have call successors, (418), 106 states have call predecessors, (418), 105 states have return successors, (415), 415 states have call predecessors, (415), 415 states have call successors, (415) [2025-03-08 19:02:30,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1963 states to 1963 states and 2803 transitions. [2025-03-08 19:02:30,618 INFO L78 Accepts]: Start accepts. Automaton has 1963 states and 2803 transitions. Word has length 48 [2025-03-08 19:02:30,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:02:30,618 INFO L471 AbstractCegarLoop]: Abstraction has 1963 states and 2803 transitions. [2025-03-08 19:02:30,618 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:30,618 INFO L276 IsEmpty]: Start isEmpty. Operand 1963 states and 2803 transitions. [2025-03-08 19:02:30,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-08 19:02:30,619 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:02:30,619 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 19:02:30,630 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-08 19:02:30,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-08 19:02:30,820 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:02:30,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:02:30,820 INFO L85 PathProgramCache]: Analyzing trace with hash 36462581, now seen corresponding path program 1 times [2025-03-08 19:02:30,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:02:30,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210288669] [2025-03-08 19:02:30,820 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:02:30,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:02:31,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-08 19:02:31,204 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-08 19:02:31,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:02:31,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:02:31,349 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:31,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:02:31,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210288669] [2025-03-08 19:02:31,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210288669] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 19:02:31,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [15932951] [2025-03-08 19:02:31,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:02:31,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 19:02:31,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 19:02:31,352 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:31,354 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:31,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-08 19:02:32,182 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-08 19:02:32,183 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:02:32,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:02:32,190 INFO L256 TraceCheckSpWp]: Trace formula consists of 2801 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 19:02:32,192 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 19:02:32,262 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:32,262 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 19:02:32,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [15932951] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:02:32,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 19:02:32,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-08 19:02:32,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965683178] [2025-03-08 19:02:32,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:02:32,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 19:02:32,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:02:32,263 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 19:02:32,263 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 19:02:32,263 INFO L87 Difference]: Start difference. First operand 1963 states and 2803 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (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:36,296 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:36,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:02:36,451 INFO L93 Difference]: Finished difference Result 2506 states and 3523 transitions. [2025-03-08 19:02:36,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 19:02:36,451 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (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 49 [2025-03-08 19:02:36,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:02:36,460 INFO L225 Difference]: With dead ends: 2506 [2025-03-08 19:02:36,461 INFO L226 Difference]: Without dead ends: 2461 [2025-03-08 19:02:36,461 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 49 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:36,462 INFO L435 NwaCegarLoop]: 1342 mSDtfsCounter, 1079 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1079 SdHoareTripleChecker+Valid, 1828 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-03-08 19:02:36,462 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1079 Valid, 1828 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 63 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-03-08 19:02:36,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2461 states. [2025-03-08 19:02:36,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2461 to 2461. [2025-03-08 19:02:36,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2461 states, 1772 states have (on average 1.350451467268623) internal successors, (2393), 1807 states have internal predecessors, (2393), 536 states have call successors, (536), 153 states have call predecessors, (536), 152 states have return successors, (535), 535 states have call predecessors, (535), 535 states have call successors, (535) [2025-03-08 19:02:36,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2461 states to 2461 states and 3464 transitions. [2025-03-08 19:02:36,546 INFO L78 Accepts]: Start accepts. Automaton has 2461 states and 3464 transitions. Word has length 49 [2025-03-08 19:02:36,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:02:36,547 INFO L471 AbstractCegarLoop]: Abstraction has 2461 states and 3464 transitions. [2025-03-08 19:02:36,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (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:36,547 INFO L276 IsEmpty]: Start isEmpty. Operand 2461 states and 3464 transitions. [2025-03-08 19:02:36,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-08 19:02:36,549 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:02:36,549 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, 1, 1] [2025-03-08 19:02:36,561 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:36,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 19:02:36,749 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:02:36,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:02:36,750 INFO L85 PathProgramCache]: Analyzing trace with hash 1055748062, now seen corresponding path program 1 times [2025-03-08 19:02:36,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:02:36,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608598786] [2025-03-08 19:02:36,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:02:36,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:02:37,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-08 19:02:37,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-08 19:02:37,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:02:37,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:02:37,217 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:37,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:02:37,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608598786] [2025-03-08 19:02:37,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608598786] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 19:02:37,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1917879106] [2025-03-08 19:02:37,217 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:02:37,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 19:02:37,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 19:02:37,219 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:37,221 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:37,892 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-08 19:02:38,119 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-08 19:02:38,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:02:38,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:02:38,128 INFO L256 TraceCheckSpWp]: Trace formula consists of 3024 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 19:02:38,130 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 19:02:38,143 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:38,143 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 19:02:38,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1917879106] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:02:38,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 19:02:38,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-08 19:02:38,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116149080] [2025-03-08 19:02:38,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:02:38,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 19:02:38,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:02:38,144 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 19:02:38,144 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 19:02:38,145 INFO L87 Difference]: Start difference. First operand 2461 states and 3464 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 19:02:38,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:02:38,320 INFO L93 Difference]: Finished difference Result 4939 states and 6956 transitions. [2025-03-08 19:02:38,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 19:02:38,321 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 81 [2025-03-08 19:02:38,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:02:38,331 INFO L225 Difference]: With dead ends: 4939 [2025-03-08 19:02:38,331 INFO L226 Difference]: Without dead ends: 2481 [2025-03-08 19:02:38,338 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 81 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:38,339 INFO L435 NwaCegarLoop]: 1122 mSDtfsCounter, 20 mSDsluCounter, 1110 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 2232 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 19:02:38,339 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 2232 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 19:02:38,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2481 states. [2025-03-08 19:02:38,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2481 to 2463. [2025-03-08 19:02:38,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2463 states, 1774 states have (on average 1.3500563697857948) internal successors, (2395), 1809 states have internal predecessors, (2395), 536 states have call successors, (536), 153 states have call predecessors, (536), 152 states have return successors, (535), 535 states have call predecessors, (535), 535 states have call successors, (535) [2025-03-08 19:02:38,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2463 states to 2463 states and 3466 transitions. [2025-03-08 19:02:38,422 INFO L78 Accepts]: Start accepts. Automaton has 2463 states and 3466 transitions. Word has length 81 [2025-03-08 19:02:38,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:02:38,422 INFO L471 AbstractCegarLoop]: Abstraction has 2463 states and 3466 transitions. [2025-03-08 19:02:38,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 19:02:38,423 INFO L276 IsEmpty]: Start isEmpty. Operand 2463 states and 3466 transitions. [2025-03-08 19:02:38,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-08 19:02:38,427 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:02:38,427 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, 1, 1, 1, 1, 1, 1] [2025-03-08 19:02:38,439 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-08 19:02:38,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 19:02:38,628 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:02:38,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:02:38,629 INFO L85 PathProgramCache]: Analyzing trace with hash -969660639, now seen corresponding path program 1 times [2025-03-08 19:02:38,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:02:38,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353582846] [2025-03-08 19:02:38,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:02:38,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:02:38,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-08 19:02:38,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-08 19:02:38,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:02:38,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:02:39,095 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:39,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:02:39,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353582846] [2025-03-08 19:02:39,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353582846] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 19:02:39,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [138203705] [2025-03-08 19:02:39,095 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:02:39,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 19:02:39,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 19:02:39,098 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:39,099 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:39,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-08 19:02:40,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-08 19:02:40,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:02:40,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:02:40,024 INFO L256 TraceCheckSpWp]: Trace formula consists of 3031 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 19:02:40,028 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 19:02:40,057 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 19:02:40,057 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 19:02:40,110 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:40,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [138203705] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 19:02:40,111 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 19:02:40,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-08 19:02:40,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877703857] [2025-03-08 19:02:40,111 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 19:02:40,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 19:02:40,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:02:40,112 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 19:02:40,112 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-08 19:02:40,112 INFO L87 Difference]: Start difference. First operand 2463 states and 3466 transitions. Second operand has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 7 states have internal predecessors, (92), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-08 19:02:40,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:02:40,428 INFO L93 Difference]: Finished difference Result 5095 states and 7197 transitions. [2025-03-08 19:02:40,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 19:02:40,429 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 7 states have internal predecessors, (92), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 85 [2025-03-08 19:02:40,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:02:40,444 INFO L225 Difference]: With dead ends: 5095 [2025-03-08 19:02:40,444 INFO L226 Difference]: Without dead ends: 2635 [2025-03-08 19:02:40,452 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-08 19:02:40,452 INFO L435 NwaCegarLoop]: 1124 mSDtfsCounter, 70 mSDsluCounter, 2252 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 3376 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 19:02:40,453 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 3376 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 19:02:40,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2635 states. [2025-03-08 19:02:40,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2635 to 2635. [2025-03-08 19:02:40,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2635 states, 1916 states have (on average 1.3491649269311066) internal successors, (2585), 1951 states have internal predecessors, (2585), 566 states have call successors, (566), 153 states have call predecessors, (566), 152 states have return successors, (565), 565 states have call predecessors, (565), 565 states have call successors, (565) [2025-03-08 19:02:40,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2635 states to 2635 states and 3716 transitions. [2025-03-08 19:02:40,540 INFO L78 Accepts]: Start accepts. Automaton has 2635 states and 3716 transitions. Word has length 85 [2025-03-08 19:02:40,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:02:40,540 INFO L471 AbstractCegarLoop]: Abstraction has 2635 states and 3716 transitions. [2025-03-08 19:02:40,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 7 states have internal predecessors, (92), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-08 19:02:40,540 INFO L276 IsEmpty]: Start isEmpty. Operand 2635 states and 3716 transitions. [2025-03-08 19:02:40,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-08 19:02:40,543 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:02:40,543 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 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:40,556 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-08 19:02:40,743 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,SelfDestructingSolverStorable12 [2025-03-08 19:02:40,744 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:02:40,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:02:40,744 INFO L85 PathProgramCache]: Analyzing trace with hash 1597184108, now seen corresponding path program 2 times [2025-03-08 19:02:40,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:02:40,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018510417] [2025-03-08 19:02:40,749 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 19:02:40,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:02:41,071 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 103 statements into 2 equivalence classes. [2025-03-08 19:02:41,088 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 32 of 103 statements. [2025-03-08 19:02:41,088 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 19:02:41,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:02:41,249 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2025-03-08 19:02:41,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:02:41,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018510417] [2025-03-08 19:02:41,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018510417] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:02:41,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:02:41,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 19:02:41,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335168513] [2025-03-08 19:02:41,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:02:41,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 19:02:41,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:02:41,251 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 19:02:41,251 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:02:41,251 INFO L87 Difference]: Start difference. First operand 2635 states and 3716 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 19:02:45,283 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:45,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:02:45,462 INFO L93 Difference]: Finished difference Result 2635 states and 3716 transitions. [2025-03-08 19:02:45,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 19:02:45,463 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 103 [2025-03-08 19:02:45,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:02:45,466 INFO L225 Difference]: With dead ends: 2635 [2025-03-08 19:02:45,466 INFO L226 Difference]: Without dead ends: 0 [2025-03-08 19:02:45,471 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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:02:45,472 INFO L435 NwaCegarLoop]: 1360 mSDtfsCounter, 492 mSDsluCounter, 1041 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 492 SdHoareTripleChecker+Valid, 2401 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-03-08 19:02:45,472 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [492 Valid, 2401 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 83 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-03-08 19:02:45,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-08 19:02:45,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-08 19:02:45,473 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:45,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-08 19:02:45,475 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 103 [2025-03-08 19:02:45,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:02:45,475 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-08 19:02:45,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 19:02:45,475 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-08 19:02:45,476 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-08 19:02:45,478 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 19:02:45,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 19:02:45,480 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 19:02:45,481 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-08 19:02:59,636 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 19:02:59,647 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 07:02:59 BoogieIcfgContainer [2025-03-08 19:02:59,647 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 19:02:59,648 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 19:02:59,648 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 19:02:59,648 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 19:02:59,648 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 07:02:00" (3/4) ... [2025-03-08 19:02:59,650 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-08 19:02:59,655 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure copy_from_user [2025-03-08 19:02:59,655 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure pi_release [2025-03-08 19:02:59,655 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure ldv_unregister_chrdev_17 [2025-03-08 19:02:59,655 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure pt_identify [2025-03-08 19:02:59,655 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure pi_init [2025-03-08 19:02:59,656 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure write_reg [2025-03-08 19:02:59,656 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure atomic_inc [2025-03-08 19:02:59,656 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure pi_read_regr [2025-03-08 19:02:59,656 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure might_fault [2025-03-08 19:02:59,656 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure printk [2025-03-08 19:02:59,656 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure pi_disconnect [2025-03-08 19:02:59,656 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure pt_command [2025-03-08 19:02:59,656 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure ldv_mutex_lock_pt_mutex [2025-03-08 19:02:59,656 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure status_reg [2025-03-08 19:02:59,656 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure __const_udelay [2025-03-08 19:02:59,656 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure DRIVE [2025-03-08 19:02:59,656 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure pt_wait [2025-03-08 19:02:59,656 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure mutex_unlock [2025-03-08 19:02:59,656 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure pt_write [2025-03-08 19:02:59,656 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure ldv_error [2025-03-08 19:02:59,656 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure pi_connect [2025-03-08 19:02:59,656 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure pt_completion [2025-03-08 19:02:59,656 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure device_destroy [2025-03-08 19:02:59,656 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure pi_read_block [2025-03-08 19:02:59,657 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure ldv__builtin_expect [2025-03-08 19:02:59,657 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure read_reg [2025-03-08 19:02:59,657 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure pt_sleep [2025-03-08 19:02:59,657 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure pt_probe [2025-03-08 19:02:59,657 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure pt_media_access_cmd [2025-03-08 19:02:59,657 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure pt_write_fm [2025-03-08 19:02:59,657 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure pt_rewind [2025-03-08 19:02:59,657 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2025-03-08 19:02:59,657 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure iminor [2025-03-08 19:02:59,657 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure pt_atapi [2025-03-08 19:02:59,657 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure pt_poll_dsc [2025-03-08 19:02:59,657 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure device_create [2025-03-08 19:02:59,657 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure ldv_mutex_unlock_pt_mutex [2025-03-08 19:02:59,657 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure xn [2025-03-08 19:02:59,657 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure mutex_lock [2025-03-08 19:02:59,657 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure _copy_from_user [2025-03-08 19:02:59,657 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure pt_req_sense [2025-03-08 19:02:59,658 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure xs [2025-03-08 19:02:59,658 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure pt_reset [2025-03-08 19:02:59,658 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure pi_write_block [2025-03-08 19:02:59,685 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 294 nodes and edges [2025-03-08 19:02:59,688 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 94 nodes and edges [2025-03-08 19:02:59,691 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 36 nodes and edges [2025-03-08 19:02:59,693 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2025-03-08 19:02:59,696 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-08 19:02:59,699 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-03-08 19:02:59,701 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-08 19:02:59,703 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-08 19:02:59,862 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-08 19:02:59,863 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-08 19:02:59,863 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 19:02:59,864 INFO L158 Benchmark]: Toolchain (without parser) took 73672.03ms. Allocated memory was 167.8MB in the beginning and 520.1MB in the end (delta: 352.3MB). Free memory was 117.3MB in the beginning and 382.9MB in the end (delta: -265.6MB). Peak memory consumption was 82.2MB. Max. memory is 16.1GB. [2025-03-08 19:02:59,864 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 119.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 19:02:59,864 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1053.64ms. Allocated memory is still 167.8MB. Free memory was 116.9MB in the beginning and 101.6MB in the end (delta: 15.2MB). Peak memory consumption was 105.1MB. Max. memory is 16.1GB. [2025-03-08 19:02:59,864 INFO L158 Benchmark]: Boogie Procedure Inliner took 125.90ms. Allocated memory is still 167.8MB. Free memory was 101.6MB in the beginning and 85.7MB in the end (delta: 15.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 19:02:59,864 INFO L158 Benchmark]: Boogie Preprocessor took 228.07ms. Allocated memory is still 167.8MB. Free memory was 85.7MB in the beginning and 56.0MB in the end (delta: 29.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-08 19:02:59,864 INFO L158 Benchmark]: IcfgBuilder took 12853.24ms. Allocated memory is still 167.8MB. Free memory was 56.0MB in the beginning and 95.6MB in the end (delta: -39.6MB). Peak memory consumption was 43.4MB. Max. memory is 16.1GB. [2025-03-08 19:02:59,865 INFO L158 Benchmark]: TraceAbstraction took 59188.36ms. Allocated memory was 167.8MB in the beginning and 520.1MB in the end (delta: 352.3MB). Free memory was 94.3MB in the beginning and 425.6MB in the end (delta: -331.3MB). Peak memory consumption was 321.3MB. Max. memory is 16.1GB. [2025-03-08 19:02:59,865 INFO L158 Benchmark]: Witness Printer took 215.35ms. Allocated memory is still 520.1MB. Free memory was 425.6MB in the beginning and 382.9MB in the end (delta: 42.7MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-03-08 19:02:59,867 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 119.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1053.64ms. Allocated memory is still 167.8MB. Free memory was 116.9MB in the beginning and 101.6MB in the end (delta: 15.2MB). Peak memory consumption was 105.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 125.90ms. Allocated memory is still 167.8MB. Free memory was 101.6MB in the beginning and 85.7MB in the end (delta: 15.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 228.07ms. Allocated memory is still 167.8MB. Free memory was 85.7MB in the beginning and 56.0MB in the end (delta: 29.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * IcfgBuilder took 12853.24ms. Allocated memory is still 167.8MB. Free memory was 56.0MB in the beginning and 95.6MB in the end (delta: -39.6MB). Peak memory consumption was 43.4MB. Max. memory is 16.1GB. * TraceAbstraction took 59188.36ms. Allocated memory was 167.8MB in the beginning and 520.1MB in the end (delta: 352.3MB). Free memory was 94.3MB in the beginning and 425.6MB in the end (delta: -331.3MB). Peak memory consumption was 321.3MB. Max. memory is 16.1GB. * Witness Printer took 215.35ms. Allocated memory is still 520.1MB. Free memory was 425.6MB in the beginning and 382.9MB in the end (delta: 42.7MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 2827]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ volatile (".pushsection .smp_locks,\"a\"\n.balign 4\n.long 671f - .\n.popsection\n671:\n\tlock; incl %0": "+m" (v->counter)); [2827] - GenericResultAtLocation [Line: 2834]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ volatile (".pushsection .smp_locks,\"a\"\n.balign 4\n.long 671f - .\n.popsection\n671:\n\tlock; decl %0; sete %1": "+m" (v->counter), "=qm" (c): : "memory"); [2834-2835] * 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: 4617]: 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 45 procedures, 871 locations, 1459 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 45.0s, OverallIterations: 14, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 27.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 6 mSolverCounterUnknown, 9402 SdHoareTripleChecker+Valid, 25.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9379 mSDsluCounter, 28529 SdHoareTripleChecker+Invalid, 25.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 10553 mSDsCounter, 25 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1128 IncrementalHoareTripleChecker+Invalid, 1159 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 25 mSolverCounterUnsat, 17976 mSDtfsCounter, 1128 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 569 GetRequests, 537 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2635occurred in iteration=13, InterpolantAutomatonStates: 45, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 14 MinimizatonAttempts, 95 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 2.4s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 1116 NumberOfCodeBlocks, 1045 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 1178 ConstructedInterpolants, 0 QuantifiedInterpolants, 1772 SizeOfPredicates, 0 NumberOfNonLiveVariables, 22825 ConjunctsInSsa, 23 ConjunctsInUnsatCore, 23 InterpolantComputations, 13 PerfectInterpolantSequences, 148/158 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: 3717]: Location Invariant Derived location invariant: ((((((((ldv_state_variable_0 == 1) && (1 == ldv_mutex_mutex_of_device)) && (disable == 0)) && (unit <= 3)) && (ldv_retval_pt_init == 0)) && (ldv_mutex_lock == 1)) && (ldv_mutex_pt_mutex == 1)) && (ldv_mutex_cred_guard_mutex_of_signal_struct == 1)) RESULT: Ultimate proved your program to be correct! [2025-03-08 19:02:59,908 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE