./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-3.16-rc1/43_2a_consumption_linux-3.16-rc1.tar.xz-43_2a-kernel--locking--locktorture.ko-entry_point.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-3.16-rc1/43_2a_consumption_linux-3.16-rc1.tar.xz-43_2a-kernel--locking--locktorture.ko-entry_point.cil.out.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 8cac8187c908783c6da6279dd5046ee81ec4fe5bbaff4f4fff097111c44b0a84 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 06:31:05,062 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 06:31:05,098 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-02-06 06:31:05,102 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 06:31:05,102 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 06:31:05,117 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 06:31:05,117 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 06:31:05,118 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 06:31:05,118 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 06:31:05,118 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 06:31:05,118 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 06:31:05,118 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 06:31:05,118 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 06:31:05,119 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 06:31:05,119 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 06:31:05,119 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 06:31:05,119 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 06:31:05,119 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 06:31:05,119 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 06:31:05,119 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 06:31:05,119 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 06:31:05,119 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 06:31:05,119 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 06:31:05,119 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 06:31:05,119 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 06:31:05,120 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 06:31:05,120 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 06:31:05,120 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 06:31:05,120 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 06:31:05,120 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 06:31:05,120 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 06:31:05,120 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 06:31:05,120 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 06:31:05,120 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 06:31:05,120 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 06:31:05,120 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 06:31:05,121 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 06:31:05,121 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 06:31:05,121 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 06:31:05,121 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 06:31:05,121 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-jdk21/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 -> 8cac8187c908783c6da6279dd5046ee81ec4fe5bbaff4f4fff097111c44b0a84 [2025-02-06 06:31:05,335 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 06:31:05,342 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 06:31:05,343 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 06:31:05,344 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 06:31:05,344 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 06:31:05,345 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-3.16-rc1/43_2a_consumption_linux-3.16-rc1.tar.xz-43_2a-kernel--locking--locktorture.ko-entry_point.cil.out.i [2025-02-06 06:31:06,458 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/da34687b6/7fe604d2d5374812a62691b0cba88521/FLAG736810649 [2025-02-06 06:31:06,836 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 06:31:06,837 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.16-rc1/43_2a_consumption_linux-3.16-rc1.tar.xz-43_2a-kernel--locking--locktorture.ko-entry_point.cil.out.i [2025-02-06 06:31:06,861 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/da34687b6/7fe604d2d5374812a62691b0cba88521/FLAG736810649 [2025-02-06 06:31:07,046 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/da34687b6/7fe604d2d5374812a62691b0cba88521 [2025-02-06 06:31:07,048 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 06:31:07,050 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 06:31:07,051 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 06:31:07,051 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 06:31:07,054 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 06:31:07,055 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 06:31:07" (1/1) ... [2025-02-06 06:31:07,055 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40c3981a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:31:07, skipping insertion in model container [2025-02-06 06:31:07,055 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 06:31:07" (1/1) ... [2025-02-06 06:31:07,100 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 06:31:07,344 WARN L1383 CHandler]: Detected problem Invalid redeclaration of the name show at C: (*show)(struct kobject___0 * , struct attribute___0 * , char * ) [1764] [2025-02-06 06:31:07,345 WARN L1383 CHandler]: Detected problem Invalid redeclaration of the name store at C: (*store)(struct kobject___0 * , struct attribute___0 * , char const * , size_t ) [1765-1766] [2025-02-06 06:31:07,430 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.16-rc1/43_2a_consumption_linux-3.16-rc1.tar.xz-43_2a-kernel--locking--locktorture.ko-entry_point.cil.out.i[52456,52469] [2025-02-06 06:31:07,574 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 06:31:07,588 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 06:31:07,640 WARN L1383 CHandler]: Detected problem Invalid redeclaration of the name show at C: (*show)(struct kobject___0 * , struct attribute___0 * , char * ) [1764] [2025-02-06 06:31:07,640 WARN L1383 CHandler]: Detected problem Invalid redeclaration of the name store at C: (*store)(struct kobject___0 * , struct attribute___0 * , char const * , size_t ) [1765-1766] [2025-02-06 06:31:07,642 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movb %%gs:%P1,%0": "=q" (pfo_ret__): "p" (& current_task)); [1855] [2025-02-06 06:31:07,643 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movw %%gs:%P1,%0": "=r" (pfo_ret__): "p" (& current_task)); [1858] [2025-02-06 06:31:07,644 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movl %%gs:%P1,%0": "=r" (pfo_ret__): "p" (& current_task)); [1861] [2025-02-06 06:31:07,644 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movq %%gs:%P1,%0": "=r" (pfo_ret__): "p" (& current_task)); [1864] [2025-02-06 06:31:07,648 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile (".pushsection .smp_locks,\"a\"\n.balign 4\n.long 671f - .\n.popsection\n671:\n\tlock; incl %0": "+m" (v->counter)); [1902] [2025-02-06 06:31:07,656 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.16-rc1/43_2a_consumption_linux-3.16-rc1.tar.xz-43_2a-kernel--locking--locktorture.ko-entry_point.cil.out.i[52456,52469] [2025-02-06 06:31:07,724 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 06:31:07,747 INFO L204 MainTranslator]: Completed translation [2025-02-06 06:31:07,748 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:31:07 WrapperNode [2025-02-06 06:31:07,748 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 06:31:07,749 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 06:31:07,749 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 06:31:07,749 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 06:31:07,754 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:31:07" (1/1) ... [2025-02-06 06:31:07,778 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:31:07" (1/1) ... [2025-02-06 06:31:07,823 INFO L138 Inliner]: procedures = 114, calls = 293, calls flagged for inlining = 50, calls inlined = 38, statements flattened = 930 [2025-02-06 06:31:07,824 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 06:31:07,824 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 06:31:07,824 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 06:31:07,824 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 06:31:07,830 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:31:07" (1/1) ... [2025-02-06 06:31:07,831 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:31:07" (1/1) ... [2025-02-06 06:31:07,836 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:31:07" (1/1) ... [2025-02-06 06:31:07,862 INFO L175 MemorySlicer]: Split 79 memory accesses to 14 slices as follows [2, 12, 4, 1, 1, 1, 24, 4, 5, 1, 10, 2, 0, 12]. 30 percent of accesses are in the largest equivalence class. The 55 initializations are split as follows [2, 1, 4, 1, 1, 0, 18, 4, 0, 1, 10, 1, 0, 12]. The 9 writes are split as follows [0, 4, 0, 0, 0, 1, 1, 0, 3, 0, 0, 0, 0, 0]. [2025-02-06 06:31:07,862 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:31:07" (1/1) ... [2025-02-06 06:31:07,862 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:31:07" (1/1) ... [2025-02-06 06:31:07,879 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:31:07" (1/1) ... [2025-02-06 06:31:07,880 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:31:07" (1/1) ... [2025-02-06 06:31:07,884 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:31:07" (1/1) ... [2025-02-06 06:31:07,885 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:31:07" (1/1) ... [2025-02-06 06:31:07,891 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 06:31:07,891 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 06:31:07,891 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 06:31:07,892 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 06:31:07,892 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:31:07" (1/1) ... [2025-02-06 06:31:07,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 06:31:07,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 06:31:07,915 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 06:31:07,927 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 06:31:07,942 INFO L130 BoogieDeclarations]: Found specification of procedure _torture_stop_kthread [2025-02-06 06:31:07,942 INFO L138 BoogieDeclarations]: Found implementation of procedure _torture_stop_kthread [2025-02-06 06:31:07,942 INFO L130 BoogieDeclarations]: Found specification of procedure torture_lock_busted_write_lock [2025-02-06 06:31:07,942 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_lock_busted_write_lock [2025-02-06 06:31:07,942 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2025-02-06 06:31:07,942 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2025-02-06 06:31:07,942 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 06:31:07,943 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 06:31:07,943 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-06 06:31:07,943 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-06 06:31:07,943 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-02-06 06:31:07,943 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-02-06 06:31:07,943 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-02-06 06:31:07,943 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-02-06 06:31:07,944 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-02-06 06:31:07,944 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-02-06 06:31:07,944 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-02-06 06:31:07,944 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-02-06 06:31:07,944 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-02-06 06:31:07,944 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-02-06 06:31:07,944 INFO L130 BoogieDeclarations]: Found specification of procedure torture_spin_lock_write_delay [2025-02-06 06:31:07,944 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_spin_lock_write_delay [2025-02-06 06:31:07,945 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_lock [2025-02-06 06:31:07,945 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_lock [2025-02-06 06:31:07,945 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2025-02-06 06:31:07,945 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2025-02-06 06:31:07,945 INFO L130 BoogieDeclarations]: Found specification of procedure _torture_create_kthread [2025-02-06 06:31:07,945 INFO L138 BoogieDeclarations]: Found implementation of procedure _torture_create_kthread [2025-02-06 06:31:07,945 INFO L130 BoogieDeclarations]: Found specification of procedure torture_spin_lock_write_lock [2025-02-06 06:31:07,946 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_spin_lock_write_lock [2025-02-06 06:31:07,946 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_alloc_flags [2025-02-06 06:31:07,946 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_alloc_flags [2025-02-06 06:31:07,946 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2025-02-06 06:31:07,946 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2025-02-06 06:31:07,946 INFO L130 BoogieDeclarations]: Found specification of procedure torture_lock_spin_write_unlock_irq [2025-02-06 06:31:07,946 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_lock_spin_write_unlock_irq [2025-02-06 06:31:07,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 06:31:07,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 06:31:07,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-06 06:31:07,947 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-06 06:31:07,947 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-02-06 06:31:07,947 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-02-06 06:31:07,948 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-02-06 06:31:07,948 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-02-06 06:31:07,948 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-02-06 06:31:07,948 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-02-06 06:31:07,948 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-02-06 06:31:07,948 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-02-06 06:31:07,948 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-02-06 06:31:07,948 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-02-06 06:31:07,948 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2025-02-06 06:31:07,948 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2025-02-06 06:31:07,948 INFO L130 BoogieDeclarations]: Found specification of procedure torture_random [2025-02-06 06:31:07,948 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_random [2025-02-06 06:31:07,948 INFO L130 BoogieDeclarations]: Found specification of procedure lock_torture_cleanup [2025-02-06 06:31:07,948 INFO L138 BoogieDeclarations]: Found implementation of procedure lock_torture_cleanup [2025-02-06 06:31:07,948 INFO L130 BoogieDeclarations]: Found specification of procedure torture_init_end [2025-02-06 06:31:07,948 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_init_end [2025-02-06 06:31:07,948 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 06:31:07,948 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 06:31:07,948 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 06:31:07,948 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~~TO~VOID [2025-02-06 06:31:07,948 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~~TO~VOID [2025-02-06 06:31:07,948 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 06:31:07,949 INFO L130 BoogieDeclarations]: Found specification of procedure __const_udelay [2025-02-06 06:31:07,949 INFO L138 BoogieDeclarations]: Found implementation of procedure __const_udelay [2025-02-06 06:31:07,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-06 06:31:07,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-06 06:31:07,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-06 06:31:07,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-02-06 06:31:07,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-02-06 06:31:07,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-02-06 06:31:07,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-02-06 06:31:07,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-02-06 06:31:07,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-02-06 06:31:07,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-02-06 06:31:07,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-02-06 06:31:07,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-02-06 06:31:07,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-02-06 06:31:07,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-02-06 06:31:07,949 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 06:31:07,949 INFO L130 BoogieDeclarations]: Found specification of procedure lock_torture_stats_print [2025-02-06 06:31:07,949 INFO L138 BoogieDeclarations]: Found implementation of procedure lock_torture_stats_print [2025-02-06 06:31:07,949 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-06 06:31:07,949 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-06 06:31:07,949 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-06 06:31:07,949 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-02-06 06:31:07,949 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-02-06 06:31:07,949 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-02-06 06:31:07,949 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-02-06 06:31:07,949 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-02-06 06:31:07,949 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-02-06 06:31:07,949 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-02-06 06:31:07,949 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-02-06 06:31:07,949 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-02-06 06:31:07,949 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-02-06 06:31:07,949 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-02-06 06:31:07,949 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock [2025-02-06 06:31:07,949 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock [2025-02-06 06:31:07,949 INFO L130 BoogieDeclarations]: Found specification of procedure torture_spin_lock_write_lock_irq [2025-02-06 06:31:07,949 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_spin_lock_write_lock_irq [2025-02-06 06:31:07,949 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 06:31:07,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-02-06 06:31:07,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-02-06 06:31:07,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-02-06 06:31:07,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-02-06 06:31:07,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-02-06 06:31:07,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-02-06 06:31:07,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-02-06 06:31:07,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2025-02-06 06:31:07,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2025-02-06 06:31:07,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2025-02-06 06:31:07,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2025-02-06 06:31:07,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2025-02-06 06:31:07,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2025-02-06 06:31:07,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2025-02-06 06:31:07,950 INFO L130 BoogieDeclarations]: Found specification of procedure torture_lock_busted_write_delay [2025-02-06 06:31:07,950 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_lock_busted_write_delay [2025-02-06 06:31:07,950 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2025-02-06 06:31:07,950 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2025-02-06 06:31:07,950 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2025-02-06 06:31:07,950 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2025-02-06 06:31:07,950 INFO L130 BoogieDeclarations]: Found specification of procedure torture_lock_busted_write_unlock [2025-02-06 06:31:07,950 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_lock_busted_write_unlock [2025-02-06 06:31:07,950 INFO L130 BoogieDeclarations]: Found specification of procedure lock_torture_print_module_parms [2025-02-06 06:31:07,951 INFO L138 BoogieDeclarations]: Found implementation of procedure lock_torture_print_module_parms [2025-02-06 06:31:07,951 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 06:31:07,951 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 06:31:07,951 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 06:31:07,951 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-06 06:31:07,951 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-06 06:31:07,951 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-02-06 06:31:07,951 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-02-06 06:31:07,951 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-02-06 06:31:07,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-02-06 06:31:07,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-02-06 06:31:07,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-02-06 06:31:07,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-02-06 06:31:07,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-02-06 06:31:07,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-02-06 06:31:07,952 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2025-02-06 06:31:07,952 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2025-02-06 06:31:07,952 INFO L130 BoogieDeclarations]: Found specification of procedure torture_spin_lock_write_unlock [2025-02-06 06:31:07,952 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_spin_lock_write_unlock [2025-02-06 06:31:07,952 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 06:31:07,952 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 06:31:08,214 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 06:31:08,215 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 06:31:08,232 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2025-02-06 06:31:08,275 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2970: havoc #t~nondet158; [2025-02-06 06:31:08,309 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3057: havoc #t~nondet175; [2025-02-06 06:31:08,347 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3031: havoc torture_cleanup_#t~nondet170#1; [2025-02-06 06:31:08,347 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1896: havoc atomic_read_#t~mem13#1; [2025-02-06 06:31:08,347 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3049: havoc torture_onoff_failures_#t~nondet173#1; [2025-02-06 06:31:08,474 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3013: havoc #t~nondet167; [2025-02-06 06:31:08,484 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1937: havoc __kmalloc_#t~ret20#1.base, __kmalloc_#t~ret20#1.offset; [2025-02-06 06:31:08,802 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2994: havoc ldv_probe_3_#t~nondet162#1; [2025-02-06 06:31:08,802 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3061: havoc torture_shuffle_init_#t~nondet176#1; [2025-02-06 06:31:08,802 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2418: call ULTIMATE.dealloc(lock_torture_init_~#torture_ops~0#1.base, lock_torture_init_~#torture_ops~0#1.offset);havoc lock_torture_init_~#torture_ops~0#1.base, lock_torture_init_~#torture_ops~0#1.offset; [2025-02-06 06:31:08,802 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2998: havoc ldv_release_1_#t~nondet163#1; [2025-02-06 06:31:08,802 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2951: havoc __bitmap_weight_#t~nondet157#1; [2025-02-06 06:31:08,802 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3068: havoc torture_shutdown_init_#t~nondet177#1; [2025-02-06 06:31:08,802 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3002: havoc ldv_release_2_#t~nondet164#1; [2025-02-06 06:31:08,802 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3035: havoc torture_init_begin_#t~nondet171#1; [2025-02-06 06:31:08,803 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2986: havoc ldv_probe_1_#t~nondet160#1; [2025-02-06 06:31:08,803 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3053: havoc torture_onoff_init_#t~nondet174#1; [2025-02-06 06:31:08,803 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3072: havoc torture_stutter_init_#t~nondet178#1; [2025-02-06 06:31:08,803 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3006: havoc ldv_release_3_#t~nondet165#1; [2025-02-06 06:31:08,803 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2990: havoc ldv_probe_2_#t~nondet161#1; [2025-02-06 06:31:08,925 INFO L? ?]: Removed 301 outVars from TransFormulas that were not future-live. [2025-02-06 06:31:08,926 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 06:31:08,949 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 06:31:08,953 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 06:31:08,954 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 06:31:08 BoogieIcfgContainer [2025-02-06 06:31:08,954 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 06:31:08,956 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 06:31:08,956 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 06:31:08,959 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 06:31:08,959 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 06:31:07" (1/3) ... [2025-02-06 06:31:08,960 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2dea6c4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 06:31:08, skipping insertion in model container [2025-02-06 06:31:08,960 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:31:07" (2/3) ... [2025-02-06 06:31:08,960 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2dea6c4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 06:31:08, skipping insertion in model container [2025-02-06 06:31:08,960 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 06:31:08" (3/3) ... [2025-02-06 06:31:08,961 INFO L128 eAbstractionObserver]: Analyzing ICFG 43_2a_consumption_linux-3.16-rc1.tar.xz-43_2a-kernel--locking--locktorture.ko-entry_point.cil.out.i [2025-02-06 06:31:08,975 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 06:31:08,977 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 43_2a_consumption_linux-3.16-rc1.tar.xz-43_2a-kernel--locking--locktorture.ko-entry_point.cil.out.i that has 29 procedures, 373 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-02-06 06:31:09,037 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 06:31:09,046 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;@543e1aa5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 06:31:09,047 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 06:31:09,051 INFO L276 IsEmpty]: Start isEmpty. Operand has 376 states, 273 states have (on average 1.3992673992673992) internal successors, (382), 293 states have internal predecessors, (382), 70 states have call successors, (70), 28 states have call predecessors, (70), 27 states have return successors, (65), 60 states have call predecessors, (65), 65 states have call successors, (65) [2025-02-06 06:31:09,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-02-06 06:31:09,060 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:31:09,061 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 06:31:09,061 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:31:09,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:31:09,066 INFO L85 PathProgramCache]: Analyzing trace with hash -563041101, now seen corresponding path program 1 times [2025-02-06 06:31:09,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:31:09,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480822875] [2025-02-06 06:31:09,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:31:09,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:31:09,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-06 06:31:09,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-06 06:31:09,214 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:31:09,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:31:09,446 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-06 06:31:09,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:31:09,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480822875] [2025-02-06 06:31:09,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480822875] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:31:09,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 06:31:09,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 06:31:09,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539760383] [2025-02-06 06:31:09,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:31:09,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 06:31:09,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:31:09,468 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 06:31:09,468 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 06:31:09,470 INFO L87 Difference]: Start difference. First operand has 376 states, 273 states have (on average 1.3992673992673992) internal successors, (382), 293 states have internal predecessors, (382), 70 states have call successors, (70), 28 states have call predecessors, (70), 27 states have return successors, (65), 60 states have call predecessors, (65), 65 states have call successors, (65) Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-06 06:31:09,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:31:09,599 INFO L93 Difference]: Finished difference Result 1010 states and 1405 transitions. [2025-02-06 06:31:09,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 06:31:09,603 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), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 46 [2025-02-06 06:31:09,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:31:09,614 INFO L225 Difference]: With dead ends: 1010 [2025-02-06 06:31:09,614 INFO L226 Difference]: Without dead ends: 557 [2025-02-06 06:31:09,618 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-02-06 06:31:09,620 INFO L435 NwaCegarLoop]: 531 mSDtfsCounter, 476 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 476 SdHoareTripleChecker+Valid, 900 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 06:31:09,620 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [476 Valid, 900 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 06:31:09,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2025-02-06 06:31:09,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 554. [2025-02-06 06:31:09,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 554 states, 417 states have (on average 1.3573141486810552) internal successors, (566), 428 states have internal predecessors, (566), 95 states have call successors, (95), 46 states have call predecessors, (95), 41 states have return successors, (90), 85 states have call predecessors, (90), 90 states have call successors, (90) [2025-02-06 06:31:09,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 751 transitions. [2025-02-06 06:31:09,681 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 751 transitions. Word has length 46 [2025-02-06 06:31:09,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:31:09,681 INFO L471 AbstractCegarLoop]: Abstraction has 554 states and 751 transitions. [2025-02-06 06:31:09,681 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), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-06 06:31:09,682 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 751 transitions. [2025-02-06 06:31:09,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-02-06 06:31:09,685 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:31:09,685 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 06:31:09,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 06:31:09,685 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:31:09,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:31:09,686 INFO L85 PathProgramCache]: Analyzing trace with hash -1305180118, now seen corresponding path program 1 times [2025-02-06 06:31:09,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:31:09,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067181767] [2025-02-06 06:31:09,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:31:09,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:31:09,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-06 06:31:09,753 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-06 06:31:09,753 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:31:09,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:31:09,876 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-06 06:31:09,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:31:09,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067181767] [2025-02-06 06:31:09,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067181767] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:31:09,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 06:31:09,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 06:31:09,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255189406] [2025-02-06 06:31:09,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:31:09,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 06:31:09,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:31:09,879 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 06:31:09,879 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 06:31:09,879 INFO L87 Difference]: Start difference. First operand 554 states and 751 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, (10), 2 states have call predecessors, (10), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-06 06:31:09,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:31:09,932 INFO L93 Difference]: Finished difference Result 559 states and 756 transitions. [2025-02-06 06:31:09,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 06:31:09,932 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, (10), 2 states have call predecessors, (10), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 55 [2025-02-06 06:31:09,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:31:09,935 INFO L225 Difference]: With dead ends: 559 [2025-02-06 06:31:09,935 INFO L226 Difference]: Without dead ends: 555 [2025-02-06 06:31:09,936 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-02-06 06:31:09,936 INFO L435 NwaCegarLoop]: 489 mSDtfsCounter, 0 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 973 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 06:31:09,937 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 973 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 06:31:09,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2025-02-06 06:31:09,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 555. [2025-02-06 06:31:09,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 555 states, 418 states have (on average 1.354066985645933) internal successors, (566), 429 states have internal predecessors, (566), 95 states have call successors, (95), 46 states have call predecessors, (95), 41 states have return successors, (90), 85 states have call predecessors, (90), 90 states have call successors, (90) [2025-02-06 06:31:09,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 751 transitions. [2025-02-06 06:31:09,960 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 751 transitions. Word has length 55 [2025-02-06 06:31:09,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:31:09,961 INFO L471 AbstractCegarLoop]: Abstraction has 555 states and 751 transitions. [2025-02-06 06:31:09,961 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, (10), 2 states have call predecessors, (10), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-06 06:31:09,961 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 751 transitions. [2025-02-06 06:31:09,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-02-06 06:31:09,963 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:31:09,963 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 06:31:09,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 06:31:09,963 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:31:09,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:31:09,964 INFO L85 PathProgramCache]: Analyzing trace with hash -134509526, now seen corresponding path program 1 times [2025-02-06 06:31:09,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:31:09,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069472428] [2025-02-06 06:31:09,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:31:09,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:31:10,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-02-06 06:31:10,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-02-06 06:31:10,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:31:10,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:31:10,251 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-06 06:31:10,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:31:10,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069472428] [2025-02-06 06:31:10,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069472428] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:31:10,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 06:31:10,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 06:31:10,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132005571] [2025-02-06 06:31:10,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:31:10,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 06:31:10,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:31:10,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 06:31:10,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 06:31:10,253 INFO L87 Difference]: Start difference. First operand 555 states and 751 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-06 06:31:10,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:31:10,352 INFO L93 Difference]: Finished difference Result 1550 states and 2149 transitions. [2025-02-06 06:31:10,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 06:31:10,353 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 57 [2025-02-06 06:31:10,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:31:10,359 INFO L225 Difference]: With dead ends: 1550 [2025-02-06 06:31:10,359 INFO L226 Difference]: Without dead ends: 991 [2025-02-06 06:31:10,361 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 06:31:10,362 INFO L435 NwaCegarLoop]: 492 mSDtfsCounter, 437 mSDsluCounter, 934 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 437 SdHoareTripleChecker+Valid, 1426 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 06:31:10,363 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [437 Valid, 1426 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 06:31:10,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 991 states. [2025-02-06 06:31:10,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 991 to 957. [2025-02-06 06:31:10,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 957 states, 734 states have (on average 1.3896457765667576) internal successors, (1020), 754 states have internal predecessors, (1020), 156 states have call successors, (156), 71 states have call predecessors, (156), 66 states have return successors, (152), 143 states have call predecessors, (152), 151 states have call successors, (152) [2025-02-06 06:31:10,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 957 states to 957 states and 1328 transitions. [2025-02-06 06:31:10,421 INFO L78 Accepts]: Start accepts. Automaton has 957 states and 1328 transitions. Word has length 57 [2025-02-06 06:31:10,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:31:10,422 INFO L471 AbstractCegarLoop]: Abstraction has 957 states and 1328 transitions. [2025-02-06 06:31:10,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-06 06:31:10,423 INFO L276 IsEmpty]: Start isEmpty. Operand 957 states and 1328 transitions. [2025-02-06 06:31:10,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-02-06 06:31:10,429 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:31:10,429 INFO L218 NwaCegarLoop]: trace histogram [3, 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] [2025-02-06 06:31:10,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 06:31:10,429 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:31:10,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:31:10,430 INFO L85 PathProgramCache]: Analyzing trace with hash -1578928362, now seen corresponding path program 1 times [2025-02-06 06:31:10,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:31:10,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647644168] [2025-02-06 06:31:10,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:31:10,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:31:10,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-02-06 06:31:10,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-02-06 06:31:10,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:31:10,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:31:10,549 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-06 06:31:10,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:31:10,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647644168] [2025-02-06 06:31:10,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647644168] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:31:10,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 06:31:10,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 06:31:10,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082415924] [2025-02-06 06:31:10,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:31:10,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 06:31:10,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:31:10,552 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 06:31:10,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 06:31:10,552 INFO L87 Difference]: Start difference. First operand 957 states and 1328 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-06 06:31:10,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:31:10,640 INFO L93 Difference]: Finished difference Result 2470 states and 3424 transitions. [2025-02-06 06:31:10,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 06:31:10,641 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 72 [2025-02-06 06:31:10,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:31:10,651 INFO L225 Difference]: With dead ends: 2470 [2025-02-06 06:31:10,651 INFO L226 Difference]: Without dead ends: 1531 [2025-02-06 06:31:10,653 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-02-06 06:31:10,654 INFO L435 NwaCegarLoop]: 529 mSDtfsCounter, 434 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 434 SdHoareTripleChecker+Valid, 976 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 06:31:10,655 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [434 Valid, 976 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 06:31:10,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1531 states. [2025-02-06 06:31:10,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1531 to 1528. [2025-02-06 06:31:10,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1528 states, 1164 states have (on average 1.3814432989690721) internal successors, (1608), 1200 states have internal predecessors, (1608), 254 states have call successors, (254), 114 states have call predecessors, (254), 109 states have return successors, (251), 233 states have call predecessors, (251), 249 states have call successors, (251) [2025-02-06 06:31:10,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1528 states to 1528 states and 2113 transitions. [2025-02-06 06:31:10,757 INFO L78 Accepts]: Start accepts. Automaton has 1528 states and 2113 transitions. Word has length 72 [2025-02-06 06:31:10,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:31:10,757 INFO L471 AbstractCegarLoop]: Abstraction has 1528 states and 2113 transitions. [2025-02-06 06:31:10,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-06 06:31:10,757 INFO L276 IsEmpty]: Start isEmpty. Operand 1528 states and 2113 transitions. [2025-02-06 06:31:10,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-02-06 06:31:10,763 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:31:10,764 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 06:31:10,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 06:31:10,764 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:31:10,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:31:10,765 INFO L85 PathProgramCache]: Analyzing trace with hash -1375523646, now seen corresponding path program 1 times [2025-02-06 06:31:10,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:31:10,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576810801] [2025-02-06 06:31:10,765 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:31:10,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:31:10,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-02-06 06:31:10,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-02-06 06:31:10,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:31:10,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:31:10,831 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-02-06 06:31:10,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:31:10,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576810801] [2025-02-06 06:31:10,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576810801] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:31:10,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 06:31:10,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 06:31:10,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051116675] [2025-02-06 06:31:10,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:31:10,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 06:31:10,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:31:10,833 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 06:31:10,833 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 06:31:10,833 INFO L87 Difference]: Start difference. First operand 1528 states and 2113 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-06 06:31:10,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:31:10,887 INFO L93 Difference]: Finished difference Result 3040 states and 4211 transitions. [2025-02-06 06:31:10,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 06:31:10,888 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 76 [2025-02-06 06:31:10,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:31:10,894 INFO L225 Difference]: With dead ends: 3040 [2025-02-06 06:31:10,894 INFO L226 Difference]: Without dead ends: 1532 [2025-02-06 06:31:10,897 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-02-06 06:31:10,898 INFO L435 NwaCegarLoop]: 489 mSDtfsCounter, 0 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 973 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 06:31:10,898 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 973 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 06:31:10,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1532 states. [2025-02-06 06:31:10,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1532 to 1532. [2025-02-06 06:31:10,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1532 states, 1168 states have (on average 1.38013698630137) internal successors, (1612), 1204 states have internal predecessors, (1612), 254 states have call successors, (254), 114 states have call predecessors, (254), 109 states have return successors, (251), 233 states have call predecessors, (251), 249 states have call successors, (251) [2025-02-06 06:31:10,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1532 states to 1532 states and 2117 transitions. [2025-02-06 06:31:10,976 INFO L78 Accepts]: Start accepts. Automaton has 1532 states and 2117 transitions. Word has length 76 [2025-02-06 06:31:10,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:31:10,977 INFO L471 AbstractCegarLoop]: Abstraction has 1532 states and 2117 transitions. [2025-02-06 06:31:10,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-06 06:31:10,977 INFO L276 IsEmpty]: Start isEmpty. Operand 1532 states and 2117 transitions. [2025-02-06 06:31:10,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-02-06 06:31:10,980 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:31:10,980 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 06:31:10,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 06:31:10,980 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:31:10,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:31:10,981 INFO L85 PathProgramCache]: Analyzing trace with hash 595415811, now seen corresponding path program 1 times [2025-02-06 06:31:10,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:31:10,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722002132] [2025-02-06 06:31:10,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:31:10,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:31:10,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-02-06 06:31:11,009 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-02-06 06:31:11,010 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:31:11,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:31:11,066 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-02-06 06:31:11,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:31:11,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722002132] [2025-02-06 06:31:11,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722002132] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:31:11,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 06:31:11,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 06:31:11,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131604492] [2025-02-06 06:31:11,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:31:11,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 06:31:11,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:31:11,068 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 06:31:11,068 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 06:31:11,068 INFO L87 Difference]: Start difference. First operand 1532 states and 2117 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-06 06:31:11,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:31:11,151 INFO L93 Difference]: Finished difference Result 3056 states and 4227 transitions. [2025-02-06 06:31:11,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 06:31:11,152 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 76 [2025-02-06 06:31:11,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:31:11,160 INFO L225 Difference]: With dead ends: 3056 [2025-02-06 06:31:11,160 INFO L226 Difference]: Without dead ends: 1484 [2025-02-06 06:31:11,163 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 06:31:11,164 INFO L435 NwaCegarLoop]: 488 mSDtfsCounter, 1 mSDsluCounter, 968 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1456 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.0s IncrementalHoareTripleChecker+Time [2025-02-06 06:31:11,164 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1456 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 06:31:11,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1484 states. [2025-02-06 06:31:11,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1484 to 1480. [2025-02-06 06:31:11,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1480 states, 1136 states have (on average 1.380281690140845) internal successors, (1568), 1172 states have internal predecessors, (1568), 234 states have call successors, (234), 114 states have call predecessors, (234), 109 states have return successors, (231), 213 states have call predecessors, (231), 229 states have call successors, (231) [2025-02-06 06:31:11,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1480 states to 1480 states and 2033 transitions. [2025-02-06 06:31:11,213 INFO L78 Accepts]: Start accepts. Automaton has 1480 states and 2033 transitions. Word has length 76 [2025-02-06 06:31:11,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:31:11,213 INFO L471 AbstractCegarLoop]: Abstraction has 1480 states and 2033 transitions. [2025-02-06 06:31:11,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-06 06:31:11,213 INFO L276 IsEmpty]: Start isEmpty. Operand 1480 states and 2033 transitions. [2025-02-06 06:31:11,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-02-06 06:31:11,214 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:31:11,215 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 06:31:11,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 06:31:11,215 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:31:11,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:31:11,215 INFO L85 PathProgramCache]: Analyzing trace with hash 1227747378, now seen corresponding path program 1 times [2025-02-06 06:31:11,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:31:11,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529715088] [2025-02-06 06:31:11,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:31:11,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:31:11,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-02-06 06:31:11,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-02-06 06:31:11,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:31:11,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:31:11,271 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-06 06:31:11,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:31:11,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529715088] [2025-02-06 06:31:11,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529715088] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:31:11,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 06:31:11,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 06:31:11,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511635300] [2025-02-06 06:31:11,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:31:11,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 06:31:11,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:31:11,272 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 06:31:11,272 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 06:31:11,272 INFO L87 Difference]: Start difference. First operand 1480 states and 2033 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-06 06:31:11,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:31:11,338 INFO L93 Difference]: Finished difference Result 2633 states and 3615 transitions. [2025-02-06 06:31:11,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 06:31:11,339 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 78 [2025-02-06 06:31:11,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:31:11,344 INFO L225 Difference]: With dead ends: 2633 [2025-02-06 06:31:11,344 INFO L226 Difference]: Without dead ends: 1172 [2025-02-06 06:31:11,347 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-02-06 06:31:11,347 INFO L435 NwaCegarLoop]: 471 mSDtfsCounter, 328 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 328 SdHoareTripleChecker+Valid, 898 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 06:31:11,348 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [328 Valid, 898 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 06:31:11,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1172 states. [2025-02-06 06:31:11,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1172 to 1172. [2025-02-06 06:31:11,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1172 states, 899 states have (on average 1.3759733036707453) internal successors, (1237), 927 states have internal predecessors, (1237), 185 states have call successors, (185), 92 states have call predecessors, (185), 87 states have return successors, (181), 167 states have call predecessors, (181), 180 states have call successors, (181) [2025-02-06 06:31:11,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1172 states to 1172 states and 1603 transitions. [2025-02-06 06:31:11,409 INFO L78 Accepts]: Start accepts. Automaton has 1172 states and 1603 transitions. Word has length 78 [2025-02-06 06:31:11,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:31:11,409 INFO L471 AbstractCegarLoop]: Abstraction has 1172 states and 1603 transitions. [2025-02-06 06:31:11,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-06 06:31:11,409 INFO L276 IsEmpty]: Start isEmpty. Operand 1172 states and 1603 transitions. [2025-02-06 06:31:11,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-02-06 06:31:11,412 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:31:11,412 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 06:31:11,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 06:31:11,412 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:31:11,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:31:11,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1789477608, now seen corresponding path program 1 times [2025-02-06 06:31:11,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:31:11,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498328457] [2025-02-06 06:31:11,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:31:11,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:31:11,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-06 06:31:11,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-06 06:31:11,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:31:11,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:31:11,563 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-02-06 06:31:11,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:31:11,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498328457] [2025-02-06 06:31:11,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498328457] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:31:11,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 06:31:11,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 06:31:11,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098389427] [2025-02-06 06:31:11,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:31:11,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 06:31:11,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:31:11,564 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 06:31:11,564 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 06:31:11,565 INFO L87 Difference]: Start difference. First operand 1172 states and 1603 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 3 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-02-06 06:31:11,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:31:11,625 INFO L93 Difference]: Finished difference Result 2324 states and 3183 transitions. [2025-02-06 06:31:11,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 06:31:11,626 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 3 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 123 [2025-02-06 06:31:11,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:31:11,632 INFO L225 Difference]: With dead ends: 2324 [2025-02-06 06:31:11,632 INFO L226 Difference]: Without dead ends: 1172 [2025-02-06 06:31:11,635 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-02-06 06:31:11,636 INFO L435 NwaCegarLoop]: 468 mSDtfsCounter, 448 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 448 SdHoareTripleChecker+Valid, 468 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 06:31:11,636 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [448 Valid, 468 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 06:31:11,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1172 states. [2025-02-06 06:31:11,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1172 to 1172. [2025-02-06 06:31:11,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1172 states, 899 states have (on average 1.3726362625139044) internal successors, (1234), 927 states have internal predecessors, (1234), 185 states have call successors, (185), 92 states have call predecessors, (185), 87 states have return successors, (181), 167 states have call predecessors, (181), 180 states have call successors, (181) [2025-02-06 06:31:11,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1172 states to 1172 states and 1600 transitions. [2025-02-06 06:31:11,708 INFO L78 Accepts]: Start accepts. Automaton has 1172 states and 1600 transitions. Word has length 123 [2025-02-06 06:31:11,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:31:11,708 INFO L471 AbstractCegarLoop]: Abstraction has 1172 states and 1600 transitions. [2025-02-06 06:31:11,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 3 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-02-06 06:31:11,708 INFO L276 IsEmpty]: Start isEmpty. Operand 1172 states and 1600 transitions. [2025-02-06 06:31:11,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-02-06 06:31:11,711 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:31:11,711 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 06:31:11,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 06:31:11,712 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:31:11,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:31:11,712 INFO L85 PathProgramCache]: Analyzing trace with hash 425058219, now seen corresponding path program 1 times [2025-02-06 06:31:11,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:31:11,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759095310] [2025-02-06 06:31:11,712 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:31:11,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:31:11,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-02-06 06:31:11,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-02-06 06:31:11,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:31:11,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:31:11,847 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-06 06:31:11,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:31:11,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759095310] [2025-02-06 06:31:11,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759095310] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:31:11,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 06:31:11,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 06:31:11,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562734320] [2025-02-06 06:31:11,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:31:11,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 06:31:11,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:31:11,849 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 06:31:11,849 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 06:31:11,850 INFO L87 Difference]: Start difference. First operand 1172 states and 1600 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-02-06 06:31:11,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:31:11,969 INFO L93 Difference]: Finished difference Result 2948 states and 4060 transitions. [2025-02-06 06:31:11,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 06:31:11,969 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 126 [2025-02-06 06:31:11,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:31:11,979 INFO L225 Difference]: With dead ends: 2948 [2025-02-06 06:31:11,979 INFO L226 Difference]: Without dead ends: 2035 [2025-02-06 06:31:11,981 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-02-06 06:31:11,984 INFO L435 NwaCegarLoop]: 776 mSDtfsCounter, 419 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 419 SdHoareTripleChecker+Valid, 1216 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 06:31:11,984 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [419 Valid, 1216 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 06:31:11,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2035 states. [2025-02-06 06:31:12,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2035 to 2001. [2025-02-06 06:31:12,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2001 states, 1550 states have (on average 1.3741935483870968) internal successors, (2130), 1598 states have internal predecessors, (2130), 303 states have call successors, (303), 152 states have call predecessors, (303), 147 states have return successors, (300), 277 states have call predecessors, (300), 298 states have call successors, (300) [2025-02-06 06:31:12,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2001 states to 2001 states and 2733 transitions. [2025-02-06 06:31:12,053 INFO L78 Accepts]: Start accepts. Automaton has 2001 states and 2733 transitions. Word has length 126 [2025-02-06 06:31:12,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:31:12,054 INFO L471 AbstractCegarLoop]: Abstraction has 2001 states and 2733 transitions. [2025-02-06 06:31:12,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-02-06 06:31:12,054 INFO L276 IsEmpty]: Start isEmpty. Operand 2001 states and 2733 transitions. [2025-02-06 06:31:12,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-02-06 06:31:12,058 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:31:12,058 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 06:31:12,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 06:31:12,059 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:31:12,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:31:12,059 INFO L85 PathProgramCache]: Analyzing trace with hash -1898796017, now seen corresponding path program 1 times [2025-02-06 06:31:12,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:31:12,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709280466] [2025-02-06 06:31:12,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:31:12,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:31:12,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-02-06 06:31:12,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-02-06 06:31:12,105 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:31:12,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:31:12,177 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-06 06:31:12,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:31:12,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709280466] [2025-02-06 06:31:12,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709280466] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:31:12,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 06:31:12,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 06:31:12,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138910177] [2025-02-06 06:31:12,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:31:12,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 06:31:12,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:31:12,178 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 06:31:12,178 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 06:31:12,178 INFO L87 Difference]: Start difference. First operand 2001 states and 2733 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-02-06 06:31:12,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:31:12,329 INFO L93 Difference]: Finished difference Result 5369 states and 7379 transitions. [2025-02-06 06:31:12,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 06:31:12,329 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 132 [2025-02-06 06:31:12,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:31:12,342 INFO L225 Difference]: With dead ends: 5369 [2025-02-06 06:31:12,342 INFO L226 Difference]: Without dead ends: 3627 [2025-02-06 06:31:12,346 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-02-06 06:31:12,346 INFO L435 NwaCegarLoop]: 776 mSDtfsCounter, 413 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 413 SdHoareTripleChecker+Valid, 1216 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 06:31:12,346 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [413 Valid, 1216 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 06:31:12,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3627 states. [2025-02-06 06:31:12,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3627 to 3591. [2025-02-06 06:31:12,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3591 states, 2804 states have (on average 1.3716119828815978) internal successors, (3846), 2892 states have internal predecessors, (3846), 523 states have call successors, (523), 268 states have call predecessors, (523), 263 states have return successors, (522), 481 states have call predecessors, (522), 518 states have call successors, (522) [2025-02-06 06:31:12,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3591 states to 3591 states and 4891 transitions. [2025-02-06 06:31:12,467 INFO L78 Accepts]: Start accepts. Automaton has 3591 states and 4891 transitions. Word has length 132 [2025-02-06 06:31:12,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:31:12,467 INFO L471 AbstractCegarLoop]: Abstraction has 3591 states and 4891 transitions. [2025-02-06 06:31:12,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-02-06 06:31:12,468 INFO L276 IsEmpty]: Start isEmpty. Operand 3591 states and 4891 transitions. [2025-02-06 06:31:12,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-02-06 06:31:12,476 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:31:12,476 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 06:31:12,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 06:31:12,476 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:31:12,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:31:12,480 INFO L85 PathProgramCache]: Analyzing trace with hash 2026433195, now seen corresponding path program 1 times [2025-02-06 06:31:12,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:31:12,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759858633] [2025-02-06 06:31:12,481 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:31:12,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:31:12,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-02-06 06:31:12,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-02-06 06:31:12,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:31:12,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:31:12,678 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 8 proven. 13 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-02-06 06:31:12,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:31:12,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759858633] [2025-02-06 06:31:12,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759858633] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 06:31:12,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1585333953] [2025-02-06 06:31:12,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:31:12,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 06:31:12,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 06:31:12,683 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 06:31:12,686 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 06:31:12,879 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-02-06 06:31:12,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-02-06 06:31:12,997 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:31:12,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:31:13,003 INFO L256 TraceCheckSpWp]: Trace formula consists of 1088 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 06:31:13,013 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 06:31:13,074 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-02-06 06:31:13,074 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 06:31:13,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1585333953] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:31:13,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 06:31:13,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 7 [2025-02-06 06:31:13,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405599777] [2025-02-06 06:31:13,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:31:13,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 06:31:13,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:31:13,077 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 06:31:13,077 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 06:31:13,077 INFO L87 Difference]: Start difference. First operand 3591 states and 4891 transitions. Second operand has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 3 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-02-06 06:31:13,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:31:13,228 INFO L93 Difference]: Finished difference Result 7216 states and 9840 transitions. [2025-02-06 06:31:13,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 06:31:13,229 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 3 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 136 [2025-02-06 06:31:13,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:31:13,244 INFO L225 Difference]: With dead ends: 7216 [2025-02-06 06:31:13,244 INFO L226 Difference]: Without dead ends: 3559 [2025-02-06 06:31:13,252 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 06:31:13,253 INFO L435 NwaCegarLoop]: 466 mSDtfsCounter, 1 mSDsluCounter, 1373 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1839 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 06:31:13,254 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1839 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 06:31:13,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3559 states. [2025-02-06 06:31:13,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3559 to 3559. [2025-02-06 06:31:13,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3559 states, 2774 states have (on average 1.368421052631579) internal successors, (3796), 2866 states have internal predecessors, (3796), 521 states have call successors, (521), 268 states have call predecessors, (521), 263 states have return successors, (516), 475 states have call predecessors, (516), 512 states have call successors, (516) [2025-02-06 06:31:13,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3559 states to 3559 states and 4833 transitions. [2025-02-06 06:31:13,448 INFO L78 Accepts]: Start accepts. Automaton has 3559 states and 4833 transitions. Word has length 136 [2025-02-06 06:31:13,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:31:13,449 INFO L471 AbstractCegarLoop]: Abstraction has 3559 states and 4833 transitions. [2025-02-06 06:31:13,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 3 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-02-06 06:31:13,449 INFO L276 IsEmpty]: Start isEmpty. Operand 3559 states and 4833 transitions. [2025-02-06 06:31:13,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-02-06 06:31:13,453 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:31:13,453 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 06:31:13,466 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 06:31:13,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-02-06 06:31:13,654 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:31:13,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:31:13,655 INFO L85 PathProgramCache]: Analyzing trace with hash 629114955, now seen corresponding path program 1 times [2025-02-06 06:31:13,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:31:13,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582294594] [2025-02-06 06:31:13,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:31:13,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:31:13,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-02-06 06:31:13,701 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-02-06 06:31:13,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:31:13,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:31:13,806 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-02-06 06:31:13,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:31:13,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582294594] [2025-02-06 06:31:13,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582294594] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:31:13,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 06:31:13,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 06:31:13,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806483013] [2025-02-06 06:31:13,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:31:13,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 06:31:13,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:31:13,808 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 06:31:13,808 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 06:31:13,808 INFO L87 Difference]: Start difference. First operand 3559 states and 4833 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 3 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-02-06 06:31:13,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:31:13,951 INFO L93 Difference]: Finished difference Result 7080 states and 9616 transitions. [2025-02-06 06:31:13,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 06:31:13,952 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 3 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 138 [2025-02-06 06:31:13,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:31:13,968 INFO L225 Difference]: With dead ends: 7080 [2025-02-06 06:31:13,968 INFO L226 Difference]: Without dead ends: 3541 [2025-02-06 06:31:13,975 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-02-06 06:31:13,976 INFO L435 NwaCegarLoop]: 464 mSDtfsCounter, 434 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 434 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 06:31:13,976 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [434 Valid, 464 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 06:31:13,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3541 states. [2025-02-06 06:31:14,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3541 to 3541. [2025-02-06 06:31:14,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3541 states, 2756 states have (on average 1.3642960812772134) internal successors, (3760), 2848 states have internal predecessors, (3760), 521 states have call successors, (521), 268 states have call predecessors, (521), 263 states have return successors, (516), 475 states have call predecessors, (516), 512 states have call successors, (516) [2025-02-06 06:31:14,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3541 states to 3541 states and 4797 transitions. [2025-02-06 06:31:14,140 INFO L78 Accepts]: Start accepts. Automaton has 3541 states and 4797 transitions. Word has length 138 [2025-02-06 06:31:14,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:31:14,140 INFO L471 AbstractCegarLoop]: Abstraction has 3541 states and 4797 transitions. [2025-02-06 06:31:14,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 3 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-02-06 06:31:14,141 INFO L276 IsEmpty]: Start isEmpty. Operand 3541 states and 4797 transitions. [2025-02-06 06:31:14,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-02-06 06:31:14,144 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:31:14,144 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 06:31:14,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 06:31:14,145 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:31:14,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:31:14,145 INFO L85 PathProgramCache]: Analyzing trace with hash -1442451023, now seen corresponding path program 1 times [2025-02-06 06:31:14,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:31:14,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937838561] [2025-02-06 06:31:14,145 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:31:14,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:31:14,166 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-02-06 06:31:14,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-02-06 06:31:14,179 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:31:14,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:31:14,266 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 8 proven. 13 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-02-06 06:31:14,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:31:14,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937838561] [2025-02-06 06:31:14,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937838561] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 06:31:14,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1145527249] [2025-02-06 06:31:14,267 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:31:14,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 06:31:14,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 06:31:14,269 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 06:31:14,271 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 06:31:14,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-02-06 06:31:14,556 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-02-06 06:31:14,556 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:31:14,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:31:14,559 INFO L256 TraceCheckSpWp]: Trace formula consists of 1099 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 06:31:14,563 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 06:31:14,662 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-02-06 06:31:14,662 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 06:31:14,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1145527249] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:31:14,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 06:31:14,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2025-02-06 06:31:14,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674921672] [2025-02-06 06:31:14,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:31:14,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 06:31:14,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:31:14,663 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 06:31:14,664 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 06:31:14,664 INFO L87 Difference]: Start difference. First operand 3541 states and 4797 transitions. Second operand has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 4 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2025-02-06 06:31:15,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:31:15,107 INFO L93 Difference]: Finished difference Result 10557 states and 14313 transitions. [2025-02-06 06:31:15,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 06:31:15,107 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 4 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) Word has length 139 [2025-02-06 06:31:15,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:31:15,149 INFO L225 Difference]: With dead ends: 10557 [2025-02-06 06:31:15,150 INFO L226 Difference]: Without dead ends: 10525 [2025-02-06 06:31:15,157 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 06:31:15,157 INFO L435 NwaCegarLoop]: 819 mSDtfsCounter, 803 mSDsluCounter, 823 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 803 SdHoareTripleChecker+Valid, 1642 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 06:31:15,157 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [803 Valid, 1642 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 06:31:15,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10525 states. [2025-02-06 06:31:15,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10525 to 10437. [2025-02-06 06:31:15,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10437 states, 8116 states have (on average 1.369393790044357) internal successors, (11114), 8392 states have internal predecessors, (11114), 1539 states have call successors, (1539), 786 states have call predecessors, (1539), 781 states have return successors, (1534), 1411 states have call predecessors, (1534), 1522 states have call successors, (1534) [2025-02-06 06:31:15,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10437 states to 10437 states and 14187 transitions. [2025-02-06 06:31:15,539 INFO L78 Accepts]: Start accepts. Automaton has 10437 states and 14187 transitions. Word has length 139 [2025-02-06 06:31:15,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:31:15,539 INFO L471 AbstractCegarLoop]: Abstraction has 10437 states and 14187 transitions. [2025-02-06 06:31:15,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 4 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2025-02-06 06:31:15,539 INFO L276 IsEmpty]: Start isEmpty. Operand 10437 states and 14187 transitions. [2025-02-06 06:31:15,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-02-06 06:31:15,550 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:31:15,550 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 06:31:15,558 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-06 06:31:15,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 06:31:15,751 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:31:15,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:31:15,752 INFO L85 PathProgramCache]: Analyzing trace with hash -1913220436, now seen corresponding path program 1 times [2025-02-06 06:31:15,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:31:15,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656227356] [2025-02-06 06:31:15,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:31:15,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:31:15,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-02-06 06:31:15,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-02-06 06:31:15,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:31:15,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:31:15,883 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-02-06 06:31:15,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:31:15,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656227356] [2025-02-06 06:31:15,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656227356] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:31:15,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 06:31:15,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 06:31:15,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379095959] [2025-02-06 06:31:15,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:31:15,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 06:31:15,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:31:15,889 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 06:31:15,889 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 06:31:15,890 INFO L87 Difference]: Start difference. First operand 10437 states and 14187 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 3 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-02-06 06:31:16,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:31:16,147 INFO L93 Difference]: Finished difference Result 13453 states and 18358 transitions. [2025-02-06 06:31:16,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 06:31:16,147 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 3 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 148 [2025-02-06 06:31:16,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:31:16,172 INFO L225 Difference]: With dead ends: 13453 [2025-02-06 06:31:16,173 INFO L226 Difference]: Without dead ends: 3721 [2025-02-06 06:31:16,195 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-02-06 06:31:16,195 INFO L435 NwaCegarLoop]: 570 mSDtfsCounter, 240 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 880 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 06:31:16,196 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 880 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 06:31:16,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3721 states. [2025-02-06 06:31:16,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3721 to 3721. [2025-02-06 06:31:16,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3721 states, 2969 states have (on average 1.3792522734927586) internal successors, (4095), 3041 states have internal predecessors, (4095), 483 states have call successors, (483), 273 states have call predecessors, (483), 268 states have return successors, (478), 463 states have call predecessors, (478), 478 states have call successors, (478) [2025-02-06 06:31:16,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3721 states to 3721 states and 5056 transitions. [2025-02-06 06:31:16,380 INFO L78 Accepts]: Start accepts. Automaton has 3721 states and 5056 transitions. Word has length 148 [2025-02-06 06:31:16,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:31:16,381 INFO L471 AbstractCegarLoop]: Abstraction has 3721 states and 5056 transitions. [2025-02-06 06:31:16,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 3 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-02-06 06:31:16,381 INFO L276 IsEmpty]: Start isEmpty. Operand 3721 states and 5056 transitions. [2025-02-06 06:31:16,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-02-06 06:31:16,392 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:31:16,392 INFO L218 NwaCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 06:31:16,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 06:31:16,392 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:31:16,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:31:16,393 INFO L85 PathProgramCache]: Analyzing trace with hash -677435229, now seen corresponding path program 1 times [2025-02-06 06:31:16,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:31:16,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808701798] [2025-02-06 06:31:16,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:31:16,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:31:16,423 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-02-06 06:31:16,453 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-02-06 06:31:16,453 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:31:16,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:31:16,626 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-02-06 06:31:16,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:31:16,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808701798] [2025-02-06 06:31:16,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808701798] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:31:16,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 06:31:16,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 06:31:16,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946350908] [2025-02-06 06:31:16,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:31:16,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 06:31:16,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:31:16,628 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 06:31:16,628 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 06:31:16,628 INFO L87 Difference]: Start difference. First operand 3721 states and 5056 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-02-06 06:31:16,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:31:16,776 INFO L93 Difference]: Finished difference Result 7464 states and 10155 transitions. [2025-02-06 06:31:16,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 06:31:16,777 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 148 [2025-02-06 06:31:16,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:31:16,789 INFO L225 Difference]: With dead ends: 7464 [2025-02-06 06:31:16,789 INFO L226 Difference]: Without dead ends: 3763 [2025-02-06 06:31:16,797 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 06:31:16,797 INFO L435 NwaCegarLoop]: 447 mSDtfsCounter, 8 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 884 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 06:31:16,798 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 884 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 06:31:16,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3763 states. [2025-02-06 06:31:16,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3763 to 3724. [2025-02-06 06:31:16,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3724 states, 2972 states have (on average 1.3788694481830417) internal successors, (4098), 3044 states have internal predecessors, (4098), 483 states have call successors, (483), 273 states have call predecessors, (483), 268 states have return successors, (478), 463 states have call predecessors, (478), 478 states have call successors, (478) [2025-02-06 06:31:16,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3724 states to 3724 states and 5059 transitions. [2025-02-06 06:31:16,937 INFO L78 Accepts]: Start accepts. Automaton has 3724 states and 5059 transitions. Word has length 148 [2025-02-06 06:31:16,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:31:16,937 INFO L471 AbstractCegarLoop]: Abstraction has 3724 states and 5059 transitions. [2025-02-06 06:31:16,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-02-06 06:31:16,937 INFO L276 IsEmpty]: Start isEmpty. Operand 3724 states and 5059 transitions. [2025-02-06 06:31:16,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-02-06 06:31:16,943 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:31:16,943 INFO L218 NwaCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 06:31:16,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 06:31:16,944 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:31:16,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:31:16,947 INFO L85 PathProgramCache]: Analyzing trace with hash 577710591, now seen corresponding path program 1 times [2025-02-06 06:31:16,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:31:16,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708539835] [2025-02-06 06:31:16,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:31:16,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:31:16,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-02-06 06:31:16,990 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-02-06 06:31:16,991 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:31:16,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:31:17,254 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-02-06 06:31:17,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:31:17,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708539835] [2025-02-06 06:31:17,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708539835] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:31:17,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 06:31:17,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 06:31:17,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727532874] [2025-02-06 06:31:17,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:31:17,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 06:31:17,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:31:17,256 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 06:31:17,256 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 06:31:17,256 INFO L87 Difference]: Start difference. First operand 3724 states and 5059 transitions. Second operand has 5 states, 5 states have (on average 20.6) internal successors, (103), 4 states have internal predecessors, (103), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2025-02-06 06:31:17,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:31:17,331 INFO L93 Difference]: Finished difference Result 4298 states and 5786 transitions. [2025-02-06 06:31:17,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 06:31:17,332 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.6) internal successors, (103), 4 states have internal predecessors, (103), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) Word has length 150 [2025-02-06 06:31:17,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:31:17,336 INFO L225 Difference]: With dead ends: 4298 [2025-02-06 06:31:17,336 INFO L226 Difference]: Without dead ends: 0 [2025-02-06 06:31:17,341 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-06 06:31:17,342 INFO L435 NwaCegarLoop]: 254 mSDtfsCounter, 257 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 758 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 06:31:17,342 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 758 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 06:31:17,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-06 06:31:17,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-06 06:31:17,343 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-02-06 06:31:17,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-06 06:31:17,344 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 150 [2025-02-06 06:31:17,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:31:17,344 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-06 06:31:17,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.6) internal successors, (103), 4 states have internal predecessors, (103), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2025-02-06 06:31:17,345 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-06 06:31:17,345 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-06 06:31:17,347 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-06 06:31:17,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 06:31:17,349 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 06:31:17,350 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-06 06:31:20,752 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 06:31:20,772 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 06:31:20 BoogieIcfgContainer [2025-02-06 06:31:20,774 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 06:31:20,775 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 06:31:20,775 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 06:31:20,775 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 06:31:20,775 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 06:31:08" (3/4) ... [2025-02-06 06:31:20,781 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-06 06:31:20,789 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure _torture_stop_kthread [2025-02-06 06:31:20,789 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure kfree [2025-02-06 06:31:20,789 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure torture_lock_busted_write_delay [2025-02-06 06:31:20,789 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure printk [2025-02-06 06:31:20,789 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure torture_lock_spin_write_unlock_irq [2025-02-06 06:31:20,789 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure __const_udelay [2025-02-06 06:31:20,790 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure ldv_error [2025-02-06 06:31:20,790 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure torture_lock_busted_write_lock [2025-02-06 06:31:20,790 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure kmalloc [2025-02-06 06:31:20,790 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure torture_random [2025-02-06 06:31:20,790 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure ldv_stop [2025-02-06 06:31:20,790 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure lock_torture_stats_print [2025-02-06 06:31:20,790 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure torture_lock_busted_write_unlock [2025-02-06 06:31:20,790 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure lock_torture_print_module_parms [2025-02-06 06:31:20,790 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure torture_spin_lock_write_delay [2025-02-06 06:31:20,790 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure lock_torture_cleanup [2025-02-06 06:31:20,790 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure torture_init_end [2025-02-06 06:31:20,790 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2025-02-06 06:31:20,790 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure ldv_spin_unlock [2025-02-06 06:31:20,790 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure ldv_spin_lock [2025-02-06 06:31:20,790 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure torture_spin_lock_write_lock_irq [2025-02-06 06:31:20,790 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2025-02-06 06:31:20,790 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure _torture_create_kthread [2025-02-06 06:31:20,790 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure torture_spin_lock_write_lock [2025-02-06 06:31:20,790 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure ##fun~~TO~VOID [2025-02-06 06:31:20,790 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure ldv_zalloc [2025-02-06 06:31:20,791 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure torture_spin_lock_write_unlock [2025-02-06 06:31:20,791 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure ldv_check_alloc_flags [2025-02-06 06:31:20,807 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 107 nodes and edges [2025-02-06 06:31:20,808 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 43 nodes and edges [2025-02-06 06:31:20,809 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2025-02-06 06:31:20,810 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-02-06 06:31:20,811 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-02-06 06:31:20,812 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-06 06:31:20,813 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-06 06:31:20,907 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-06 06:31:20,907 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-06 06:31:20,907 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 06:31:20,908 INFO L158 Benchmark]: Toolchain (without parser) took 13857.98ms. Allocated memory was 142.6MB in the beginning and 822.1MB in the end (delta: 679.5MB). Free memory was 110.0MB in the beginning and 427.5MB in the end (delta: -317.5MB). Peak memory consumption was 363.7MB. Max. memory is 16.1GB. [2025-02-06 06:31:20,908 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 123.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 06:31:20,908 INFO L158 Benchmark]: CACSL2BoogieTranslator took 697.49ms. Allocated memory is still 142.6MB. Free memory was 110.0MB in the beginning and 63.5MB in the end (delta: 46.5MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2025-02-06 06:31:20,908 INFO L158 Benchmark]: Boogie Procedure Inliner took 74.79ms. Allocated memory is still 142.6MB. Free memory was 63.5MB in the beginning and 58.0MB in the end (delta: 5.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 06:31:20,908 INFO L158 Benchmark]: Boogie Preprocessor took 66.63ms. Allocated memory is still 142.6MB. Free memory was 58.0MB in the beginning and 49.1MB in the end (delta: 8.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 06:31:20,908 INFO L158 Benchmark]: IcfgBuilder took 1062.71ms. Allocated memory is still 142.6MB. Free memory was 49.1MB in the beginning and 86.1MB in the end (delta: -37.1MB). Peak memory consumption was 36.8MB. Max. memory is 16.1GB. [2025-02-06 06:31:20,908 INFO L158 Benchmark]: TraceAbstraction took 11818.73ms. Allocated memory was 142.6MB in the beginning and 822.1MB in the end (delta: 679.5MB). Free memory was 86.1MB in the beginning and 448.3MB in the end (delta: -362.2MB). Peak memory consumption was 474.3MB. Max. memory is 16.1GB. [2025-02-06 06:31:20,909 INFO L158 Benchmark]: Witness Printer took 132.17ms. Allocated memory is still 822.1MB. Free memory was 448.3MB in the beginning and 427.5MB in the end (delta: 20.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 06:31:20,909 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.20ms. Allocated memory is still 201.3MB. Free memory is still 123.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 697.49ms. Allocated memory is still 142.6MB. Free memory was 110.0MB in the beginning and 63.5MB in the end (delta: 46.5MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 74.79ms. Allocated memory is still 142.6MB. Free memory was 63.5MB in the beginning and 58.0MB in the end (delta: 5.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 66.63ms. Allocated memory is still 142.6MB. Free memory was 58.0MB in the beginning and 49.1MB in the end (delta: 8.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 1062.71ms. Allocated memory is still 142.6MB. Free memory was 49.1MB in the beginning and 86.1MB in the end (delta: -37.1MB). Peak memory consumption was 36.8MB. Max. memory is 16.1GB. * TraceAbstraction took 11818.73ms. Allocated memory was 142.6MB in the beginning and 822.1MB in the end (delta: 679.5MB). Free memory was 86.1MB in the beginning and 448.3MB in the end (delta: -362.2MB). Peak memory consumption was 474.3MB. Max. memory is 16.1GB. * Witness Printer took 132.17ms. Allocated memory is still 822.1MB. Free memory was 448.3MB in the beginning and 427.5MB in the end (delta: 20.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 1855]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ ("movb %%gs:%P1,%0": "=q" (pfo_ret__): "p" (& current_task)); [1855] - GenericResultAtLocation [Line: 1858]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ ("movw %%gs:%P1,%0": "=r" (pfo_ret__): "p" (& current_task)); [1858] - GenericResultAtLocation [Line: 1861]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ ("movl %%gs:%P1,%0": "=r" (pfo_ret__): "p" (& current_task)); [1861] - GenericResultAtLocation [Line: 1864]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ ("movq %%gs:%P1,%0": "=r" (pfo_ret__): "p" (& current_task)); [1864] - GenericResultAtLocation [Line: 1902]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ volatile (".pushsection .smp_locks,\"a\"\n.balign 4\n.long 671f - .\n.popsection\n671:\n\tlock; incl %0": "+m" (v->counter)); [1902] * 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: 2013]: 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 29 procedures, 373 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.3s, OverallIterations: 16, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4704 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4699 mSDsluCounter, 16969 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8440 mSDsCounter, 46 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 422 IncrementalHoareTripleChecker+Invalid, 468 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 46 mSolverCounterUnsat, 8529 mSDtfsCounter, 422 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 332 GetRequests, 303 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10437occurred in iteration=13, InterpolantAutomatonStates: 56, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.7s AutomataMinimizationTime, 16 MinimizatonAttempts, 241 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 1975 NumberOfCodeBlocks, 1975 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 1957 ConstructedInterpolants, 0 QuantifiedInterpolants, 2757 SizeOfPredicates, 0 NumberOfNonLiveVariables, 2187 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 18 InterpolantComputations, 16 PerfectInterpolantSequences, 504/530 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: 2303]: Location Invariant Derived location invariant: (ldv_spin == 0) - InvariantResult [Line: 2301]: Location Invariant Derived location invariant: (ldv_spin == 0) RESULT: Ultimate proved your program to be correct! [2025-02-06 06:31:20,930 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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