./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-consumption/32_7a_cilled_linux-3.8-rc1-drivers--block--paride--pg.ko-main.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-consumption/32_7a_cilled_linux-3.8-rc1-drivers--block--paride--pg.ko-main.cil.out.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 410663f06ff647e412b04b4e33dc5a0aa773139e9be33f59003b35b6e81927a8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 03:50:15,340 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 03:50:15,395 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-04 03:50:15,399 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 03:50:15,400 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 03:50:15,417 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 03:50:15,418 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 03:50:15,419 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 03:50:15,419 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 03:50:15,419 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 03:50:15,420 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 03:50:15,420 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 03:50:15,420 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 03:50:15,420 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 03:50:15,421 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 03:50:15,421 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 03:50:15,421 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 03:50:15,421 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 03:50:15,421 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 03:50:15,421 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 03:50:15,421 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 03:50:15,421 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 03:50:15,421 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 03:50:15,421 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 03:50:15,422 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 03:50:15,422 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 03:50:15,422 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 03:50:15,422 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 03:50:15,422 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 03:50:15,422 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 03:50:15,422 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 03:50:15,422 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 03:50:15,422 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 03:50:15,422 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 03:50:15,422 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 03:50:15,422 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 03:50:15,422 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 03:50:15,422 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 03:50:15,422 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 03:50:15,422 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 03:50:15,422 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 410663f06ff647e412b04b4e33dc5a0aa773139e9be33f59003b35b6e81927a8 [2025-03-04 03:50:15,705 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 03:50:15,711 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 03:50:15,714 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 03:50:15,715 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 03:50:15,715 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 03:50:15,716 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-consumption/32_7a_cilled_linux-3.8-rc1-drivers--block--paride--pg.ko-main.cil.out.i [2025-03-04 03:50:16,970 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e20dd9063/5f83c4ef9fc34ffba7f1b87aa388dd38/FLAG684044814 [2025-03-04 03:50:17,355 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 03:50:17,356 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-consumption/32_7a_cilled_linux-3.8-rc1-drivers--block--paride--pg.ko-main.cil.out.i [2025-03-04 03:50:17,387 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e20dd9063/5f83c4ef9fc34ffba7f1b87aa388dd38/FLAG684044814 [2025-03-04 03:50:17,403 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e20dd9063/5f83c4ef9fc34ffba7f1b87aa388dd38 [2025-03-04 03:50:17,405 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 03:50:17,406 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 03:50:17,408 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 03:50:17,409 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 03:50:17,412 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 03:50:17,413 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:50:17" (1/1) ... [2025-03-04 03:50:17,413 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2498cf46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:50:17, skipping insertion in model container [2025-03-04 03:50:17,413 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:50:17" (1/1) ... [2025-03-04 03:50:17,468 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 03:50:18,247 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-consumption/32_7a_cilled_linux-3.8-rc1-drivers--block--paride--pg.ko-main.cil.out.i[108133,108146] [2025-03-04 03:50:18,353 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 03:50:18,399 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 03:50:18,463 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile (".pushsection .smp_locks,\"a\"\n.balign 4\n.long 671f - .\n.popsection\n671:\n\tlock; btr %1,%0": "+m" (*((long volatile *)addr)): "Ir" (nr)); [2808] [2025-03-04 03:50:18,464 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile (".pushsection .smp_locks,\"a\"\n.balign 4\n.long 671f - .\n.popsection\n671:\n\tlock; bts %2,%1\n\tsbb %0,%0": "=r" (oldbit), "+m" (*((long volatile *)addr)): "Ir" (nr): "memory"); [2815-2816] [2025-03-04 03:50:18,537 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-consumption/32_7a_cilled_linux-3.8-rc1-drivers--block--paride--pg.ko-main.cil.out.i[108133,108146] [2025-03-04 03:50:18,549 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 03:50:18,635 INFO L204 MainTranslator]: Completed translation [2025-03-04 03:50:18,636 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:50:18 WrapperNode [2025-03-04 03:50:18,636 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 03:50:18,637 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 03:50:18,637 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 03:50:18,637 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 03:50:18,641 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:50:18" (1/1) ... [2025-03-04 03:50:18,676 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:50:18" (1/1) ... [2025-03-04 03:50:18,748 INFO L138 Inliner]: procedures = 133, calls = 1232, calls flagged for inlining = 49, calls inlined = 41, statements flattened = 1948 [2025-03-04 03:50:18,748 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 03:50:18,749 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 03:50:18,749 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 03:50:18,750 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 03:50:18,756 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:50:18" (1/1) ... [2025-03-04 03:50:18,756 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:50:18" (1/1) ... [2025-03-04 03:50:18,774 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:50:18" (1/1) ... [2025-03-04 03:50:18,848 INFO L175 MemorySlicer]: Split 952 memory accesses to 22 slices as follows [2, 3, 24, 5, 32, 1, 6, 5, 2, 6, 28, 512, 11, 1, 3, 1, 2, 273, 13, 14, 5, 3]. 54 percent of accesses are in the largest equivalence class. The 780 initializations are split as follows [2, 3, 0, 5, 24, 1, 4, 0, 0, 6, 0, 512, 11, 0, 0, 0, 0, 180, 13, 14, 5, 0]. The 103 writes are split as follows [0, 0, 24, 0, 0, 0, 0, 5, 2, 0, 28, 0, 0, 0, 1, 0, 1, 40, 0, 0, 0, 2]. [2025-03-04 03:50:18,849 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:50:18" (1/1) ... [2025-03-04 03:50:18,849 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:50:18" (1/1) ... [2025-03-04 03:50:18,905 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:50:18" (1/1) ... [2025-03-04 03:50:18,910 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:50:18" (1/1) ... [2025-03-04 03:50:18,927 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:50:18" (1/1) ... [2025-03-04 03:50:18,938 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:50:18" (1/1) ... [2025-03-04 03:50:18,959 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 03:50:18,961 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 03:50:18,961 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 03:50:18,961 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 03:50:18,962 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:50:18" (1/1) ... [2025-03-04 03:50:18,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 03:50:18,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 03:50:18,987 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-04 03:50:18,990 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-04 03:50:19,010 INFO L130 BoogieDeclarations]: Found specification of procedure pi_release [2025-03-04 03:50:19,010 INFO L138 BoogieDeclarations]: Found implementation of procedure pi_release [2025-03-04 03:50:19,010 INFO L130 BoogieDeclarations]: Found specification of procedure write_reg [2025-03-04 03:50:19,010 INFO L138 BoogieDeclarations]: Found implementation of procedure write_reg [2025-03-04 03:50:19,010 INFO L130 BoogieDeclarations]: Found specification of procedure pi_disconnect [2025-03-04 03:50:19,010 INFO L138 BoogieDeclarations]: Found implementation of procedure pi_disconnect [2025-03-04 03:50:19,010 INFO L130 BoogieDeclarations]: Found specification of procedure status_reg [2025-03-04 03:50:19,010 INFO L138 BoogieDeclarations]: Found implementation of procedure status_reg [2025-03-04 03:50:19,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-03-04 03:50:19,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-03-04 03:50:19,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-03-04 03:50:19,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-03-04 03:50:19,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-03-04 03:50:19,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-03-04 03:50:19,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2025-03-04 03:50:19,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2025-03-04 03:50:19,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#8 [2025-03-04 03:50:19,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#9 [2025-03-04 03:50:19,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#10 [2025-03-04 03:50:19,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#11 [2025-03-04 03:50:19,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#12 [2025-03-04 03:50:19,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#13 [2025-03-04 03:50:19,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#14 [2025-03-04 03:50:19,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#15 [2025-03-04 03:50:19,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#16 [2025-03-04 03:50:19,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#17 [2025-03-04 03:50:19,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#18 [2025-03-04 03:50:19,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#19 [2025-03-04 03:50:19,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#20 [2025-03-04 03:50:19,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#21 [2025-03-04 03:50:19,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-03-04 03:50:19,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-03-04 03:50:19,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-03-04 03:50:19,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-03-04 03:50:19,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-03-04 03:50:19,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2025-03-04 03:50:19,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2025-03-04 03:50:19,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#7 [2025-03-04 03:50:19,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#8 [2025-03-04 03:50:19,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#9 [2025-03-04 03:50:19,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#10 [2025-03-04 03:50:19,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#11 [2025-03-04 03:50:19,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#12 [2025-03-04 03:50:19,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#13 [2025-03-04 03:50:19,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#14 [2025-03-04 03:50:19,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#15 [2025-03-04 03:50:19,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#16 [2025-03-04 03:50:19,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#17 [2025-03-04 03:50:19,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#18 [2025-03-04 03:50:19,013 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#19 [2025-03-04 03:50:19,013 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#20 [2025-03-04 03:50:19,013 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#21 [2025-03-04 03:50:19,013 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 03:50:19,013 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 03:50:19,013 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 03:50:19,013 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-04 03:50:19,014 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-04 03:50:19,014 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-04 03:50:19,014 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-04 03:50:19,014 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-04 03:50:19,014 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-03-04 03:50:19,014 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-03-04 03:50:19,014 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-03-04 03:50:19,014 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-03-04 03:50:19,014 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-03-04 03:50:19,014 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-03-04 03:50:19,014 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-03-04 03:50:19,014 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2025-03-04 03:50:19,014 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2025-03-04 03:50:19,014 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#17 [2025-03-04 03:50:19,014 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#18 [2025-03-04 03:50:19,014 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#19 [2025-03-04 03:50:19,014 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#20 [2025-03-04 03:50:19,014 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#21 [2025-03-04 03:50:19,014 INFO L130 BoogieDeclarations]: Found specification of procedure read_reg [2025-03-04 03:50:19,014 INFO L138 BoogieDeclarations]: Found implementation of procedure read_reg [2025-03-04 03:50:19,014 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2025-03-04 03:50:19,014 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2025-03-04 03:50:19,014 INFO L130 BoogieDeclarations]: Found specification of procedure pg_sleep [2025-03-04 03:50:19,014 INFO L138 BoogieDeclarations]: Found implementation of procedure pg_sleep [2025-03-04 03:50:19,014 INFO L130 BoogieDeclarations]: Found specification of procedure pg_completion [2025-03-04 03:50:19,014 INFO L138 BoogieDeclarations]: Found implementation of procedure pg_completion [2025-03-04 03:50:19,014 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 03:50:19,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 03:50:19,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 03:50:19,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-04 03:50:19,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-04 03:50:19,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-04 03:50:19,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-04 03:50:19,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-04 03:50:19,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-03-04 03:50:19,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-03-04 03:50:19,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-03-04 03:50:19,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-03-04 03:50:19,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-03-04 03:50:19,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-03-04 03:50:19,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-03-04 03:50:19,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2025-03-04 03:50:19,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2025-03-04 03:50:19,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#17 [2025-03-04 03:50:19,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#18 [2025-03-04 03:50:19,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#19 [2025-03-04 03:50:19,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#20 [2025-03-04 03:50:19,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#21 [2025-03-04 03:50:19,015 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2025-03-04 03:50:19,015 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2025-03-04 03:50:19,015 INFO L130 BoogieDeclarations]: Found specification of procedure copy_to_user [2025-03-04 03:50:19,015 INFO L138 BoogieDeclarations]: Found implementation of procedure copy_to_user [2025-03-04 03:50:19,015 INFO L130 BoogieDeclarations]: Found specification of procedure pg_wait [2025-03-04 03:50:19,015 INFO L138 BoogieDeclarations]: Found implementation of procedure pg_wait [2025-03-04 03:50:19,015 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2025-03-04 03:50:19,015 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2025-03-04 03:50:19,015 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2025-03-04 03:50:19,015 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2025-03-04 03:50:19,015 INFO L130 BoogieDeclarations]: Found specification of procedure clear_bit [2025-03-04 03:50:19,015 INFO L138 BoogieDeclarations]: Found implementation of procedure clear_bit [2025-03-04 03:50:19,015 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 03:50:19,016 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock [2025-03-04 03:50:19,016 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock [2025-03-04 03:50:19,016 INFO L130 BoogieDeclarations]: Found specification of procedure copy_from_user [2025-03-04 03:50:19,016 INFO L138 BoogieDeclarations]: Found implementation of procedure copy_from_user [2025-03-04 03:50:19,016 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 03:50:19,016 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_unregister_chrdev_11 [2025-03-04 03:50:19,016 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_unregister_chrdev_11 [2025-03-04 03:50:19,016 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 03:50:19,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 03:50:19,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 03:50:19,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-04 03:50:19,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-04 03:50:19,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-03-04 03:50:19,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-03-04 03:50:19,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-03-04 03:50:19,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-03-04 03:50:19,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-03-04 03:50:19,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-03-04 03:50:19,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-03-04 03:50:19,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-03-04 03:50:19,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-03-04 03:50:19,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-03-04 03:50:19,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2025-03-04 03:50:19,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#15 [2025-03-04 03:50:19,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#16 [2025-03-04 03:50:19,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#17 [2025-03-04 03:50:19,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#18 [2025-03-04 03:50:19,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#19 [2025-03-04 03:50:19,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#20 [2025-03-04 03:50:19,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#21 [2025-03-04 03:50:19,021 INFO L130 BoogieDeclarations]: Found specification of procedure DRIVE [2025-03-04 03:50:19,021 INFO L138 BoogieDeclarations]: Found implementation of procedure DRIVE [2025-03-04 03:50:19,021 INFO L130 BoogieDeclarations]: Found specification of procedure pg_write [2025-03-04 03:50:19,021 INFO L138 BoogieDeclarations]: Found implementation of procedure pg_write [2025-03-04 03:50:19,021 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 03:50:19,021 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 03:50:19,021 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-04 03:50:19,021 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-04 03:50:19,021 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-03-04 03:50:19,021 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-03-04 03:50:19,021 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-03-04 03:50:19,021 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-03-04 03:50:19,021 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-03-04 03:50:19,021 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-03-04 03:50:19,021 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-03-04 03:50:19,021 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-03-04 03:50:19,021 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-03-04 03:50:19,021 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-03-04 03:50:19,021 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2025-03-04 03:50:19,021 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#15 [2025-03-04 03:50:19,021 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#16 [2025-03-04 03:50:19,021 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#17 [2025-03-04 03:50:19,021 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#18 [2025-03-04 03:50:19,021 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#19 [2025-03-04 03:50:19,021 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#20 [2025-03-04 03:50:19,021 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#21 [2025-03-04 03:50:19,021 INFO L130 BoogieDeclarations]: Found specification of procedure pg_reset [2025-03-04 03:50:19,021 INFO L138 BoogieDeclarations]: Found implementation of procedure pg_reset [2025-03-04 03:50:19,021 INFO L130 BoogieDeclarations]: Found specification of procedure pg_identify [2025-03-04 03:50:19,021 INFO L138 BoogieDeclarations]: Found implementation of procedure pg_identify [2025-03-04 03:50:19,021 INFO L130 BoogieDeclarations]: Found specification of procedure pi_write_block [2025-03-04 03:50:19,021 INFO L138 BoogieDeclarations]: Found implementation of procedure pi_write_block [2025-03-04 03:50:19,021 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 03:50:19,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-04 03:50:19,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-04 03:50:19,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-04 03:50:19,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-03-04 03:50:19,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-03-04 03:50:19,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-03-04 03:50:19,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-03-04 03:50:19,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2025-03-04 03:50:19,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2025-03-04 03:50:19,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2025-03-04 03:50:19,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2025-03-04 03:50:19,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2025-03-04 03:50:19,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2025-03-04 03:50:19,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2025-03-04 03:50:19,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#14 [2025-03-04 03:50:19,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#15 [2025-03-04 03:50:19,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#16 [2025-03-04 03:50:19,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#17 [2025-03-04 03:50:19,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#18 [2025-03-04 03:50:19,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#19 [2025-03-04 03:50:19,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#20 [2025-03-04 03:50:19,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#21 [2025-03-04 03:50:19,022 INFO L130 BoogieDeclarations]: Found specification of procedure pi_init [2025-03-04 03:50:19,022 INFO L138 BoogieDeclarations]: Found implementation of procedure pi_init [2025-03-04 03:50:19,022 INFO L130 BoogieDeclarations]: Found specification of procedure pi_read_regr [2025-03-04 03:50:19,022 INFO L138 BoogieDeclarations]: Found implementation of procedure pi_read_regr [2025-03-04 03:50:19,022 INFO L130 BoogieDeclarations]: Found specification of procedure might_fault [2025-03-04 03:50:19,022 INFO L138 BoogieDeclarations]: Found implementation of procedure might_fault [2025-03-04 03:50:19,022 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2025-03-04 03:50:19,022 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2025-03-04 03:50:19,022 INFO L130 BoogieDeclarations]: Found specification of procedure pg_probe [2025-03-04 03:50:19,022 INFO L138 BoogieDeclarations]: Found implementation of procedure pg_probe [2025-03-04 03:50:19,022 INFO L130 BoogieDeclarations]: Found specification of procedure pi_connect [2025-03-04 03:50:19,022 INFO L138 BoogieDeclarations]: Found implementation of procedure pi_connect [2025-03-04 03:50:19,022 INFO L130 BoogieDeclarations]: Found specification of procedure pg_command [2025-03-04 03:50:19,061 INFO L138 BoogieDeclarations]: Found implementation of procedure pg_command [2025-03-04 03:50:19,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 03:50:19,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 03:50:19,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 03:50:19,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-04 03:50:19,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-04 03:50:19,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-04 03:50:19,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-04 03:50:19,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-04 03:50:19,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-04 03:50:19,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-04 03:50:19,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-04 03:50:19,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-04 03:50:19,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-04 03:50:19,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-03-04 03:50:19,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-03-04 03:50:19,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-03-04 03:50:19,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-03-04 03:50:19,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-03-04 03:50:19,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-03-04 03:50:19,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-03-04 03:50:19,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#20 [2025-03-04 03:50:19,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#21 [2025-03-04 03:50:19,062 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_from_user [2025-03-04 03:50:19,062 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_from_user [2025-03-04 03:50:19,062 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 03:50:19,062 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 03:50:19,062 INFO L130 BoogieDeclarations]: Found specification of procedure xs [2025-03-04 03:50:19,062 INFO L138 BoogieDeclarations]: Found implementation of procedure xs [2025-03-04 03:50:19,394 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 03:50:19,397 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 03:50:19,476 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2923: havoc ~res~0#1.base, ~res~0#1.offset; [2025-03-04 03:50:19,508 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3073: havoc #t~mem103; [2025-03-04 03:50:19,597 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3248: call ULTIMATE.dealloc(~#expect~0.base, ~#expect~0.offset);havoc ~#expect~0.base, ~#expect~0.offset;call ULTIMATE.dealloc(~#got~0.base, ~#got~0.offset);havoc ~#got~0.base, ~#got~0.offset; [2025-03-04 03:50:19,850 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3367: call ULTIMATE.dealloc(~#ms~0.base, ~#ms~0.offset);havoc ~#ms~0.base, ~#ms~0.offset;call ULTIMATE.dealloc(~#mf~0.base, ~#mf~0.offset);havoc ~#mf~0.base, ~#mf~0.offset;call ULTIMATE.dealloc(~#id~0.base, ~#id~0.offset);havoc ~#id~0.base, ~#id~0.offset;call ULTIMATE.dealloc(~#id_cmd~0.base, ~#id_cmd~0.offset);havoc ~#id_cmd~0.base, ~#id_cmd~0.offset;call ULTIMATE.dealloc(~#buf~0.base, ~#buf~0.offset);havoc ~#buf~0.base, ~#buf~0.offset; [2025-03-04 03:50:19,863 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4557: havoc #t~nondet285; [2025-03-04 03:50:19,868 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4564: havoc #t~nondet286; [2025-03-04 03:50:19,875 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4577: havoc #t~nondet287; [2025-03-04 03:50:19,899 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4517: havoc #t~nondet280; [2025-03-04 03:50:19,923 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4581: havoc schedule_timeout_interruptible_#t~nondet288#1; [2025-03-04 03:50:19,988 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4521: havoc _copy_to_user_#t~nondet281#1; [2025-03-04 03:50:20,168 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3565: call ULTIMATE.dealloc(~#hdr~0.base, ~#hdr~0.offset);havoc ~#hdr~0.base, ~#hdr~0.offset; [2025-03-04 03:50:24,996 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3702: call ULTIMATE.dealloc(pg_init_~#__key~0#1.base, pg_init_~#__key~0#1.offset);havoc pg_init_~#__key~0#1.base, pg_init_~#__key~0#1.offset; [2025-03-04 03:50:24,997 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4547: havoc noop_llseek_#t~nondet284#1; [2025-03-04 03:50:24,997 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3639: call ULTIMATE.dealloc(pg_read_~#hdr~1#1.base, pg_read_~#hdr~1#1.offset);havoc pg_read_~#hdr~1#1.base, pg_read_~#hdr~1#1.offset; [2025-03-04 03:50:24,997 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2883: havoc iminor_#t~mem18#1; [2025-03-04 03:50:24,997 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2933: havoc __kmalloc_#t~ret37#1.base, __kmalloc_#t~ret37#1.offset; [2025-03-04 03:50:24,997 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4503: havoc __class_create_#t~ret278#1.base, __class_create_#t~ret278#1.offset; [2025-03-04 03:50:24,997 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4510: havoc __register_chrdev_#t~nondet279#1; [2025-03-04 03:50:24,997 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4527: havoc device_create_#t~ret282#1.base, device_create_#t~ret282#1.offset; [2025-03-04 03:50:25,161 INFO L? ?]: Removed 571 outVars from TransFormulas that were not future-live. [2025-03-04 03:50:25,161 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 03:50:25,228 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 03:50:25,228 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 03:50:25,228 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:50:25 BoogieIcfgContainer [2025-03-04 03:50:25,229 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 03:50:25,230 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 03:50:25,230 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 03:50:25,235 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 03:50:25,235 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 03:50:17" (1/3) ... [2025-03-04 03:50:25,236 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14d36d7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:50:25, skipping insertion in model container [2025-03-04 03:50:25,236 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:50:18" (2/3) ... [2025-03-04 03:50:25,236 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14d36d7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:50:25, skipping insertion in model container [2025-03-04 03:50:25,236 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:50:25" (3/3) ... [2025-03-04 03:50:25,236 INFO L128 eAbstractionObserver]: Analyzing ICFG 32_7a_cilled_linux-3.8-rc1-drivers--block--paride--pg.ko-main.cil.out.i [2025-03-04 03:50:25,247 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 03:50:25,251 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 32_7a_cilled_linux-3.8-rc1-drivers--block--paride--pg.ko-main.cil.out.i that has 32 procedures, 529 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-03-04 03:50:25,312 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 03:50:25,319 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;@49ba61f6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 03:50:25,319 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 03:50:25,323 INFO L276 IsEmpty]: Start isEmpty. Operand has 529 states, 394 states have (on average 1.368020304568528) internal successors, (539), 404 states have internal predecessors, (539), 102 states have call successors, (102), 31 states have call predecessors, (102), 31 states have return successors, (102), 102 states have call predecessors, (102), 102 states have call successors, (102) [2025-03-04 03:50:25,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-04 03:50:25,328 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:50:25,329 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 03:50:25,329 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:50:25,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:50:25,333 INFO L85 PathProgramCache]: Analyzing trace with hash -1502829815, now seen corresponding path program 1 times [2025-03-04 03:50:25,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:50:25,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240664362] [2025-03-04 03:50:25,338 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:50:25,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:50:25,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 03:50:25,991 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 03:50:25,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:50:25,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:50:26,325 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-04 03:50:26,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:50:26,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240664362] [2025-03-04 03:50:26,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240664362] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:50:26,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 03:50:26,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 03:50:26,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750299017] [2025-03-04 03:50:26,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:50:26,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 03:50:26,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:50:26,348 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 03:50:26,349 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 03:50:26,352 INFO L87 Difference]: Start difference. First operand has 529 states, 394 states have (on average 1.368020304568528) internal successors, (539), 404 states have internal predecessors, (539), 102 states have call successors, (102), 31 states have call predecessors, (102), 31 states have return successors, (102), 102 states have call predecessors, (102), 102 states have call successors, (102) Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 03:50:26,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:50:26,655 INFO L93 Difference]: Finished difference Result 1382 states and 1968 transitions. [2025-03-04 03:50:26,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 03:50:26,657 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-03-04 03:50:26,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:50:26,677 INFO L225 Difference]: With dead ends: 1382 [2025-03-04 03:50:26,678 INFO L226 Difference]: Without dead ends: 848 [2025-03-04 03:50:26,685 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-04 03:50:26,688 INFO L435 NwaCegarLoop]: 887 mSDtfsCounter, 462 mSDsluCounter, 683 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 462 SdHoareTripleChecker+Valid, 1570 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 03:50:26,689 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [462 Valid, 1570 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 03:50:26,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 848 states. [2025-03-04 03:50:26,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 848 to 820. [2025-03-04 03:50:26,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 820 states, 604 states have (on average 1.3526490066225165) internal successors, (817), 614 states have internal predecessors, (817), 165 states have call successors, (165), 51 states have call predecessors, (165), 50 states have return successors, (159), 159 states have call predecessors, (159), 159 states have call successors, (159) [2025-03-04 03:50:26,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 820 states to 820 states and 1141 transitions. [2025-03-04 03:50:26,796 INFO L78 Accepts]: Start accepts. Automaton has 820 states and 1141 transitions. Word has length 16 [2025-03-04 03:50:26,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:50:26,797 INFO L471 AbstractCegarLoop]: Abstraction has 820 states and 1141 transitions. [2025-03-04 03:50:26,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 03:50:26,797 INFO L276 IsEmpty]: Start isEmpty. Operand 820 states and 1141 transitions. [2025-03-04 03:50:26,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-04 03:50:26,799 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:50:26,799 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-04 03:50:26,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 03:50:26,799 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:50:26,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:50:26,800 INFO L85 PathProgramCache]: Analyzing trace with hash 1649139218, now seen corresponding path program 1 times [2025-03-04 03:50:26,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:50:26,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373960026] [2025-03-04 03:50:26,800 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:50:26,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:50:27,141 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 03:50:27,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 03:50:27,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:50:27,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:50:27,404 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-04 03:50:27,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:50:27,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373960026] [2025-03-04 03:50:27,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373960026] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:50:27,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 03:50:27,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 03:50:27,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519499673] [2025-03-04 03:50:27,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:50:27,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 03:50:27,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:50:27,407 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 03:50:27,407 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 03:50:27,407 INFO L87 Difference]: Start difference. First operand 820 states and 1141 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 03:50:27,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:50:27,514 INFO L93 Difference]: Finished difference Result 1637 states and 2279 transitions. [2025-03-04 03:50:27,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 03:50:27,515 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-04 03:50:27,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:50:27,522 INFO L225 Difference]: With dead ends: 1637 [2025-03-04 03:50:27,522 INFO L226 Difference]: Without dead ends: 820 [2025-03-04 03:50:27,526 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-04 03:50:27,528 INFO L435 NwaCegarLoop]: 716 mSDtfsCounter, 718 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 718 SdHoareTripleChecker+Valid, 716 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 03:50:27,528 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [718 Valid, 716 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 03:50:27,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 820 states. [2025-03-04 03:50:27,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 820 to 820. [2025-03-04 03:50:27,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 820 states, 604 states have (on average 1.349337748344371) internal successors, (815), 614 states have internal predecessors, (815), 165 states have call successors, (165), 51 states have call predecessors, (165), 50 states have return successors, (159), 159 states have call predecessors, (159), 159 states have call successors, (159) [2025-03-04 03:50:27,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 820 states to 820 states and 1139 transitions. [2025-03-04 03:50:27,585 INFO L78 Accepts]: Start accepts. Automaton has 820 states and 1139 transitions. Word has length 19 [2025-03-04 03:50:27,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:50:27,585 INFO L471 AbstractCegarLoop]: Abstraction has 820 states and 1139 transitions. [2025-03-04 03:50:27,585 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-04 03:50:27,585 INFO L276 IsEmpty]: Start isEmpty. Operand 820 states and 1139 transitions. [2025-03-04 03:50:27,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-04 03:50:27,589 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:50:27,589 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-04 03:50:27,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 03:50:27,590 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:50:27,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:50:27,591 INFO L85 PathProgramCache]: Analyzing trace with hash -768075619, now seen corresponding path program 1 times [2025-03-04 03:50:27,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:50:27,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294119713] [2025-03-04 03:50:27,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:50:27,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:50:27,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 03:50:27,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 03:50:27,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:50:27,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:50:28,217 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-04 03:50:28,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:50:28,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294119713] [2025-03-04 03:50:28,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294119713] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:50:28,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 03:50:28,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 03:50:28,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830585436] [2025-03-04 03:50:28,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:50:28,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 03:50:28,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:50:28,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 03:50:28,222 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 03:50:28,222 INFO L87 Difference]: Start difference. First operand 820 states and 1139 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 03:50:32,259 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-04 03:50:32,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:50:32,414 INFO L93 Difference]: Finished difference Result 2049 states and 2849 transitions. [2025-03-04 03:50:32,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 03:50:32,414 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-04 03:50:32,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:50:32,421 INFO L225 Difference]: With dead ends: 2049 [2025-03-04 03:50:32,422 INFO L226 Difference]: Without dead ends: 1232 [2025-03-04 03:50:32,442 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-04 03:50:32,443 INFO L435 NwaCegarLoop]: 1098 mSDtfsCounter, 675 mSDsluCounter, 573 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 675 SdHoareTripleChecker+Valid, 1671 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-03-04 03:50:32,444 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [675 Valid, 1671 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 41 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-03-04 03:50:32,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1232 states. [2025-03-04 03:50:32,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1232 to 1228. [2025-03-04 03:50:32,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1228 states, 909 states have (on average 1.353135313531353) internal successors, (1230), 921 states have internal predecessors, (1230), 240 states have call successors, (240), 79 states have call predecessors, (240), 78 states have return successors, (234), 234 states have call predecessors, (234), 234 states have call successors, (234) [2025-03-04 03:50:32,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1228 states to 1228 states and 1704 transitions. [2025-03-04 03:50:32,501 INFO L78 Accepts]: Start accepts. Automaton has 1228 states and 1704 transitions. Word has length 25 [2025-03-04 03:50:32,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:50:32,502 INFO L471 AbstractCegarLoop]: Abstraction has 1228 states and 1704 transitions. [2025-03-04 03:50:32,502 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-04 03:50:32,502 INFO L276 IsEmpty]: Start isEmpty. Operand 1228 states and 1704 transitions. [2025-03-04 03:50:32,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-04 03:50:32,502 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:50:32,503 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 03:50:32,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 03:50:32,503 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:50:32,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:50:32,503 INFO L85 PathProgramCache]: Analyzing trace with hash -1837227844, now seen corresponding path program 1 times [2025-03-04 03:50:32,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:50:32,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063506685] [2025-03-04 03:50:32,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:50:32,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:50:32,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 03:50:32,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 03:50:32,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:50:32,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:50:33,016 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-04 03:50:33,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:50:33,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063506685] [2025-03-04 03:50:33,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063506685] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:50:33,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 03:50:33,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 03:50:33,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738946482] [2025-03-04 03:50:33,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:50:33,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 03:50:33,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:50:33,019 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 03:50:33,019 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 03:50:33,020 INFO L87 Difference]: Start difference. First operand 1228 states and 1704 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 03:50:33,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:50:33,116 INFO L93 Difference]: Finished difference Result 2467 states and 3427 transitions. [2025-03-04 03:50:33,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 03:50:33,117 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2025-03-04 03:50:33,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:50:33,126 INFO L225 Difference]: With dead ends: 2467 [2025-03-04 03:50:33,126 INFO L226 Difference]: Without dead ends: 1242 [2025-03-04 03:50:33,130 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-04 03:50:33,132 INFO L435 NwaCegarLoop]: 714 mSDtfsCounter, 7 mSDsluCounter, 711 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 1425 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 03:50:33,133 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 1425 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 03:50:33,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1242 states. [2025-03-04 03:50:33,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1242 to 1230. [2025-03-04 03:50:33,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1230 states, 911 states have (on average 1.3523600439077936) internal successors, (1232), 923 states have internal predecessors, (1232), 240 states have call successors, (240), 79 states have call predecessors, (240), 78 states have return successors, (234), 234 states have call predecessors, (234), 234 states have call successors, (234) [2025-03-04 03:50:33,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1230 states to 1230 states and 1706 transitions. [2025-03-04 03:50:33,193 INFO L78 Accepts]: Start accepts. Automaton has 1230 states and 1706 transitions. Word has length 30 [2025-03-04 03:50:33,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:50:33,194 INFO L471 AbstractCegarLoop]: Abstraction has 1230 states and 1706 transitions. [2025-03-04 03:50:33,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 03:50:33,194 INFO L276 IsEmpty]: Start isEmpty. Operand 1230 states and 1706 transitions. [2025-03-04 03:50:33,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-04 03:50:33,196 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:50:33,196 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 03:50:33,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 03:50:33,196 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:50:33,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:50:33,197 INFO L85 PathProgramCache]: Analyzing trace with hash 96895766, now seen corresponding path program 1 times [2025-03-04 03:50:33,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:50:33,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521347029] [2025-03-04 03:50:33,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:50:33,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:50:33,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-04 03:50:33,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-04 03:50:33,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:50:33,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:50:33,817 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-04 03:50:33,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:50:33,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521347029] [2025-03-04 03:50:33,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521347029] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 03:50:33,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [102557601] [2025-03-04 03:50:33,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:50:33,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 03:50:33,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 03:50:33,821 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-04 03:50:33,822 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-04 03:50:34,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-04 03:50:34,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-04 03:50:34,734 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:50:34,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:50:34,746 INFO L256 TraceCheckSpWp]: Trace formula consists of 2581 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 03:50:34,751 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 03:50:34,767 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-04 03:50:34,767 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 03:50:34,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [102557601] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:50:34,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 03:50:34,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-04 03:50:34,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958531351] [2025-03-04 03:50:34,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:50:34,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 03:50:34,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:50:34,769 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 03:50:34,769 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 03:50:34,769 INFO L87 Difference]: Start difference. First operand 1230 states and 1706 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 03:50:34,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:50:34,862 INFO L93 Difference]: Finished difference Result 2483 states and 3451 transitions. [2025-03-04 03:50:34,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 03:50:34,863 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 40 [2025-03-04 03:50:34,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:50:34,870 INFO L225 Difference]: With dead ends: 2483 [2025-03-04 03:50:34,871 INFO L226 Difference]: Without dead ends: 1256 [2025-03-04 03:50:34,875 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 03:50:34,876 INFO L435 NwaCegarLoop]: 714 mSDtfsCounter, 19 mSDsluCounter, 699 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 1413 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 03:50:34,877 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 1413 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 03:50:34,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1256 states. [2025-03-04 03:50:34,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1256 to 1256. [2025-03-04 03:50:34,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1256 states, 931 states have (on average 1.3533834586466165) internal successors, (1260), 943 states have internal predecessors, (1260), 246 states have call successors, (246), 79 states have call predecessors, (246), 78 states have return successors, (240), 240 states have call predecessors, (240), 240 states have call successors, (240) [2025-03-04 03:50:34,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1256 states to 1256 states and 1746 transitions. [2025-03-04 03:50:34,924 INFO L78 Accepts]: Start accepts. Automaton has 1256 states and 1746 transitions. Word has length 40 [2025-03-04 03:50:34,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:50:34,925 INFO L471 AbstractCegarLoop]: Abstraction has 1256 states and 1746 transitions. [2025-03-04 03:50:34,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 03:50:34,925 INFO L276 IsEmpty]: Start isEmpty. Operand 1256 states and 1746 transitions. [2025-03-04 03:50:34,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-04 03:50:34,926 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:50:34,926 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 03:50:34,938 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-04 03:50:35,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 03:50:35,127 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:50:35,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:50:35,127 INFO L85 PathProgramCache]: Analyzing trace with hash 589931981, now seen corresponding path program 1 times [2025-03-04 03:50:35,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:50:35,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767336358] [2025-03-04 03:50:35,127 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:50:35,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:50:35,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-04 03:50:35,484 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-04 03:50:35,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:50:35,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:50:35,678 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-04 03:50:35,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:50:35,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767336358] [2025-03-04 03:50:35,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767336358] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 03:50:35,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [469252066] [2025-03-04 03:50:35,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:50:35,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 03:50:35,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 03:50:35,681 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-04 03:50:35,683 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-04 03:50:36,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-04 03:50:36,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-04 03:50:36,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:50:36,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:50:36,510 INFO L256 TraceCheckSpWp]: Trace formula consists of 2599 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 03:50:36,513 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 03:50:36,524 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-04 03:50:36,525 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 03:50:36,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [469252066] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:50:36,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 03:50:36,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-04 03:50:36,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404360222] [2025-03-04 03:50:36,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:50:36,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 03:50:36,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:50:36,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 03:50:36,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 03:50:36,526 INFO L87 Difference]: Start difference. First operand 1256 states and 1746 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 03:50:36,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:50:36,635 INFO L93 Difference]: Finished difference Result 1278 states and 1772 transitions. [2025-03-04 03:50:36,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 03:50:36,635 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 45 [2025-03-04 03:50:36,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:50:36,640 INFO L225 Difference]: With dead ends: 1278 [2025-03-04 03:50:36,641 INFO L226 Difference]: Without dead ends: 1267 [2025-03-04 03:50:36,641 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 03:50:36,641 INFO L435 NwaCegarLoop]: 729 mSDtfsCounter, 723 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 723 SdHoareTripleChecker+Valid, 742 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 03:50:36,642 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [723 Valid, 742 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 03:50:36,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1267 states. [2025-03-04 03:50:36,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1267 to 1256. [2025-03-04 03:50:36,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1256 states, 931 states have (on average 1.351235230934479) internal successors, (1258), 943 states have internal predecessors, (1258), 246 states have call successors, (246), 79 states have call predecessors, (246), 78 states have return successors, (240), 240 states have call predecessors, (240), 240 states have call successors, (240) [2025-03-04 03:50:36,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1256 states to 1256 states and 1744 transitions. [2025-03-04 03:50:36,678 INFO L78 Accepts]: Start accepts. Automaton has 1256 states and 1744 transitions. Word has length 45 [2025-03-04 03:50:36,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:50:36,678 INFO L471 AbstractCegarLoop]: Abstraction has 1256 states and 1744 transitions. [2025-03-04 03:50:36,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 03:50:36,679 INFO L276 IsEmpty]: Start isEmpty. Operand 1256 states and 1744 transitions. [2025-03-04 03:50:36,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-04 03:50:36,679 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:50:36,679 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 03:50:36,690 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 03:50:36,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-04 03:50:36,880 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:50:36,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:50:36,880 INFO L85 PathProgramCache]: Analyzing trace with hash 618561132, now seen corresponding path program 1 times [2025-03-04 03:50:36,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:50:36,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071481482] [2025-03-04 03:50:36,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:50:36,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:50:37,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-04 03:50:37,260 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-04 03:50:37,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:50:37,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:50:37,432 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-04 03:50:37,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:50:37,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071481482] [2025-03-04 03:50:37,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071481482] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 03:50:37,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1703037345] [2025-03-04 03:50:37,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:50:37,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 03:50:37,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 03:50:37,436 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-04 03:50:37,438 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-04 03:50:38,030 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-04 03:50:38,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-04 03:50:38,245 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:50:38,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:50:38,254 INFO L256 TraceCheckSpWp]: Trace formula consists of 2596 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 03:50:38,257 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 03:50:38,317 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-04 03:50:38,317 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 03:50:38,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1703037345] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:50:38,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 03:50:38,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-04 03:50:38,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571468821] [2025-03-04 03:50:38,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:50:38,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 03:50:38,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:50:38,318 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 03:50:38,318 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 03:50:38,318 INFO L87 Difference]: Start difference. First operand 1256 states and 1744 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 03:50:42,350 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-04 03:50:42,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:50:42,408 INFO L93 Difference]: Finished difference Result 1258 states and 1745 transitions. [2025-03-04 03:50:42,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 03:50:42,409 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 45 [2025-03-04 03:50:42,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:50:42,414 INFO L225 Difference]: With dead ends: 1258 [2025-03-04 03:50:42,414 INFO L226 Difference]: Without dead ends: 1255 [2025-03-04 03:50:42,415 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 03:50:42,416 INFO L435 NwaCegarLoop]: 714 mSDtfsCounter, 686 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 686 SdHoareTripleChecker+Valid, 714 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-03-04 03:50:42,416 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [686 Valid, 714 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-03-04 03:50:42,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1255 states. [2025-03-04 03:50:42,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1255 to 1255. [2025-03-04 03:50:42,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1255 states, 931 states have (on average 1.3501611170784102) internal successors, (1257), 942 states have internal predecessors, (1257), 245 states have call successors, (245), 79 states have call predecessors, (245), 78 states have return successors, (240), 240 states have call predecessors, (240), 240 states have call successors, (240) [2025-03-04 03:50:42,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1255 states to 1255 states and 1742 transitions. [2025-03-04 03:50:42,462 INFO L78 Accepts]: Start accepts. Automaton has 1255 states and 1742 transitions. Word has length 45 [2025-03-04 03:50:42,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:50:42,462 INFO L471 AbstractCegarLoop]: Abstraction has 1255 states and 1742 transitions. [2025-03-04 03:50:42,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 03:50:42,462 INFO L276 IsEmpty]: Start isEmpty. Operand 1255 states and 1742 transitions. [2025-03-04 03:50:42,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-04 03:50:42,463 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:50:42,464 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-04 03:50:42,476 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-04 03:50:42,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 03:50:42,664 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:50:42,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:50:42,665 INFO L85 PathProgramCache]: Analyzing trace with hash 1995021162, now seen corresponding path program 1 times [2025-03-04 03:50:42,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:50:42,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865249007] [2025-03-04 03:50:42,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:50:42,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:50:42,985 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-04 03:50:43,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-04 03:50:43,008 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:50:43,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:50:43,170 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-04 03:50:43,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:50:43,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865249007] [2025-03-04 03:50:43,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865249007] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 03:50:43,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1245076337] [2025-03-04 03:50:43,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:50:43,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 03:50:43,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 03:50:43,173 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-04 03:50:43,176 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-04 03:50:43,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-04 03:50:44,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-04 03:50:44,038 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:50:44,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:50:44,047 INFO L256 TraceCheckSpWp]: Trace formula consists of 2598 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 03:50:44,050 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 03:50:44,104 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-04 03:50:44,104 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 03:50:44,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1245076337] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:50:44,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 03:50:44,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-04 03:50:44,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652601559] [2025-03-04 03:50:44,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:50:44,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 03:50:44,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:50:44,105 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 03:50:44,105 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 03:50:44,106 INFO L87 Difference]: Start difference. First operand 1255 states and 1742 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 03:50:48,136 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-04 03:50:48,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:50:48,193 INFO L93 Difference]: Finished difference Result 1257 states and 1743 transitions. [2025-03-04 03:50:48,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 03:50:48,193 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-04 03:50:48,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:50:48,199 INFO L225 Difference]: With dead ends: 1257 [2025-03-04 03:50:48,199 INFO L226 Difference]: Without dead ends: 1254 [2025-03-04 03:50:48,200 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-04 03:50:48,200 INFO L435 NwaCegarLoop]: 712 mSDtfsCounter, 683 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 683 SdHoareTripleChecker+Valid, 712 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-03-04 03:50:48,200 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [683 Valid, 712 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-03-04 03:50:48,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1254 states. [2025-03-04 03:50:48,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1254 to 1254. [2025-03-04 03:50:48,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1254 states, 931 states have (on average 1.3490870032223417) internal successors, (1256), 941 states have internal predecessors, (1256), 244 states have call successors, (244), 79 states have call predecessors, (244), 78 states have return successors, (240), 240 states have call predecessors, (240), 240 states have call successors, (240) [2025-03-04 03:50:48,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1254 states to 1254 states and 1740 transitions. [2025-03-04 03:50:48,259 INFO L78 Accepts]: Start accepts. Automaton has 1254 states and 1740 transitions. Word has length 46 [2025-03-04 03:50:48,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:50:48,259 INFO L471 AbstractCegarLoop]: Abstraction has 1254 states and 1740 transitions. [2025-03-04 03:50:48,260 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-04 03:50:48,260 INFO L276 IsEmpty]: Start isEmpty. Operand 1254 states and 1740 transitions. [2025-03-04 03:50:48,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-04 03:50:48,261 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:50:48,261 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-04 03:50:48,272 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-04 03:50:48,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 03:50:48,462 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:50:48,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:50:48,462 INFO L85 PathProgramCache]: Analyzing trace with hash 1715608109, now seen corresponding path program 1 times [2025-03-04 03:50:48,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:50:48,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400070121] [2025-03-04 03:50:48,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:50:48,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:50:48,742 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-04 03:50:48,767 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-04 03:50:48,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:50:48,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:50:48,915 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-04 03:50:48,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:50:48,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400070121] [2025-03-04 03:50:48,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400070121] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 03:50:48,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [289367324] [2025-03-04 03:50:48,915 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:50:48,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 03:50:48,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 03:50:48,918 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-04 03:50:48,919 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-04 03:50:49,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-04 03:50:49,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-04 03:50:49,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:50:49,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:50:49,682 INFO L256 TraceCheckSpWp]: Trace formula consists of 2600 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 03:50:49,684 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 03:50:49,727 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-04 03:50:49,728 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 03:50:49,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [289367324] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:50:49,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 03:50:49,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-04 03:50:49,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522027175] [2025-03-04 03:50:49,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:50:49,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 03:50:49,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:50:49,729 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 03:50:49,729 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 03:50:49,729 INFO L87 Difference]: Start difference. First operand 1254 states and 1740 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 03:50:53,759 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-04 03:50:53,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:50:53,817 INFO L93 Difference]: Finished difference Result 1256 states and 1741 transitions. [2025-03-04 03:50:53,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 03:50:53,817 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-04 03:50:53,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:50:53,823 INFO L225 Difference]: With dead ends: 1256 [2025-03-04 03:50:53,823 INFO L226 Difference]: Without dead ends: 1253 [2025-03-04 03:50:53,824 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-04 03:50:53,826 INFO L435 NwaCegarLoop]: 710 mSDtfsCounter, 680 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 680 SdHoareTripleChecker+Valid, 710 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-03-04 03:50:53,826 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [680 Valid, 710 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-03-04 03:50:53,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1253 states. [2025-03-04 03:50:53,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1253 to 1253. [2025-03-04 03:50:53,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1253 states, 931 states have (on average 1.3480128893662728) internal successors, (1255), 940 states have internal predecessors, (1255), 243 states have call successors, (243), 79 states have call predecessors, (243), 78 states have return successors, (240), 240 states have call predecessors, (240), 240 states have call successors, (240) [2025-03-04 03:50:53,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1253 states to 1253 states and 1738 transitions. [2025-03-04 03:50:53,902 INFO L78 Accepts]: Start accepts. Automaton has 1253 states and 1738 transitions. Word has length 47 [2025-03-04 03:50:53,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:50:53,902 INFO L471 AbstractCegarLoop]: Abstraction has 1253 states and 1738 transitions. [2025-03-04 03:50:53,903 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-04 03:50:53,903 INFO L276 IsEmpty]: Start isEmpty. Operand 1253 states and 1738 transitions. [2025-03-04 03:50:53,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-04 03:50:53,904 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:50:53,904 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-04 03:50:53,915 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-04 03:50:54,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 03:50:54,105 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:50:54,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:50:54,106 INFO L85 PathProgramCache]: Analyzing trace with hash 1643737035, now seen corresponding path program 1 times [2025-03-04 03:50:54,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:50:54,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884351007] [2025-03-04 03:50:54,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:50:54,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:50:54,423 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-04 03:50:54,443 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-04 03:50:54,443 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:50:54,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:50:54,574 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-04 03:50:54,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:50:54,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884351007] [2025-03-04 03:50:54,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884351007] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 03:50:54,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [924393556] [2025-03-04 03:50:54,575 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:50:54,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 03:50:54,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 03:50:54,577 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-04 03:50:54,579 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-04 03:50:55,191 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-04 03:50:55,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-04 03:50:55,375 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:50:55,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:50:55,384 INFO L256 TraceCheckSpWp]: Trace formula consists of 2602 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 03:50:55,386 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 03:50:55,453 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-04 03:50:55,454 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 03:50:55,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [924393556] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:50:55,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 03:50:55,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-04 03:50:55,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597520443] [2025-03-04 03:50:55,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:50:55,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 03:50:55,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:50:55,454 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 03:50:55,454 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 03:50:55,454 INFO L87 Difference]: Start difference. First operand 1253 states and 1738 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 03:50:59,486 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-04 03:50:59,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:50:59,610 INFO L93 Difference]: Finished difference Result 1677 states and 2306 transitions. [2025-03-04 03:50:59,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 03:50:59,611 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-04 03:50:59,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:50:59,620 INFO L225 Difference]: With dead ends: 1677 [2025-03-04 03:50:59,620 INFO L226 Difference]: Without dead ends: 1640 [2025-03-04 03:50:59,621 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-04 03:50:59,622 INFO L435 NwaCegarLoop]: 775 mSDtfsCounter, 635 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 635 SdHoareTripleChecker+Valid, 1108 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-03-04 03:50:59,622 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [635 Valid, 1108 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-03-04 03:50:59,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1640 states. [2025-03-04 03:50:59,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1640 to 1640. [2025-03-04 03:50:59,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1640 states, 1196 states have (on average 1.330267558528428) internal successors, (1591), 1207 states have internal predecessors, (1591), 334 states have call successors, (334), 110 states have call predecessors, (334), 109 states have return successors, (333), 333 states have call predecessors, (333), 333 states have call successors, (333) [2025-03-04 03:50:59,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1640 states to 1640 states and 2258 transitions. [2025-03-04 03:50:59,692 INFO L78 Accepts]: Start accepts. Automaton has 1640 states and 2258 transitions. Word has length 48 [2025-03-04 03:50:59,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:50:59,692 INFO L471 AbstractCegarLoop]: Abstraction has 1640 states and 2258 transitions. [2025-03-04 03:50:59,692 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-04 03:50:59,692 INFO L276 IsEmpty]: Start isEmpty. Operand 1640 states and 2258 transitions. [2025-03-04 03:50:59,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-04 03:50:59,694 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:50:59,694 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 03:50:59,707 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-04 03:50:59,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 03:50:59,895 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:50:59,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:50:59,895 INFO L85 PathProgramCache]: Analyzing trace with hash 265659414, now seen corresponding path program 1 times [2025-03-04 03:50:59,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:50:59,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836185952] [2025-03-04 03:50:59,895 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:50:59,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:51:00,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-04 03:51:00,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-04 03:51:00,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:51:00,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:51:00,374 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-04 03:51:00,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:51:00,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836185952] [2025-03-04 03:51:00,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836185952] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 03:51:00,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1720833642] [2025-03-04 03:51:00,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:51:00,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 03:51:00,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 03:51:00,377 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-04 03:51:00,378 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-04 03:51:01,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-04 03:51:01,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-04 03:51:01,255 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:51:01,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:51:01,268 INFO L256 TraceCheckSpWp]: Trace formula consists of 2821 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 03:51:01,271 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 03:51:01,286 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-04 03:51:01,286 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 03:51:01,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1720833642] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:51:01,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 03:51:01,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-04 03:51:01,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200302505] [2025-03-04 03:51:01,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:51:01,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 03:51:01,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:51:01,289 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 03:51:01,289 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 03:51:01,289 INFO L87 Difference]: Start difference. First operand 1640 states and 2258 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 03:51:01,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:51:01,393 INFO L93 Difference]: Finished difference Result 3294 states and 4538 transitions. [2025-03-04 03:51:01,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 03:51:01,393 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 75 [2025-03-04 03:51:01,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:51:01,401 INFO L225 Difference]: With dead ends: 3294 [2025-03-04 03:51:01,402 INFO L226 Difference]: Without dead ends: 1657 [2025-03-04 03:51:01,407 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 03:51:01,407 INFO L435 NwaCegarLoop]: 667 mSDtfsCounter, 17 mSDsluCounter, 658 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 1325 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 03:51:01,408 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 1325 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 03:51:01,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1657 states. [2025-03-04 03:51:01,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1657 to 1642. [2025-03-04 03:51:01,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1642 states, 1198 states have (on average 1.3297161936560935) internal successors, (1593), 1209 states have internal predecessors, (1593), 334 states have call successors, (334), 110 states have call predecessors, (334), 109 states have return successors, (333), 333 states have call predecessors, (333), 333 states have call successors, (333) [2025-03-04 03:51:01,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1642 states to 1642 states and 2260 transitions. [2025-03-04 03:51:01,465 INFO L78 Accepts]: Start accepts. Automaton has 1642 states and 2260 transitions. Word has length 75 [2025-03-04 03:51:01,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:51:01,465 INFO L471 AbstractCegarLoop]: Abstraction has 1642 states and 2260 transitions. [2025-03-04 03:51:01,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 03:51:01,466 INFO L276 IsEmpty]: Start isEmpty. Operand 1642 states and 2260 transitions. [2025-03-04 03:51:01,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-04 03:51:01,467 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:51:01,467 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 03:51:01,482 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-04 03:51:01,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 03:51:01,668 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:51:01,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:51:01,668 INFO L85 PathProgramCache]: Analyzing trace with hash 121724659, now seen corresponding path program 1 times [2025-03-04 03:51:01,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:51:01,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662137787] [2025-03-04 03:51:01,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:51:01,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:51:01,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-04 03:51:02,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-04 03:51:02,000 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:51:02,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:51:02,149 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-04 03:51:02,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:51:02,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662137787] [2025-03-04 03:51:02,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662137787] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 03:51:02,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [735217808] [2025-03-04 03:51:02,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:51:02,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 03:51:02,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 03:51:02,152 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-04 03:51:02,154 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-04 03:51:02,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-04 03:51:03,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-04 03:51:03,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:51:03,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:51:03,073 INFO L256 TraceCheckSpWp]: Trace formula consists of 2832 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 03:51:03,076 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 03:51:03,095 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-04 03:51:03,095 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 03:51:03,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [735217808] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:51:03,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 03:51:03,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-04 03:51:03,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300228080] [2025-03-04 03:51:03,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:51:03,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 03:51:03,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:51:03,096 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 03:51:03,096 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 03:51:03,096 INFO L87 Difference]: Start difference. First operand 1642 states and 2260 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 03:51:07,127 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-04 03:51:07,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:51:07,213 INFO L93 Difference]: Finished difference Result 1642 states and 2260 transitions. [2025-03-04 03:51:07,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 03:51:07,213 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 79 [2025-03-04 03:51:07,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:51:07,215 INFO L225 Difference]: With dead ends: 1642 [2025-03-04 03:51:07,215 INFO L226 Difference]: Without dead ends: 0 [2025-03-04 03:51:07,218 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 03:51:07,219 INFO L435 NwaCegarLoop]: 898 mSDtfsCounter, 330 mSDsluCounter, 631 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 330 SdHoareTripleChecker+Valid, 1529 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-03-04 03:51:07,219 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [330 Valid, 1529 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-03-04 03:51:07,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-04 03:51:07,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-04 03:51:07,220 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-04 03:51:07,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-04 03:51:07,221 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 79 [2025-03-04 03:51:07,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:51:07,221 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 03:51:07,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 03:51:07,222 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-04 03:51:07,222 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-04 03:51:07,224 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-04 03:51:07,236 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-04 03:51:07,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-04 03:51:07,428 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 03:51:07,430 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-04 03:51:16,526 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 03:51:16,537 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 03:51:16 BoogieIcfgContainer [2025-03-04 03:51:16,538 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 03:51:16,538 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 03:51:16,538 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 03:51:16,538 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 03:51:16,539 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:50:25" (3/4) ... [2025-03-04 03:51:16,540 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-04 03:51:16,545 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure copy_from_user [2025-03-04 03:51:16,545 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure pi_release [2025-03-04 03:51:16,545 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure pi_init [2025-03-04 03:51:16,545 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure write_reg [2025-03-04 03:51:16,545 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure pg_sleep [2025-03-04 03:51:16,545 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure pi_read_regr [2025-03-04 03:51:16,545 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure might_fault [2025-03-04 03:51:16,545 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure printk [2025-03-04 03:51:16,545 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure pi_disconnect [2025-03-04 03:51:16,546 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure pg_probe [2025-03-04 03:51:16,546 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure status_reg [2025-03-04 03:51:16,546 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure pg_completion [2025-03-04 03:51:16,546 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure ldv_unregister_chrdev_11 [2025-03-04 03:51:16,546 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure DRIVE [2025-03-04 03:51:16,546 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure mutex_unlock [2025-03-04 03:51:16,546 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure copy_to_user [2025-03-04 03:51:16,546 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure pg_wait [2025-03-04 03:51:16,546 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure ldv_error [2025-03-04 03:51:16,546 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure pg_write [2025-03-04 03:51:16,546 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure pi_connect [2025-03-04 03:51:16,546 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure pg_command [2025-03-04 03:51:16,546 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure ldv__builtin_expect [2025-03-04 03:51:16,546 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure clear_bit [2025-03-04 03:51:16,546 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure read_reg [2025-03-04 03:51:16,546 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure pg_reset [2025-03-04 03:51:16,546 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2025-03-04 03:51:16,546 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure mutex_lock [2025-03-04 03:51:16,546 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure _copy_from_user [2025-03-04 03:51:16,547 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure xs [2025-03-04 03:51:16,547 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure pg_identify [2025-03-04 03:51:16,547 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure pi_write_block [2025-03-04 03:51:16,571 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 208 nodes and edges [2025-03-04 03:51:16,574 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 94 nodes and edges [2025-03-04 03:51:16,576 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 33 nodes and edges [2025-03-04 03:51:16,577 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2025-03-04 03:51:16,579 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-04 03:51:16,581 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-03-04 03:51:16,583 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-04 03:51:16,735 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 03:51:16,736 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 03:51:16,736 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 03:51:16,737 INFO L158 Benchmark]: Toolchain (without parser) took 59330.22ms. Allocated memory was 142.6MB in the beginning and 947.9MB in the end (delta: 805.3MB). Free memory was 107.9MB in the beginning and 755.6MB in the end (delta: -647.7MB). Peak memory consumption was 157.6MB. Max. memory is 16.1GB. [2025-03-04 03:51:16,737 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 128.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 03:51:16,737 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1228.22ms. Allocated memory is still 142.6MB. Free memory was 107.9MB in the beginning and 91.2MB in the end (delta: 16.7MB). Peak memory consumption was 92.2MB. Max. memory is 16.1GB. [2025-03-04 03:51:16,737 INFO L158 Benchmark]: Boogie Procedure Inliner took 111.41ms. Allocated memory is still 142.6MB. Free memory was 91.2MB in the beginning and 77.1MB in the end (delta: 14.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 03:51:16,738 INFO L158 Benchmark]: Boogie Preprocessor took 210.87ms. Allocated memory is still 142.6MB. Free memory was 77.1MB in the beginning and 53.5MB in the end (delta: 23.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-04 03:51:16,738 INFO L158 Benchmark]: IcfgBuilder took 6267.62ms. Allocated memory was 142.6MB in the beginning and 302.0MB in the end (delta: 159.4MB). Free memory was 53.5MB in the beginning and 241.2MB in the end (delta: -187.7MB). Peak memory consumption was 139.0MB. Max. memory is 16.1GB. [2025-03-04 03:51:16,738 INFO L158 Benchmark]: TraceAbstraction took 51307.49ms. Allocated memory was 302.0MB in the beginning and 947.9MB in the end (delta: 645.9MB). Free memory was 241.2MB in the beginning and 784.8MB in the end (delta: -543.6MB). Peak memory consumption was 572.5MB. Max. memory is 16.1GB. [2025-03-04 03:51:16,738 INFO L158 Benchmark]: Witness Printer took 197.80ms. Allocated memory is still 947.9MB. Free memory was 784.8MB in the beginning and 755.6MB in the end (delta: 29.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-04 03:51:16,741 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 128.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1228.22ms. Allocated memory is still 142.6MB. Free memory was 107.9MB in the beginning and 91.2MB in the end (delta: 16.7MB). Peak memory consumption was 92.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 111.41ms. Allocated memory is still 142.6MB. Free memory was 91.2MB in the beginning and 77.1MB in the end (delta: 14.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 210.87ms. Allocated memory is still 142.6MB. Free memory was 77.1MB in the beginning and 53.5MB in the end (delta: 23.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * IcfgBuilder took 6267.62ms. Allocated memory was 142.6MB in the beginning and 302.0MB in the end (delta: 159.4MB). Free memory was 53.5MB in the beginning and 241.2MB in the end (delta: -187.7MB). Peak memory consumption was 139.0MB. Max. memory is 16.1GB. * TraceAbstraction took 51307.49ms. Allocated memory was 302.0MB in the beginning and 947.9MB in the end (delta: 645.9MB). Free memory was 241.2MB in the beginning and 784.8MB in the end (delta: -543.6MB). Peak memory consumption was 572.5MB. Max. memory is 16.1GB. * Witness Printer took 197.80ms. Allocated memory is still 947.9MB. Free memory was 784.8MB in the beginning and 755.6MB in the end (delta: 29.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 2808]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ volatile (".pushsection .smp_locks,\"a\"\n.balign 4\n.long 671f - .\n.popsection\n671:\n\tlock; btr %1,%0": "+m" (*((long volatile *)addr)): "Ir" (nr)); [2808] - GenericResultAtLocation [Line: 2815]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ volatile (".pushsection .smp_locks,\"a\"\n.balign 4\n.long 671f - .\n.popsection\n671:\n\tlock; bts %2,%1\n\tsbb %0,%0": "=r" (oldbit), "+m" (*((long volatile *)addr)): "Ir" (nr): "memory"); [2815-2816] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 4044]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 32 procedures, 529 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 42.1s, OverallIterations: 12, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 25.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 6 mSolverCounterUnknown, 5644 SdHoareTripleChecker+Valid, 24.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5635 mSDsluCounter, 13635 SdHoareTripleChecker+Invalid, 24.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4301 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 310 IncrementalHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 9334 mSDtfsCounter, 310 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 460 GetRequests, 432 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1642occurred in iteration=11, InterpolantAutomatonStates: 36, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 12 MinimizatonAttempts, 70 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 2.3s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 940 NumberOfCodeBlocks, 940 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 920 ConstructedInterpolants, 0 QuantifiedInterpolants, 1456 SizeOfPredicates, 0 NumberOfNonLiveVariables, 21229 ConjunctsInSsa, 23 ConjunctsInUnsatCore, 20 InterpolantComputations, 12 PerfectInterpolantSequences, 84/92 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 3033]: Location Invariant Derived location invariant: (((((((ldv_state_variable_0 == 1) && (1 == ldv_mutex_mutex_of_device)) && (disable == 0)) && (ldv_retval_1 == 0)) && (ldv_mutex_lock == 1)) && (ldv_mutex_pg_mutex == 1)) && (ldv_mutex_cred_guard_mutex_of_signal_struct == 1)) RESULT: Ultimate proved your program to be correct! [2025-03-04 03:51:16,777 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE