./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 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-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/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 8cac8187c908783c6da6279dd5046ee81ec4fe5bbaff4f4fff097111c44b0a84 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 04:07:03,299 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 04:07:03,356 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-04 04:07:03,362 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 04:07:03,365 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 04:07:03,381 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 04:07:03,382 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 04:07:03,382 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 04:07:03,383 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 04:07:03,383 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 04:07:03,383 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 04:07:03,383 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 04:07:03,383 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 04:07:03,383 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 04:07:03,384 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 04:07:03,384 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 04:07:03,385 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 04:07:03,385 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 04:07:03,385 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 04:07:03,385 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 04:07:03,385 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 04:07:03,385 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 04:07:03,385 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 04:07:03,385 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 04:07:03,385 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 04:07:03,385 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 04:07:03,385 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 04:07:03,385 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 04:07:03,385 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 04:07:03,386 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 04:07:03,386 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 04:07:03,386 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 04:07:03,386 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 04:07:03,386 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 04:07:03,386 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 04:07:03,386 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 04:07:03,386 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 04:07:03,386 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 04:07:03,386 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 04:07:03,386 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 04:07:03,386 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8cac8187c908783c6da6279dd5046ee81ec4fe5bbaff4f4fff097111c44b0a84 [2025-03-04 04:07:03,604 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 04:07:03,611 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 04:07:03,613 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 04:07:03,614 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 04:07:03,614 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 04:07:03,615 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/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-03-04 04:07:04,749 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/14a5f7f74/0c0e24a00d1d4fa0a7d283b21b2b5635/FLAG50db5adbc [2025-03-04 04:07:05,034 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 04:07:05,034 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/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-03-04 04:07:05,049 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/14a5f7f74/0c0e24a00d1d4fa0a7d283b21b2b5635/FLAG50db5adbc [2025-03-04 04:07:05,063 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/14a5f7f74/0c0e24a00d1d4fa0a7d283b21b2b5635 [2025-03-04 04:07:05,065 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 04:07:05,066 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 04:07:05,068 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 04:07:05,068 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 04:07:05,071 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 04:07:05,072 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 04:07:05" (1/1) ... [2025-03-04 04:07:05,072 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42720325 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:07:05, skipping insertion in model container [2025-03-04 04:07:05,072 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 04:07:05" (1/1) ... [2025-03-04 04:07:05,111 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 04:07:05,301 WARN L1383 CHandler]: Detected problem Invalid redeclaration of the name show at C: (*show)(struct kobject___0 * , struct attribute___0 * , char * ) [1764] [2025-03-04 04:07:05,302 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-03-04 04:07:05,371 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.16-rc1/43_2a_consumption_linux-3.16-rc1.tar.xz-43_2a-kernel--locking--locktorture.ko-entry_point.cil.out.i[52456,52469] [2025-03-04 04:07:05,515 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 04:07:05,532 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 04:07:05,576 WARN L1383 CHandler]: Detected problem Invalid redeclaration of the name show at C: (*show)(struct kobject___0 * , struct attribute___0 * , char * ) [1764] [2025-03-04 04:07:05,577 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-03-04 04:07:05,579 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movb %%gs:%P1,%0": "=q" (pfo_ret__): "p" (& current_task)); [1855] [2025-03-04 04:07:05,582 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movw %%gs:%P1,%0": "=r" (pfo_ret__): "p" (& current_task)); [1858] [2025-03-04 04:07:05,583 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movl %%gs:%P1,%0": "=r" (pfo_ret__): "p" (& current_task)); [1861] [2025-03-04 04:07:05,583 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movq %%gs:%P1,%0": "=r" (pfo_ret__): "p" (& current_task)); [1864] [2025-03-04 04:07:05,586 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-03-04 04:07:05,592 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.16-rc1/43_2a_consumption_linux-3.16-rc1.tar.xz-43_2a-kernel--locking--locktorture.ko-entry_point.cil.out.i[52456,52469] [2025-03-04 04:07:05,646 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 04:07:05,670 INFO L204 MainTranslator]: Completed translation [2025-03-04 04:07:05,671 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:07:05 WrapperNode [2025-03-04 04:07:05,672 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 04:07:05,672 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 04:07:05,673 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 04:07:05,673 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 04:07:05,677 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:07:05" (1/1) ... [2025-03-04 04:07:05,690 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:07:05" (1/1) ... [2025-03-04 04:07:05,733 INFO L138 Inliner]: procedures = 114, calls = 293, calls flagged for inlining = 50, calls inlined = 38, statements flattened = 930 [2025-03-04 04:07:05,734 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 04:07:05,734 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 04:07:05,734 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 04:07:05,735 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 04:07:05,744 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:07:05" (1/1) ... [2025-03-04 04:07:05,744 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:07:05" (1/1) ... [2025-03-04 04:07:05,751 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:07:05" (1/1) ... [2025-03-04 04:07:05,788 INFO L175 MemorySlicer]: Split 79 memory accesses to 14 slices as follows [2, 5, 0, 12, 10, 12, 4, 1, 1, 24, 4, 1, 2, 1]. 30 percent of accesses are in the largest equivalence class. The 55 initializations are split as follows [2, 0, 0, 12, 10, 1, 4, 1, 1, 18, 4, 1, 1, 0]. The 9 writes are split as follows [0, 3, 0, 0, 0, 4, 0, 0, 0, 1, 0, 0, 0, 1]. [2025-03-04 04:07:05,792 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:07:05" (1/1) ... [2025-03-04 04:07:05,792 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:07:05" (1/1) ... [2025-03-04 04:07:05,825 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:07:05" (1/1) ... [2025-03-04 04:07:05,828 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:07:05" (1/1) ... [2025-03-04 04:07:05,837 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:07:05" (1/1) ... [2025-03-04 04:07:05,841 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:07:05" (1/1) ... [2025-03-04 04:07:05,851 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 04:07:05,851 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 04:07:05,852 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 04:07:05,852 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 04:07:05,852 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:07:05" (1/1) ... [2025-03-04 04:07:05,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 04:07:05,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 04:07:05,876 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 04:07:05,878 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 04:07:05,897 INFO L130 BoogieDeclarations]: Found specification of procedure _torture_stop_kthread [2025-03-04 04:07:05,897 INFO L138 BoogieDeclarations]: Found implementation of procedure _torture_stop_kthread [2025-03-04 04:07:05,897 INFO L130 BoogieDeclarations]: Found specification of procedure torture_lock_busted_write_lock [2025-03-04 04:07:05,897 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_lock_busted_write_lock [2025-03-04 04:07:05,897 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2025-03-04 04:07:05,897 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2025-03-04 04:07:05,897 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 04:07:05,897 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 04:07:05,897 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 04:07:05,898 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-04 04:07:05,898 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-04 04:07:05,898 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-04 04:07:05,898 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-04 04:07:05,898 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-04 04:07:05,898 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-03-04 04:07:05,898 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-03-04 04:07:05,898 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-03-04 04:07:05,898 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-03-04 04:07:05,898 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-03-04 04:07:05,899 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-03-04 04:07:05,899 INFO L130 BoogieDeclarations]: Found specification of procedure torture_spin_lock_write_delay [2025-03-04 04:07:05,899 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_spin_lock_write_delay [2025-03-04 04:07:05,899 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_lock [2025-03-04 04:07:05,899 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_lock [2025-03-04 04:07:05,899 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2025-03-04 04:07:05,899 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2025-03-04 04:07:05,899 INFO L130 BoogieDeclarations]: Found specification of procedure _torture_create_kthread [2025-03-04 04:07:05,899 INFO L138 BoogieDeclarations]: Found implementation of procedure _torture_create_kthread [2025-03-04 04:07:05,899 INFO L130 BoogieDeclarations]: Found specification of procedure torture_spin_lock_write_lock [2025-03-04 04:07:05,899 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_spin_lock_write_lock [2025-03-04 04:07:05,899 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_alloc_flags [2025-03-04 04:07:05,899 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_alloc_flags [2025-03-04 04:07:05,899 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2025-03-04 04:07:05,900 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2025-03-04 04:07:05,900 INFO L130 BoogieDeclarations]: Found specification of procedure torture_lock_spin_write_unlock_irq [2025-03-04 04:07:05,900 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_lock_spin_write_unlock_irq [2025-03-04 04:07:05,900 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 04:07:05,900 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 04:07:05,900 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 04:07:05,900 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-04 04:07:05,900 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-04 04:07:05,900 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-04 04:07:05,900 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-04 04:07:05,900 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-04 04:07:05,900 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-03-04 04:07:05,900 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-03-04 04:07:05,900 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-03-04 04:07:05,900 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-03-04 04:07:05,900 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-03-04 04:07:05,900 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-03-04 04:07:05,900 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2025-03-04 04:07:05,900 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2025-03-04 04:07:05,900 INFO L130 BoogieDeclarations]: Found specification of procedure torture_random [2025-03-04 04:07:05,900 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_random [2025-03-04 04:07:05,900 INFO L130 BoogieDeclarations]: Found specification of procedure lock_torture_cleanup [2025-03-04 04:07:05,900 INFO L138 BoogieDeclarations]: Found implementation of procedure lock_torture_cleanup [2025-03-04 04:07:05,900 INFO L130 BoogieDeclarations]: Found specification of procedure torture_init_end [2025-03-04 04:07:05,900 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_init_end [2025-03-04 04:07:05,900 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 04:07:05,900 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 04:07:05,900 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 04:07:05,901 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~~TO~VOID [2025-03-04 04:07:05,902 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~~TO~VOID [2025-03-04 04:07:05,902 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 04:07:05,902 INFO L130 BoogieDeclarations]: Found specification of procedure __const_udelay [2025-03-04 04:07:05,902 INFO L138 BoogieDeclarations]: Found implementation of procedure __const_udelay [2025-03-04 04:07:05,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 04:07:05,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 04:07:05,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-04 04:07:05,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-04 04:07:05,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-03-04 04:07:05,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-03-04 04:07:05,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-03-04 04:07:05,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-03-04 04:07:05,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-03-04 04:07:05,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-03-04 04:07:05,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-03-04 04:07:05,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-03-04 04:07:05,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-03-04 04:07:05,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-03-04 04:07:05,903 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 04:07:05,903 INFO L130 BoogieDeclarations]: Found specification of procedure lock_torture_stats_print [2025-03-04 04:07:05,903 INFO L138 BoogieDeclarations]: Found implementation of procedure lock_torture_stats_print [2025-03-04 04:07:05,903 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 04:07:05,903 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 04:07:05,903 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-04 04:07:05,903 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-04 04:07:05,903 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-03-04 04:07:05,903 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-03-04 04:07:05,903 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-03-04 04:07:05,904 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-03-04 04:07:05,904 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-03-04 04:07:05,904 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-03-04 04:07:05,904 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-03-04 04:07:05,904 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-03-04 04:07:05,904 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-03-04 04:07:05,904 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-03-04 04:07:05,904 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock [2025-03-04 04:07:05,904 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock [2025-03-04 04:07:05,904 INFO L130 BoogieDeclarations]: Found specification of procedure torture_spin_lock_write_lock_irq [2025-03-04 04:07:05,904 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_spin_lock_write_lock_irq [2025-03-04 04:07:05,904 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 04:07:05,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-04 04:07:05,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-04 04:07:05,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-04 04:07:05,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-03-04 04:07:05,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-03-04 04:07:05,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-03-04 04:07:05,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-03-04 04:07:05,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2025-03-04 04:07:05,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2025-03-04 04:07:05,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2025-03-04 04:07:05,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2025-03-04 04:07:05,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2025-03-04 04:07:05,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2025-03-04 04:07:05,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2025-03-04 04:07:05,904 INFO L130 BoogieDeclarations]: Found specification of procedure torture_lock_busted_write_delay [2025-03-04 04:07:05,904 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_lock_busted_write_delay [2025-03-04 04:07:05,904 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2025-03-04 04:07:05,904 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2025-03-04 04:07:05,904 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2025-03-04 04:07:05,904 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2025-03-04 04:07:05,904 INFO L130 BoogieDeclarations]: Found specification of procedure torture_lock_busted_write_unlock [2025-03-04 04:07:05,904 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_lock_busted_write_unlock [2025-03-04 04:07:05,904 INFO L130 BoogieDeclarations]: Found specification of procedure lock_torture_print_module_parms [2025-03-04 04:07:05,904 INFO L138 BoogieDeclarations]: Found implementation of procedure lock_torture_print_module_parms [2025-03-04 04:07:05,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 04:07:05,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 04:07:05,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 04:07:05,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-04 04:07:05,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-04 04:07:05,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-04 04:07:05,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-04 04:07:05,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-04 04:07:05,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-04 04:07:05,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-04 04:07:05,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-04 04:07:05,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-04 04:07:05,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-04 04:07:05,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-03-04 04:07:05,905 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2025-03-04 04:07:05,905 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2025-03-04 04:07:05,905 INFO L130 BoogieDeclarations]: Found specification of procedure torture_spin_lock_write_unlock [2025-03-04 04:07:05,908 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_spin_lock_write_unlock [2025-03-04 04:07:05,908 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 04:07:05,908 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 04:07:06,140 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 04:07:06,143 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 04:07:06,159 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2025-03-04 04:07:06,212 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2970: havoc #t~nondet158; [2025-03-04 04:07:06,253 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3057: havoc #t~nondet175; [2025-03-04 04:07:06,284 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3031: havoc torture_cleanup_#t~nondet170#1; [2025-03-04 04:07:06,284 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1896: havoc atomic_read_#t~mem13#1; [2025-03-04 04:07:06,284 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3049: havoc torture_onoff_failures_#t~nondet173#1; [2025-03-04 04:07:06,412 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3013: havoc #t~nondet167; [2025-03-04 04:07:06,422 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1937: havoc __kmalloc_#t~ret20#1.base, __kmalloc_#t~ret20#1.offset; [2025-03-04 04:07:06,710 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2994: havoc ldv_probe_3_#t~nondet162#1; [2025-03-04 04:07:06,711 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3061: havoc torture_shuffle_init_#t~nondet176#1; [2025-03-04 04:07:06,711 INFO L1325 $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-03-04 04:07:06,711 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2998: havoc ldv_release_1_#t~nondet163#1; [2025-03-04 04:07:06,711 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2951: havoc __bitmap_weight_#t~nondet157#1; [2025-03-04 04:07:06,711 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3068: havoc torture_shutdown_init_#t~nondet177#1; [2025-03-04 04:07:06,711 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3002: havoc ldv_release_2_#t~nondet164#1; [2025-03-04 04:07:06,711 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3035: havoc torture_init_begin_#t~nondet171#1; [2025-03-04 04:07:06,711 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2986: havoc ldv_probe_1_#t~nondet160#1; [2025-03-04 04:07:06,712 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3053: havoc torture_onoff_init_#t~nondet174#1; [2025-03-04 04:07:06,712 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3072: havoc torture_stutter_init_#t~nondet178#1; [2025-03-04 04:07:06,712 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3006: havoc ldv_release_3_#t~nondet165#1; [2025-03-04 04:07:06,712 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2990: havoc ldv_probe_2_#t~nondet161#1; [2025-03-04 04:07:06,793 INFO L? ?]: Removed 301 outVars from TransFormulas that were not future-live. [2025-03-04 04:07:06,794 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 04:07:06,817 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 04:07:06,821 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 04:07:06,822 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 04:07:06 BoogieIcfgContainer [2025-03-04 04:07:06,822 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 04:07:06,823 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 04:07:06,823 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 04:07:06,827 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 04:07:06,827 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 04:07:05" (1/3) ... [2025-03-04 04:07:06,828 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18caeb7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 04:07:06, skipping insertion in model container [2025-03-04 04:07:06,828 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:07:05" (2/3) ... [2025-03-04 04:07:06,829 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18caeb7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 04:07:06, skipping insertion in model container [2025-03-04 04:07:06,829 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 04:07:06" (3/3) ... [2025-03-04 04:07:06,830 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-03-04 04:07:06,841 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 04:07:06,842 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-03-04 04:07:06,920 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 04:07:06,933 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;@4c23a63d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 04:07:06,934 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 04:07:06,938 INFO L276 IsEmpty]: Start isEmpty. Operand has 372 states, 273 states have (on average 1.3992673992673992) internal successors, (382), 289 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-03-04 04:07:06,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-04 04:07:06,950 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:07:06,951 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-03-04 04:07:06,951 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:07:06,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:07:06,955 INFO L85 PathProgramCache]: Analyzing trace with hash -563041101, now seen corresponding path program 1 times [2025-03-04 04:07:06,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:07:06,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845883356] [2025-03-04 04:07:06,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:07:06,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:07:07,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-04 04:07:07,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-04 04:07:07,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:07:07,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:07:07,377 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 04:07:07,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:07:07,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845883356] [2025-03-04 04:07:07,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845883356] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:07:07,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:07:07,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 04:07:07,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522111493] [2025-03-04 04:07:07,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:07:07,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 04:07:07,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:07:07,399 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 04:07:07,400 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 04:07:07,403 INFO L87 Difference]: Start difference. First operand has 372 states, 273 states have (on average 1.3992673992673992) internal successors, (382), 289 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-03-04 04:07:07,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:07:07,530 INFO L93 Difference]: Finished difference Result 999 states and 1405 transitions. [2025-03-04 04:07:07,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 04:07:07,535 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-03-04 04:07:07,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:07:07,545 INFO L225 Difference]: With dead ends: 999 [2025-03-04 04:07:07,547 INFO L226 Difference]: Without dead ends: 557 [2025-03-04 04:07:07,552 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 04:07:07,554 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-03-04 04:07:07,559 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-03-04 04:07:07,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2025-03-04 04:07:07,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 554. [2025-03-04 04:07:07,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 554 states, 417 states have (on average 1.3741007194244603) internal successors, (573), 428 states have internal predecessors, (573), 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-03-04 04:07:07,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 758 transitions. [2025-03-04 04:07:07,628 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 758 transitions. Word has length 46 [2025-03-04 04:07:07,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:07:07,628 INFO L471 AbstractCegarLoop]: Abstraction has 554 states and 758 transitions. [2025-03-04 04:07:07,628 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-03-04 04:07:07,628 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 758 transitions. [2025-03-04 04:07:07,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-04 04:07:07,635 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:07:07,635 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-03-04 04:07:07,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 04:07:07,636 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:07:07,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:07:07,638 INFO L85 PathProgramCache]: Analyzing trace with hash -1305180118, now seen corresponding path program 1 times [2025-03-04 04:07:07,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:07:07,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986673691] [2025-03-04 04:07:07,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:07:07,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:07:07,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-04 04:07:07,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-04 04:07:07,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:07:07,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:07:07,811 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 04:07:07,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:07:07,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986673691] [2025-03-04 04:07:07,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986673691] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:07:07,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:07:07,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 04:07:07,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018205319] [2025-03-04 04:07:07,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:07:07,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 04:07:07,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:07:07,815 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 04:07:07,815 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 04:07:07,815 INFO L87 Difference]: Start difference. First operand 554 states and 758 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-03-04 04:07:07,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:07:07,857 INFO L93 Difference]: Finished difference Result 559 states and 763 transitions. [2025-03-04 04:07:07,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 04:07:07,858 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-03-04 04:07:07,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:07:07,861 INFO L225 Difference]: With dead ends: 559 [2025-03-04 04:07:07,861 INFO L226 Difference]: Without dead ends: 555 [2025-03-04 04:07:07,861 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 04:07:07,862 INFO L435 NwaCegarLoop]: 493 mSDtfsCounter, 0 mSDsluCounter, 488 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 981 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-03-04 04:07:07,862 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 981 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 04:07:07,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2025-03-04 04:07:07,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 555. [2025-03-04 04:07:07,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 555 states, 418 states have (on average 1.3708133971291867) internal successors, (573), 429 states have internal predecessors, (573), 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-03-04 04:07:07,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 758 transitions. [2025-03-04 04:07:07,908 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 758 transitions. Word has length 55 [2025-03-04 04:07:07,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:07:07,908 INFO L471 AbstractCegarLoop]: Abstraction has 555 states and 758 transitions. [2025-03-04 04:07:07,908 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-03-04 04:07:07,908 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 758 transitions. [2025-03-04 04:07:07,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-04 04:07:07,910 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:07:07,910 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-03-04 04:07:07,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 04:07:07,912 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:07:07,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:07:07,913 INFO L85 PathProgramCache]: Analyzing trace with hash -134509526, now seen corresponding path program 1 times [2025-03-04 04:07:07,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:07:07,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739171452] [2025-03-04 04:07:07,913 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:07:07,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:07:07,940 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-04 04:07:07,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-04 04:07:07,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:07:07,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:07:08,181 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 04:07:08,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:07:08,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739171452] [2025-03-04 04:07:08,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739171452] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:07:08,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:07:08,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 04:07:08,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972711304] [2025-03-04 04:07:08,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:07:08,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 04:07:08,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:07:08,183 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 04:07:08,184 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 04:07:08,184 INFO L87 Difference]: Start difference. First operand 555 states and 758 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-03-04 04:07:08,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:07:08,273 INFO L93 Difference]: Finished difference Result 1550 states and 2170 transitions. [2025-03-04 04:07:08,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 04:07:08,273 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-03-04 04:07:08,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:07:08,283 INFO L225 Difference]: With dead ends: 1550 [2025-03-04 04:07:08,284 INFO L226 Difference]: Without dead ends: 991 [2025-03-04 04:07:08,285 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-03-04 04:07:08,286 INFO L435 NwaCegarLoop]: 495 mSDtfsCounter, 441 mSDsluCounter, 940 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 441 SdHoareTripleChecker+Valid, 1435 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-03-04 04:07:08,287 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [441 Valid, 1435 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 04:07:08,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 991 states. [2025-03-04 04:07:08,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 991 to 957. [2025-03-04 04:07:08,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 957 states, 734 states have (on average 1.4087193460490464) internal successors, (1034), 754 states have internal predecessors, (1034), 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-03-04 04:07:08,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 957 states to 957 states and 1342 transitions. [2025-03-04 04:07:08,337 INFO L78 Accepts]: Start accepts. Automaton has 957 states and 1342 transitions. Word has length 57 [2025-03-04 04:07:08,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:07:08,339 INFO L471 AbstractCegarLoop]: Abstraction has 957 states and 1342 transitions. [2025-03-04 04:07:08,339 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-03-04 04:07:08,339 INFO L276 IsEmpty]: Start isEmpty. Operand 957 states and 1342 transitions. [2025-03-04 04:07:08,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-04 04:07:08,343 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:07:08,343 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-03-04 04:07:08,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 04:07:08,343 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:07:08,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:07:08,344 INFO L85 PathProgramCache]: Analyzing trace with hash -1578928362, now seen corresponding path program 1 times [2025-03-04 04:07:08,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:07:08,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213306510] [2025-03-04 04:07:08,344 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:07:08,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:07:08,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-04 04:07:08,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-04 04:07:08,376 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:07:08,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:07:08,431 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 04:07:08,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:07:08,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213306510] [2025-03-04 04:07:08,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213306510] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:07:08,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:07:08,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 04:07:08,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193573397] [2025-03-04 04:07:08,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:07:08,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 04:07:08,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:07:08,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 04:07:08,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 04:07:08,433 INFO L87 Difference]: Start difference. First operand 957 states and 1342 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-03-04 04:07:08,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:07:08,535 INFO L93 Difference]: Finished difference Result 2719 states and 3806 transitions. [2025-03-04 04:07:08,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 04:07:08,535 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-03-04 04:07:08,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:07:08,544 INFO L225 Difference]: With dead ends: 2719 [2025-03-04 04:07:08,545 INFO L226 Difference]: Without dead ends: 1782 [2025-03-04 04:07:08,549 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 04:07:08,551 INFO L435 NwaCegarLoop]: 536 mSDtfsCounter, 441 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 441 SdHoareTripleChecker+Valid, 986 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 04:07:08,551 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [441 Valid, 986 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 04:07:08,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1782 states. [2025-03-04 04:07:08,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1782 to 1750. [2025-03-04 04:07:08,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1750 states, 1341 states have (on average 1.4049217002237135) internal successors, (1884), 1381 states have internal predecessors, (1884), 283 states have call successors, (283), 130 states have call predecessors, (283), 125 states have return successors, (280), 262 states have call predecessors, (280), 278 states have call successors, (280) [2025-03-04 04:07:08,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1750 states to 1750 states and 2447 transitions. [2025-03-04 04:07:08,652 INFO L78 Accepts]: Start accepts. Automaton has 1750 states and 2447 transitions. Word has length 72 [2025-03-04 04:07:08,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:07:08,653 INFO L471 AbstractCegarLoop]: Abstraction has 1750 states and 2447 transitions. [2025-03-04 04:07:08,653 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-03-04 04:07:08,653 INFO L276 IsEmpty]: Start isEmpty. Operand 1750 states and 2447 transitions. [2025-03-04 04:07:08,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-04 04:07:08,660 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:07:08,661 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-03-04 04:07:08,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 04:07:08,661 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:07:08,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:07:08,662 INFO L85 PathProgramCache]: Analyzing trace with hash -1375523646, now seen corresponding path program 1 times [2025-03-04 04:07:08,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:07:08,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786744332] [2025-03-04 04:07:08,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:07:08,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:07:08,688 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-04 04:07:08,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-04 04:07:08,704 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:07:08,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:07:08,764 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-04 04:07:08,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:07:08,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786744332] [2025-03-04 04:07:08,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786744332] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:07:08,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:07:08,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 04:07:08,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623235684] [2025-03-04 04:07:08,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:07:08,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 04:07:08,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:07:08,768 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 04:07:08,768 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 04:07:08,768 INFO L87 Difference]: Start difference. First operand 1750 states and 2447 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-03-04 04:07:08,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:07:08,829 INFO L93 Difference]: Finished difference Result 3484 states and 4879 transitions. [2025-03-04 04:07:08,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 04:07:08,829 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-03-04 04:07:08,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:07:08,840 INFO L225 Difference]: With dead ends: 3484 [2025-03-04 04:07:08,840 INFO L226 Difference]: Without dead ends: 1754 [2025-03-04 04:07:08,843 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 04:07:08,844 INFO L435 NwaCegarLoop]: 493 mSDtfsCounter, 0 mSDsluCounter, 488 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 981 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-03-04 04:07:08,844 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 981 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 04:07:08,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1754 states. [2025-03-04 04:07:08,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1754 to 1754. [2025-03-04 04:07:08,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1754 states, 1345 states have (on average 1.4037174721189591) internal successors, (1888), 1385 states have internal predecessors, (1888), 283 states have call successors, (283), 130 states have call predecessors, (283), 125 states have return successors, (280), 262 states have call predecessors, (280), 278 states have call successors, (280) [2025-03-04 04:07:08,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1754 states to 1754 states and 2451 transitions. [2025-03-04 04:07:08,925 INFO L78 Accepts]: Start accepts. Automaton has 1754 states and 2451 transitions. Word has length 76 [2025-03-04 04:07:08,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:07:08,925 INFO L471 AbstractCegarLoop]: Abstraction has 1754 states and 2451 transitions. [2025-03-04 04:07:08,925 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-03-04 04:07:08,925 INFO L276 IsEmpty]: Start isEmpty. Operand 1754 states and 2451 transitions. [2025-03-04 04:07:08,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-04 04:07:08,929 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:07:08,929 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-03-04 04:07:08,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 04:07:08,929 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:07:08,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:07:08,930 INFO L85 PathProgramCache]: Analyzing trace with hash 595415811, now seen corresponding path program 1 times [2025-03-04 04:07:08,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:07:08,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953701074] [2025-03-04 04:07:08,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:07:08,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:07:08,949 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-04 04:07:08,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-04 04:07:08,962 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:07:08,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:07:09,034 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-04 04:07:09,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:07:09,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953701074] [2025-03-04 04:07:09,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953701074] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:07:09,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:07:09,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 04:07:09,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283912771] [2025-03-04 04:07:09,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:07:09,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 04:07:09,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:07:09,035 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 04:07:09,035 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 04:07:09,035 INFO L87 Difference]: Start difference. First operand 1754 states and 2451 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-03-04 04:07:09,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:07:09,125 INFO L93 Difference]: Finished difference Result 3500 states and 4895 transitions. [2025-03-04 04:07:09,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 04:07:09,126 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-03-04 04:07:09,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:07:09,134 INFO L225 Difference]: With dead ends: 3500 [2025-03-04 04:07:09,134 INFO L226 Difference]: Without dead ends: 1706 [2025-03-04 04:07:09,137 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 04:07:09,138 INFO L435 NwaCegarLoop]: 492 mSDtfsCounter, 1 mSDsluCounter, 976 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1468 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-03-04 04:07:09,138 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1468 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 04:07:09,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1706 states. [2025-03-04 04:07:09,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1706 to 1702. [2025-03-04 04:07:09,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1702 states, 1313 states have (on average 1.4044173648134044) internal successors, (1844), 1353 states have internal predecessors, (1844), 263 states have call successors, (263), 130 states have call predecessors, (263), 125 states have return successors, (260), 242 states have call predecessors, (260), 258 states have call successors, (260) [2025-03-04 04:07:09,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1702 states to 1702 states and 2367 transitions. [2025-03-04 04:07:09,208 INFO L78 Accepts]: Start accepts. Automaton has 1702 states and 2367 transitions. Word has length 76 [2025-03-04 04:07:09,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:07:09,209 INFO L471 AbstractCegarLoop]: Abstraction has 1702 states and 2367 transitions. [2025-03-04 04:07:09,209 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-03-04 04:07:09,209 INFO L276 IsEmpty]: Start isEmpty. Operand 1702 states and 2367 transitions. [2025-03-04 04:07:09,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-04 04:07:09,211 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:07:09,211 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-03-04 04:07:09,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 04:07:09,211 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:07:09,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:07:09,211 INFO L85 PathProgramCache]: Analyzing trace with hash 1227747378, now seen corresponding path program 1 times [2025-03-04 04:07:09,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:07:09,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461793834] [2025-03-04 04:07:09,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:07:09,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:07:09,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-04 04:07:09,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-04 04:07:09,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:07:09,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:07:09,277 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 04:07:09,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:07:09,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461793834] [2025-03-04 04:07:09,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461793834] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:07:09,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:07:09,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 04:07:09,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697406907] [2025-03-04 04:07:09,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:07:09,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 04:07:09,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:07:09,279 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 04:07:09,280 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 04:07:09,280 INFO L87 Difference]: Start difference. First operand 1702 states and 2367 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-03-04 04:07:09,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:07:09,410 INFO L93 Difference]: Finished difference Result 4771 states and 6619 transitions. [2025-03-04 04:07:09,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 04:07:09,411 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-03-04 04:07:09,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:07:09,423 INFO L225 Difference]: With dead ends: 4771 [2025-03-04 04:07:09,423 INFO L226 Difference]: Without dead ends: 3089 [2025-03-04 04:07:09,426 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 04:07:09,427 INFO L435 NwaCegarLoop]: 556 mSDtfsCounter, 415 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 415 SdHoareTripleChecker+Valid, 986 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 04:07:09,427 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [415 Valid, 986 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 04:07:09,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3089 states. [2025-03-04 04:07:09,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3089 to 3057. [2025-03-04 04:07:09,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3057 states, 2355 states have (on average 1.3995753715498938) internal successors, (3296), 2431 states have internal predecessors, (3296), 468 states have call successors, (468), 238 states have call predecessors, (468), 233 states have return successors, (467), 431 states have call predecessors, (467), 463 states have call successors, (467) [2025-03-04 04:07:09,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3057 states to 3057 states and 4231 transitions. [2025-03-04 04:07:09,519 INFO L78 Accepts]: Start accepts. Automaton has 3057 states and 4231 transitions. Word has length 78 [2025-03-04 04:07:09,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:07:09,519 INFO L471 AbstractCegarLoop]: Abstraction has 3057 states and 4231 transitions. [2025-03-04 04:07:09,519 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-03-04 04:07:09,520 INFO L276 IsEmpty]: Start isEmpty. Operand 3057 states and 4231 transitions. [2025-03-04 04:07:09,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-04 04:07:09,523 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:07:09,523 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-03-04 04:07:09,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 04:07:09,523 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:07:09,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:07:09,524 INFO L85 PathProgramCache]: Analyzing trace with hash 1789477608, now seen corresponding path program 1 times [2025-03-04 04:07:09,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:07:09,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462855928] [2025-03-04 04:07:09,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:07:09,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:07:09,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-04 04:07:09,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-04 04:07:09,550 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:07:09,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:07:09,643 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-04 04:07:09,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:07:09,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462855928] [2025-03-04 04:07:09,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462855928] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:07:09,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:07:09,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 04:07:09,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791171500] [2025-03-04 04:07:09,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:07:09,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 04:07:09,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:07:09,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 04:07:09,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 04:07:09,645 INFO L87 Difference]: Start difference. First operand 3057 states and 4231 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-03-04 04:07:09,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:07:09,765 INFO L93 Difference]: Finished difference Result 6094 states and 8439 transitions. [2025-03-04 04:07:09,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 04:07:09,766 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-03-04 04:07:09,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:07:09,780 INFO L225 Difference]: With dead ends: 6094 [2025-03-04 04:07:09,780 INFO L226 Difference]: Without dead ends: 3057 [2025-03-04 04:07:09,787 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 04:07:09,787 INFO L435 NwaCegarLoop]: 472 mSDtfsCounter, 452 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 452 SdHoareTripleChecker+Valid, 472 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-03-04 04:07:09,787 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [452 Valid, 472 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 04:07:09,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3057 states. [2025-03-04 04:07:09,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3057 to 3057. [2025-03-04 04:07:09,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3057 states, 2355 states have (on average 1.3961783439490445) internal successors, (3288), 2431 states have internal predecessors, (3288), 468 states have call successors, (468), 238 states have call predecessors, (468), 233 states have return successors, (467), 431 states have call predecessors, (467), 463 states have call successors, (467) [2025-03-04 04:07:09,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3057 states to 3057 states and 4223 transitions. [2025-03-04 04:07:09,925 INFO L78 Accepts]: Start accepts. Automaton has 3057 states and 4223 transitions. Word has length 123 [2025-03-04 04:07:09,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:07:09,925 INFO L471 AbstractCegarLoop]: Abstraction has 3057 states and 4223 transitions. [2025-03-04 04:07:09,925 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-03-04 04:07:09,926 INFO L276 IsEmpty]: Start isEmpty. Operand 3057 states and 4223 transitions. [2025-03-04 04:07:09,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-04 04:07:09,929 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:07:09,929 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-03-04 04:07:09,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 04:07:09,929 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:07:09,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:07:09,930 INFO L85 PathProgramCache]: Analyzing trace with hash 425058219, now seen corresponding path program 1 times [2025-03-04 04:07:09,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:07:09,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720402851] [2025-03-04 04:07:09,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:07:09,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:07:09,956 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-04 04:07:09,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-04 04:07:09,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:07:09,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:07:10,040 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 04:07:10,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:07:10,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720402851] [2025-03-04 04:07:10,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720402851] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:07:10,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:07:10,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 04:07:10,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792345725] [2025-03-04 04:07:10,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:07:10,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 04:07:10,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:07:10,042 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 04:07:10,042 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 04:07:10,042 INFO L87 Difference]: Start difference. First operand 3057 states and 4223 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-03-04 04:07:10,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:07:10,211 INFO L93 Difference]: Finished difference Result 7666 states and 10623 transitions. [2025-03-04 04:07:10,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 04:07:10,212 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-03-04 04:07:10,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:07:10,229 INFO L225 Difference]: With dead ends: 7666 [2025-03-04 04:07:10,229 INFO L226 Difference]: Without dead ends: 4629 [2025-03-04 04:07:10,234 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 04:07:10,235 INFO L435 NwaCegarLoop]: 790 mSDtfsCounter, 422 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 422 SdHoareTripleChecker+Valid, 1233 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 04:07:10,235 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [422 Valid, 1233 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 04:07:10,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4629 states. [2025-03-04 04:07:10,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4629 to 4593. [2025-03-04 04:07:10,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4593 states, 3557 states have (on average 1.3910598819229687) internal successors, (4948), 3673 states have internal predecessors, (4948), 687 states have call successors, (687), 353 states have call predecessors, (687), 348 states have return successors, (688), 634 states have call predecessors, (688), 682 states have call successors, (688) [2025-03-04 04:07:10,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4593 states to 4593 states and 6323 transitions. [2025-03-04 04:07:10,392 INFO L78 Accepts]: Start accepts. Automaton has 4593 states and 6323 transitions. Word has length 126 [2025-03-04 04:07:10,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:07:10,393 INFO L471 AbstractCegarLoop]: Abstraction has 4593 states and 6323 transitions. [2025-03-04 04:07:10,393 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-03-04 04:07:10,394 INFO L276 IsEmpty]: Start isEmpty. Operand 4593 states and 6323 transitions. [2025-03-04 04:07:10,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-04 04:07:10,400 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:07:10,400 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-03-04 04:07:10,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 04:07:10,400 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:07:10,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:07:10,401 INFO L85 PathProgramCache]: Analyzing trace with hash -1898796017, now seen corresponding path program 1 times [2025-03-04 04:07:10,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:07:10,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957426149] [2025-03-04 04:07:10,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:07:10,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:07:10,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-04 04:07:10,443 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-04 04:07:10,443 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:07:10,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:07:10,542 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 04:07:10,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:07:10,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957426149] [2025-03-04 04:07:10,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957426149] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:07:10,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:07:10,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 04:07:10,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652412521] [2025-03-04 04:07:10,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:07:10,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 04:07:10,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:07:10,543 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 04:07:10,543 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 04:07:10,543 INFO L87 Difference]: Start difference. First operand 4593 states and 6323 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-03-04 04:07:10,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:07:10,770 INFO L93 Difference]: Finished difference Result 11501 states and 15886 transitions. [2025-03-04 04:07:10,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 04:07:10,770 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-03-04 04:07:10,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:07:10,802 INFO L225 Difference]: With dead ends: 11501 [2025-03-04 04:07:10,802 INFO L226 Difference]: Without dead ends: 6928 [2025-03-04 04:07:10,812 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 04:07:10,812 INFO L435 NwaCegarLoop]: 784 mSDtfsCounter, 416 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 416 SdHoareTripleChecker+Valid, 1227 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 04:07:10,813 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [416 Valid, 1227 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 04:07:10,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6928 states. [2025-03-04 04:07:11,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6928 to 6890. [2025-03-04 04:07:11,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6890 states, 5362 states have (on average 1.3864229765013054) internal successors, (7434), 5538 states have internal predecessors, (7434), 1008 states have call successors, (1008), 524 states have call predecessors, (1008), 519 states have return successors, (1012), 931 states have call predecessors, (1012), 1003 states have call successors, (1012) [2025-03-04 04:07:11,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6890 states to 6890 states and 9454 transitions. [2025-03-04 04:07:11,121 INFO L78 Accepts]: Start accepts. Automaton has 6890 states and 9454 transitions. Word has length 132 [2025-03-04 04:07:11,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:07:11,121 INFO L471 AbstractCegarLoop]: Abstraction has 6890 states and 9454 transitions. [2025-03-04 04:07:11,122 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-03-04 04:07:11,122 INFO L276 IsEmpty]: Start isEmpty. Operand 6890 states and 9454 transitions. [2025-03-04 04:07:11,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-04 04:07:11,128 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:07:11,128 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-03-04 04:07:11,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 04:07:11,129 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:07:11,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:07:11,129 INFO L85 PathProgramCache]: Analyzing trace with hash 2026433195, now seen corresponding path program 1 times [2025-03-04 04:07:11,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:07:11,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959071648] [2025-03-04 04:07:11,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:07:11,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:07:11,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-04 04:07:11,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-04 04:07:11,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:07:11,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:07:11,273 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 8 proven. 13 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-04 04:07:11,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:07:11,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959071648] [2025-03-04 04:07:11,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959071648] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 04:07:11,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1424071736] [2025-03-04 04:07:11,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:07:11,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 04:07:11,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 04:07:11,276 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 04:07:11,278 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 04:07:11,486 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-04 04:07:11,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-04 04:07:11,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:07:11,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:07:11,601 INFO L256 TraceCheckSpWp]: Trace formula consists of 1088 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 04:07:11,607 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 04:07:11,660 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-04 04:07:11,660 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 04:07:11,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1424071736] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:07:11,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 04:07:11,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 7 [2025-03-04 04:07:11,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541564846] [2025-03-04 04:07:11,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:07:11,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 04:07:11,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:07:11,661 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 04:07:11,661 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 04:07:11,661 INFO L87 Difference]: Start difference. First operand 6890 states and 9454 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-03-04 04:07:11,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:07:11,860 INFO L93 Difference]: Finished difference Result 13868 states and 19047 transitions. [2025-03-04 04:07:11,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 04:07:11,860 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-03-04 04:07:11,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:07:11,899 INFO L225 Difference]: With dead ends: 13868 [2025-03-04 04:07:11,900 INFO L226 Difference]: Without dead ends: 6836 [2025-03-04 04:07:11,914 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-03-04 04:07:11,915 INFO L435 NwaCegarLoop]: 470 mSDtfsCounter, 1 mSDsluCounter, 1385 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1855 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-03-04 04:07:11,915 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1855 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 04:07:11,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6836 states. [2025-03-04 04:07:12,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6836 to 6836. [2025-03-04 04:07:12,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6836 states, 5308 states have (on average 1.383571966842502) internal successors, (7344), 5493 states have internal predecessors, (7344), 1008 states have call successors, (1008), 524 states have call predecessors, (1008), 519 states have return successors, (1003), 922 states have call predecessors, (1003), 994 states have call successors, (1003) [2025-03-04 04:07:12,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6836 states to 6836 states and 9355 transitions. [2025-03-04 04:07:12,143 INFO L78 Accepts]: Start accepts. Automaton has 6836 states and 9355 transitions. Word has length 136 [2025-03-04 04:07:12,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:07:12,144 INFO L471 AbstractCegarLoop]: Abstraction has 6836 states and 9355 transitions. [2025-03-04 04:07:12,144 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-03-04 04:07:12,144 INFO L276 IsEmpty]: Start isEmpty. Operand 6836 states and 9355 transitions. [2025-03-04 04:07:12,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-03-04 04:07:12,151 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:07:12,151 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-03-04 04:07:12,159 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 04:07:12,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-04 04:07:12,355 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:07:12,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:07:12,356 INFO L85 PathProgramCache]: Analyzing trace with hash 629114955, now seen corresponding path program 1 times [2025-03-04 04:07:12,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:07:12,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115434734] [2025-03-04 04:07:12,356 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:07:12,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:07:12,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-04 04:07:12,392 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-04 04:07:12,392 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:07:12,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:07:12,458 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-04 04:07:12,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:07:12,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115434734] [2025-03-04 04:07:12,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115434734] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:07:12,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:07:12,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 04:07:12,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767239246] [2025-03-04 04:07:12,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:07:12,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 04:07:12,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:07:12,459 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 04:07:12,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 04:07:12,459 INFO L87 Difference]: Start difference. First operand 6836 states and 9355 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-03-04 04:07:12,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:07:12,629 INFO L93 Difference]: Finished difference Result 13616 states and 18633 transitions. [2025-03-04 04:07:12,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 04:07:12,630 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-03-04 04:07:12,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:07:12,657 INFO L225 Difference]: With dead ends: 13616 [2025-03-04 04:07:12,657 INFO L226 Difference]: Without dead ends: 6800 [2025-03-04 04:07:12,671 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 04:07:12,671 INFO L435 NwaCegarLoop]: 468 mSDtfsCounter, 438 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 438 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-03-04 04:07:12,671 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [438 Valid, 468 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 04:07:12,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6800 states. [2025-03-04 04:07:12,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6800 to 6800. [2025-03-04 04:07:12,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6800 states, 5272 states have (on average 1.3793626707132018) internal successors, (7272), 5457 states have internal predecessors, (7272), 1008 states have call successors, (1008), 524 states have call predecessors, (1008), 519 states have return successors, (1003), 922 states have call predecessors, (1003), 994 states have call successors, (1003) [2025-03-04 04:07:12,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6800 states to 6800 states and 9283 transitions. [2025-03-04 04:07:12,904 INFO L78 Accepts]: Start accepts. Automaton has 6800 states and 9283 transitions. Word has length 138 [2025-03-04 04:07:12,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:07:12,905 INFO L471 AbstractCegarLoop]: Abstraction has 6800 states and 9283 transitions. [2025-03-04 04:07:12,905 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-03-04 04:07:12,905 INFO L276 IsEmpty]: Start isEmpty. Operand 6800 states and 9283 transitions. [2025-03-04 04:07:12,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-04 04:07:12,910 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:07:12,910 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-03-04 04:07:12,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 04:07:12,911 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:07:12,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:07:12,911 INFO L85 PathProgramCache]: Analyzing trace with hash -1442451023, now seen corresponding path program 1 times [2025-03-04 04:07:12,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:07:12,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263727806] [2025-03-04 04:07:12,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:07:12,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:07:12,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-04 04:07:12,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-04 04:07:12,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:07:12,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:07:13,063 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 8 proven. 13 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-04 04:07:13,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:07:13,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263727806] [2025-03-04 04:07:13,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263727806] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 04:07:13,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1742353702] [2025-03-04 04:07:13,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:07:13,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 04:07:13,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 04:07:13,066 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 04:07:13,068 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 04:07:13,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-04 04:07:13,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-04 04:07:13,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:07:13,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:07:13,393 INFO L256 TraceCheckSpWp]: Trace formula consists of 1099 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 04:07:13,398 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 04:07:13,507 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-04 04:07:13,507 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 04:07:13,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1742353702] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:07:13,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 04:07:13,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2025-03-04 04:07:13,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017851609] [2025-03-04 04:07:13,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:07:13,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 04:07:13,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:07:13,508 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 04:07:13,508 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 04:07:13,509 INFO L87 Difference]: Start difference. First operand 6800 states and 9283 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-03-04 04:07:14,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:07:14,207 INFO L93 Difference]: Finished difference Result 20334 states and 27771 transitions. [2025-03-04 04:07:14,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 04:07:14,207 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-03-04 04:07:14,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:07:14,264 INFO L225 Difference]: With dead ends: 20334 [2025-03-04 04:07:14,264 INFO L226 Difference]: Without dead ends: 20302 [2025-03-04 04:07:14,271 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-03-04 04:07:14,272 INFO L435 NwaCegarLoop]: 823 mSDtfsCounter, 811 mSDsluCounter, 835 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 811 SdHoareTripleChecker+Valid, 1658 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.3s IncrementalHoareTripleChecker+Time [2025-03-04 04:07:14,272 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [811 Valid, 1658 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 04:07:14,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20302 states. [2025-03-04 04:07:14,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20302 to 20152. [2025-03-04 04:07:14,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20152 states, 15602 states have (on average 1.3833482886809383) internal successors, (21583), 16157 states have internal predecessors, (21583), 3000 states have call successors, (3000), 1554 states have call predecessors, (3000), 1549 states have return successors, (2995), 2752 states have call predecessors, (2995), 2968 states have call successors, (2995) [2025-03-04 04:07:14,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20152 states to 20152 states and 27578 transitions. [2025-03-04 04:07:14,860 INFO L78 Accepts]: Start accepts. Automaton has 20152 states and 27578 transitions. Word has length 139 [2025-03-04 04:07:14,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:07:14,860 INFO L471 AbstractCegarLoop]: Abstraction has 20152 states and 27578 transitions. [2025-03-04 04:07:14,860 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-03-04 04:07:14,860 INFO L276 IsEmpty]: Start isEmpty. Operand 20152 states and 27578 transitions. [2025-03-04 04:07:14,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-04 04:07:14,878 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:07:14,878 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-03-04 04:07:14,886 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 04:07:15,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-04 04:07:15,079 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:07:15,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:07:15,080 INFO L85 PathProgramCache]: Analyzing trace with hash -1913220436, now seen corresponding path program 1 times [2025-03-04 04:07:15,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:07:15,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733220035] [2025-03-04 04:07:15,080 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:07:15,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:07:15,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-04 04:07:15,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-04 04:07:15,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:07:15,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:07:15,206 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-04 04:07:15,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:07:15,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733220035] [2025-03-04 04:07:15,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733220035] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:07:15,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:07:15,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 04:07:15,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331048586] [2025-03-04 04:07:15,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:07:15,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 04:07:15,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:07:15,208 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 04:07:15,208 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 04:07:15,208 INFO L87 Difference]: Start difference. First operand 20152 states and 27578 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-03-04 04:07:15,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:07:15,435 INFO L93 Difference]: Finished difference Result 26650 states and 36633 transitions. [2025-03-04 04:07:15,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 04:07:15,435 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-03-04 04:07:15,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:07:15,460 INFO L225 Difference]: With dead ends: 26650 [2025-03-04 04:07:15,460 INFO L226 Difference]: Without dead ends: 6331 [2025-03-04 04:07:15,493 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 04:07:15,493 INFO L435 NwaCegarLoop]: 578 mSDtfsCounter, 243 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 893 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 04:07:15,494 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 893 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 04:07:15,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6331 states. [2025-03-04 04:07:15,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6331 to 6331. [2025-03-04 04:07:15,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6331 states, 5063 states have (on average 1.4033181907959709) internal successors, (7105), 5186 states have internal predecessors, (7105), 804 states have call successors, (804), 468 states have call predecessors, (804), 463 states have return successors, (799), 784 states have call predecessors, (799), 799 states have call successors, (799) [2025-03-04 04:07:15,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6331 states to 6331 states and 8708 transitions. [2025-03-04 04:07:15,650 INFO L78 Accepts]: Start accepts. Automaton has 6331 states and 8708 transitions. Word has length 148 [2025-03-04 04:07:15,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:07:15,651 INFO L471 AbstractCegarLoop]: Abstraction has 6331 states and 8708 transitions. [2025-03-04 04:07:15,651 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-03-04 04:07:15,651 INFO L276 IsEmpty]: Start isEmpty. Operand 6331 states and 8708 transitions. [2025-03-04 04:07:15,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-04 04:07:15,662 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:07:15,662 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-03-04 04:07:15,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 04:07:15,663 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:07:15,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:07:15,663 INFO L85 PathProgramCache]: Analyzing trace with hash -677435229, now seen corresponding path program 1 times [2025-03-04 04:07:15,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:07:15,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726679339] [2025-03-04 04:07:15,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:07:15,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:07:15,686 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-04 04:07:15,711 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-04 04:07:15,711 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:07:15,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:07:15,834 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-04 04:07:15,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:07:15,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726679339] [2025-03-04 04:07:15,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726679339] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:07:15,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:07:15,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 04:07:15,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163888131] [2025-03-04 04:07:15,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:07:15,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 04:07:15,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:07:15,835 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 04:07:15,835 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 04:07:15,835 INFO L87 Difference]: Start difference. First operand 6331 states and 8708 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-03-04 04:07:16,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:07:16,076 INFO L93 Difference]: Finished difference Result 12684 states and 17459 transitions. [2025-03-04 04:07:16,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 04:07:16,077 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-03-04 04:07:16,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:07:16,099 INFO L225 Difference]: With dead ends: 12684 [2025-03-04 04:07:16,100 INFO L226 Difference]: Without dead ends: 6373 [2025-03-04 04:07:16,109 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 04:07:16,110 INFO L435 NwaCegarLoop]: 450 mSDtfsCounter, 8 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 890 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-03-04 04:07:16,110 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 890 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 04:07:16,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6373 states. [2025-03-04 04:07:16,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6373 to 6334. [2025-03-04 04:07:16,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6334 states, 5066 states have (on average 1.4030793525463876) internal successors, (7108), 5189 states have internal predecessors, (7108), 804 states have call successors, (804), 468 states have call predecessors, (804), 463 states have return successors, (799), 784 states have call predecessors, (799), 799 states have call successors, (799) [2025-03-04 04:07:16,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6334 states to 6334 states and 8711 transitions. [2025-03-04 04:07:16,369 INFO L78 Accepts]: Start accepts. Automaton has 6334 states and 8711 transitions. Word has length 148 [2025-03-04 04:07:16,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:07:16,370 INFO L471 AbstractCegarLoop]: Abstraction has 6334 states and 8711 transitions. [2025-03-04 04:07:16,370 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-03-04 04:07:16,370 INFO L276 IsEmpty]: Start isEmpty. Operand 6334 states and 8711 transitions. [2025-03-04 04:07:16,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-04 04:07:16,383 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:07:16,383 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-03-04 04:07:16,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 04:07:16,383 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:07:16,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:07:16,384 INFO L85 PathProgramCache]: Analyzing trace with hash 577710591, now seen corresponding path program 1 times [2025-03-04 04:07:16,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:07:16,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410998463] [2025-03-04 04:07:16,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:07:16,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:07:16,410 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-04 04:07:16,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-04 04:07:16,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:07:16,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:07:16,737 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-04 04:07:16,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:07:16,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410998463] [2025-03-04 04:07:16,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410998463] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:07:16,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:07:16,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 04:07:16,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033765282] [2025-03-04 04:07:16,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:07:16,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 04:07:16,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:07:16,738 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 04:07:16,738 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 04:07:16,738 INFO L87 Difference]: Start difference. First operand 6334 states and 8711 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-03-04 04:07:16,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:07:16,840 INFO L93 Difference]: Finished difference Result 6914 states and 9453 transitions. [2025-03-04 04:07:16,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 04:07:16,841 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-03-04 04:07:16,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:07:16,850 INFO L225 Difference]: With dead ends: 6914 [2025-03-04 04:07:16,850 INFO L226 Difference]: Without dead ends: 0 [2025-03-04 04:07:16,858 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-04 04:07:16,858 INFO L435 NwaCegarLoop]: 259 mSDtfsCounter, 262 mSDsluCounter, 514 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 773 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-03-04 04:07:16,859 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 773 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 04:07:16,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-04 04:07:16,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-04 04:07:16,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 04:07:16,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-04 04:07:16,866 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 150 [2025-03-04 04:07:16,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:07:16,866 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 04:07:16,866 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-03-04 04:07:16,866 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-04 04:07:16,866 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-04 04:07:16,868 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-04 04:07:16,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 04:07:16,870 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 04:07:16,872 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-04 04:07:21,207 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 04:07:21,218 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 04:07:21 BoogieIcfgContainer [2025-03-04 04:07:21,218 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 04:07:21,219 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 04:07:21,219 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 04:07:21,219 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 04:07:21,219 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 04:07:06" (3/4) ... [2025-03-04 04:07:21,220 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-04 04:07:21,224 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure _torture_stop_kthread [2025-03-04 04:07:21,224 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure kfree [2025-03-04 04:07:21,224 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure torture_lock_busted_write_delay [2025-03-04 04:07:21,224 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure printk [2025-03-04 04:07:21,224 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure torture_lock_spin_write_unlock_irq [2025-03-04 04:07:21,224 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure __const_udelay [2025-03-04 04:07:21,224 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure ldv_error [2025-03-04 04:07:21,224 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure torture_lock_busted_write_lock [2025-03-04 04:07:21,224 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure kmalloc [2025-03-04 04:07:21,224 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure torture_random [2025-03-04 04:07:21,224 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure ldv_stop [2025-03-04 04:07:21,224 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure lock_torture_stats_print [2025-03-04 04:07:21,224 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure torture_lock_busted_write_unlock [2025-03-04 04:07:21,224 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure lock_torture_print_module_parms [2025-03-04 04:07:21,224 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure torture_spin_lock_write_delay [2025-03-04 04:07:21,224 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure lock_torture_cleanup [2025-03-04 04:07:21,224 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure torture_init_end [2025-03-04 04:07:21,224 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2025-03-04 04:07:21,224 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure ldv_spin_unlock [2025-03-04 04:07:21,224 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure ldv_spin_lock [2025-03-04 04:07:21,224 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure torture_spin_lock_write_lock_irq [2025-03-04 04:07:21,224 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2025-03-04 04:07:21,224 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure _torture_create_kthread [2025-03-04 04:07:21,224 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure torture_spin_lock_write_lock [2025-03-04 04:07:21,224 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure ##fun~~TO~VOID [2025-03-04 04:07:21,224 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure ldv_zalloc [2025-03-04 04:07:21,224 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure torture_spin_lock_write_unlock [2025-03-04 04:07:21,225 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure ldv_check_alloc_flags [2025-03-04 04:07:21,236 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 107 nodes and edges [2025-03-04 04:07:21,237 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 43 nodes and edges [2025-03-04 04:07:21,238 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2025-03-04 04:07:21,241 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-04 04:07:21,242 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-03-04 04:07:21,243 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-04 04:07:21,243 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-04 04:07:21,343 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 04:07:21,344 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 04:07:21,344 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 04:07:21,345 INFO L158 Benchmark]: Toolchain (without parser) took 16279.57ms. Allocated memory was 167.8MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 129.8MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 388.3MB. Max. memory is 16.1GB. [2025-03-04 04:07:21,345 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 129.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 04:07:21,345 INFO L158 Benchmark]: CACSL2BoogieTranslator took 603.98ms. Allocated memory is still 167.8MB. Free memory was 129.8MB in the beginning and 83.2MB in the end (delta: 46.6MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-03-04 04:07:21,346 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.57ms. Allocated memory is still 167.8MB. Free memory was 83.2MB in the beginning and 77.7MB in the end (delta: 5.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 04:07:21,346 INFO L158 Benchmark]: Boogie Preprocessor took 116.46ms. Allocated memory is still 167.8MB. Free memory was 77.7MB in the beginning and 68.8MB in the end (delta: 8.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 04:07:21,346 INFO L158 Benchmark]: IcfgBuilder took 970.43ms. Allocated memory is still 167.8MB. Free memory was 68.8MB in the beginning and 64.0MB in the end (delta: 4.8MB). Peak memory consumption was 38.0MB. Max. memory is 16.1GB. [2025-03-04 04:07:21,346 INFO L158 Benchmark]: TraceAbstraction took 14394.94ms. Allocated memory was 167.8MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 63.2MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. [2025-03-04 04:07:21,346 INFO L158 Benchmark]: Witness Printer took 125.97ms. Allocated memory is still 1.7GB. Free memory was 1.3GB in the beginning and 1.2GB in the end (delta: 20.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 04:07:21,348 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.21ms. Allocated memory is still 201.3MB. Free memory is still 129.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 603.98ms. Allocated memory is still 167.8MB. Free memory was 129.8MB in the beginning and 83.2MB in the end (delta: 46.6MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 61.57ms. Allocated memory is still 167.8MB. Free memory was 83.2MB in the beginning and 77.7MB in the end (delta: 5.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 116.46ms. Allocated memory is still 167.8MB. Free memory was 77.7MB in the beginning and 68.8MB in the end (delta: 8.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * IcfgBuilder took 970.43ms. Allocated memory is still 167.8MB. Free memory was 68.8MB in the beginning and 64.0MB in the end (delta: 4.8MB). Peak memory consumption was 38.0MB. Max. memory is 16.1GB. * TraceAbstraction took 14394.94ms. Allocated memory was 167.8MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 63.2MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. * Witness Printer took 125.97ms. Allocated memory is still 1.7GB. Free memory was 1.3GB in the beginning and 1.2GB in the end (delta: 20.7MB). 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: 10.0s, OverallIterations: 16, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 3.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4832 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4827 mSDsluCounter, 17206 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8516 mSDsCounter, 51 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 427 IncrementalHoareTripleChecker+Invalid, 478 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 51 mSolverCounterUnsat, 8690 mSDtfsCounter, 427 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=20152occurred 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: 2.5s AutomataMinimizationTime, 16 MinimizatonAttempts, 368 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.0s 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-03-04 04:07:21,361 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE