./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-pthread/cs_stack-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-pthread/cs_stack-2.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0a870e8a4a7dff1b238c9b19b47586f7abd44e3f0eb9969b7dad7bbd7f80e506 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 16:52:41,750 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 16:52:41,788 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 16:52:41,791 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 16:52:41,791 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 16:52:41,804 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 16:52:41,805 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 16:52:41,805 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 16:52:41,805 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 16:52:41,805 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 16:52:41,805 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 16:52:41,805 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 16:52:41,806 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 16:52:41,806 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 16:52:41,806 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 16:52:41,806 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 16:52:41,806 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 16:52:41,806 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 16:52:41,806 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 16:52:41,806 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 16:52:41,806 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 16:52:41,806 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 16:52:41,806 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 16:52:41,806 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 16:52:41,806 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 16:52:41,806 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 16:52:41,806 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 16:52:41,806 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 16:52:41,806 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 16:52:41,806 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 16:52:41,807 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 16:52:41,807 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 16:52:41,807 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 16:52:41,807 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 16:52:41,807 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 16:52:41,807 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 16:52:41,807 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 16:52:41,807 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 16:52:41,807 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 16:52:41,807 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 16:52:41,807 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 16:52:41,807 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 16:52:41,807 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 16:52:41,807 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0a870e8a4a7dff1b238c9b19b47586f7abd44e3f0eb9969b7dad7bbd7f80e506 [2025-02-05 16:52:41,996 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 16:52:42,001 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 16:52:42,004 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 16:52:42,005 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 16:52:42,005 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 16:52:42,007 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-pthread/cs_stack-2.i [2025-02-05 16:52:43,147 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/dac9af5c0/a1fa91e4f46449f6ad1a81baf3adc388/FLAGe07635c70 [2025-02-05 16:52:43,530 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 16:52:43,531 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_stack-2.i [2025-02-05 16:52:43,549 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/dac9af5c0/a1fa91e4f46449f6ad1a81baf3adc388/FLAGe07635c70 [2025-02-05 16:52:43,563 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/dac9af5c0/a1fa91e4f46449f6ad1a81baf3adc388 [2025-02-05 16:52:43,566 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 16:52:43,567 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 16:52:43,569 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 16:52:43,569 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 16:52:43,572 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 16:52:43,573 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:52:43" (1/1) ... [2025-02-05 16:52:43,574 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e4c691 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:52:43, skipping insertion in model container [2025-02-05 16:52:43,574 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:52:43" (1/1) ... [2025-02-05 16:52:43,608 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 16:52:43,890 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_stack-2.i[34556,34569] [2025-02-05 16:52:43,971 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 16:52:43,985 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 16:52:44,030 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_stack-2.i[34556,34569] [2025-02-05 16:52:44,059 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 16:52:44,109 INFO L204 MainTranslator]: Completed translation [2025-02-05 16:52:44,109 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:52:44 WrapperNode [2025-02-05 16:52:44,110 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 16:52:44,111 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 16:52:44,111 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 16:52:44,111 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 16:52:44,115 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:52:44" (1/1) ... [2025-02-05 16:52:44,138 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:52:44" (1/1) ... [2025-02-05 16:52:44,167 INFO L138 Inliner]: procedures = 252, calls = 297, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 644 [2025-02-05 16:52:44,168 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 16:52:44,168 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 16:52:44,168 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 16:52:44,168 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 16:52:44,176 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:52:44" (1/1) ... [2025-02-05 16:52:44,177 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:52:44" (1/1) ... [2025-02-05 16:52:44,185 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:52:44" (1/1) ... [2025-02-05 16:52:44,215 INFO L175 MemorySlicer]: Split 148 memory accesses to 18 slices as follows [2, 0, 8, 8, 8, 22, 20, 12, 10, 6, 4, 6, 8, 4, 20, 2, 2, 6]. 15 percent of accesses are in the largest equivalence class. The 51 initializations are split as follows [2, 0, 3, 3, 3, 10, 6, 6, 2, 0, 0, 2, 2, 2, 10, 0, 0, 0]. The 33 writes are split as follows [0, 0, 2, 2, 2, 6, 8, 3, 3, 0, 2, 2, 3, 0, 0, 0, 0, 0]. [2025-02-05 16:52:44,215 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:52:44" (1/1) ... [2025-02-05 16:52:44,216 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:52:44" (1/1) ... [2025-02-05 16:52:44,254 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:52:44" (1/1) ... [2025-02-05 16:52:44,259 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:52:44" (1/1) ... [2025-02-05 16:52:44,267 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:52:44" (1/1) ... [2025-02-05 16:52:44,276 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:52:44" (1/1) ... [2025-02-05 16:52:44,286 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 16:52:44,289 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 16:52:44,289 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 16:52:44,289 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 16:52:44,290 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:52:44" (1/1) ... [2025-02-05 16:52:44,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 16:52:44,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:52:44,317 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 16:52:44,320 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 16:52:44,337 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 16:52:44,337 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 16:52:44,337 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-05 16:52:44,337 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_lock [2025-02-05 16:52:44,338 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_lock [2025-02-05 16:52:44,338 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-05 16:52:44,338 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-05 16:52:44,338 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-05 16:52:44,339 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-02-05 16:52:44,339 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-02-05 16:52:44,339 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-02-05 16:52:44,339 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-02-05 16:52:44,339 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-02-05 16:52:44,339 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-02-05 16:52:44,339 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-02-05 16:52:44,339 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-02-05 16:52:44,339 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-02-05 16:52:44,339 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-02-05 16:52:44,339 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-02-05 16:52:44,339 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2025-02-05 16:52:44,339 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#15 [2025-02-05 16:52:44,339 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#16 [2025-02-05 16:52:44,339 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#17 [2025-02-05 16:52:44,339 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-05 16:52:44,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-02-05 16:52:44,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-02-05 16:52:44,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-02-05 16:52:44,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-02-05 16:52:44,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-02-05 16:52:44,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-02-05 16:52:44,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-02-05 16:52:44,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2025-02-05 16:52:44,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2025-02-05 16:52:44,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2025-02-05 16:52:44,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2025-02-05 16:52:44,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2025-02-05 16:52:44,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2025-02-05 16:52:44,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2025-02-05 16:52:44,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#14 [2025-02-05 16:52:44,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#15 [2025-02-05 16:52:44,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#16 [2025-02-05 16:52:44,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#17 [2025-02-05 16:52:44,340 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_unlock [2025-02-05 16:52:44,340 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_unlock [2025-02-05 16:52:44,340 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-05 16:52:44,341 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-05 16:52:44,341 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-05 16:52:44,341 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-05 16:52:44,341 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-02-05 16:52:44,341 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-02-05 16:52:44,341 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-02-05 16:52:44,341 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-02-05 16:52:44,341 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-02-05 16:52:44,341 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-02-05 16:52:44,341 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-02-05 16:52:44,341 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-02-05 16:52:44,341 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-02-05 16:52:44,341 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-02-05 16:52:44,341 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-02-05 16:52:44,341 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2025-02-05 16:52:44,341 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2025-02-05 16:52:44,341 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#17 [2025-02-05 16:52:44,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-05 16:52:44,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-05 16:52:44,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-05 16:52:44,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-05 16:52:44,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-02-05 16:52:44,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-02-05 16:52:44,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-02-05 16:52:44,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-02-05 16:52:44,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-02-05 16:52:44,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-02-05 16:52:44,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-02-05 16:52:44,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-02-05 16:52:44,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-02-05 16:52:44,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-02-05 16:52:44,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-02-05 16:52:44,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2025-02-05 16:52:44,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2025-02-05 16:52:44,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#17 [2025-02-05 16:52:44,342 INFO L130 BoogieDeclarations]: Found specification of procedure get_top [2025-02-05 16:52:44,342 INFO L138 BoogieDeclarations]: Found implementation of procedure get_top [2025-02-05 16:52:44,342 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 16:52:44,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-05 16:52:44,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-05 16:52:44,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-05 16:52:44,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-02-05 16:52:44,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-02-05 16:52:44,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-02-05 16:52:44,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-02-05 16:52:44,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-02-05 16:52:44,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-02-05 16:52:44,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-02-05 16:52:44,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-02-05 16:52:44,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-02-05 16:52:44,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-02-05 16:52:44,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-02-05 16:52:44,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2025-02-05 16:52:44,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#15 [2025-02-05 16:52:44,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#16 [2025-02-05 16:52:44,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#17 [2025-02-05 16:52:44,343 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_create [2025-02-05 16:52:44,343 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_create [2025-02-05 16:52:44,343 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_join [2025-02-05 16:52:44,343 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_join [2025-02-05 16:52:44,343 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~$Pointer$ [2025-02-05 16:52:44,343 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~$Pointer$ [2025-02-05 16:52:44,343 INFO L130 BoogieDeclarations]: Found specification of procedure error [2025-02-05 16:52:44,343 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2025-02-05 16:52:44,343 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_cs [2025-02-05 16:52:44,343 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_cs [2025-02-05 16:52:44,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 16:52:44,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-05 16:52:44,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-05 16:52:44,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-05 16:52:44,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-05 16:52:44,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-02-05 16:52:44,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-02-05 16:52:44,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-02-05 16:52:44,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-02-05 16:52:44,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-02-05 16:52:44,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-02-05 16:52:44,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-02-05 16:52:44,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-02-05 16:52:44,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-02-05 16:52:44,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-02-05 16:52:44,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-02-05 16:52:44,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-02-05 16:52:44,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-02-05 16:52:44,344 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 16:52:44,345 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 16:52:44,568 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 16:52:44,570 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 16:52:44,616 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L952: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);#res := 0; [2025-02-05 16:52:44,616 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L952: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-02-05 16:52:44,616 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L952-1: SUMMARY for call __CS_cs(); srcloc: null [2025-02-05 16:52:44,616 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L951: havoc #t~mem53; [2025-02-05 16:52:44,981 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1002-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);pop_#res#1 := 0; [2025-02-05 16:52:44,981 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1002-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296));pop_#res#1 := 0; [2025-02-05 16:52:44,981 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1002-2: SUMMARY for call __CS_cs(); srcloc: null [2025-02-05 16:52:44,981 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L969-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);push_#res#1 := 0; [2025-02-05 16:52:44,981 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L969-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-02-05 16:52:44,981 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L969-2: SUMMARY for call __CS_cs(); srcloc: null [2025-02-05 16:52:44,981 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1004-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);pop_#res#1 := 0; [2025-02-05 16:52:44,981 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1004-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-02-05 16:52:44,981 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1004-2: SUMMARY for call __CS_cs(); srcloc: null [2025-02-05 16:52:44,981 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L981-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);push_#res#1 := 0; [2025-02-05 16:52:44,981 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L981-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-02-05 16:52:44,981 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L981-2: SUMMARY for call __CS_cs(); srcloc: null [2025-02-05 16:52:44,981 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L999: havoc pop_#t~ret60#1;havoc pop_#t~mem61#1; [2025-02-05 16:52:44,981 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1000-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);pop_#res#1 := 0; [2025-02-05 16:52:44,981 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1000-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-02-05 16:52:44,981 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1000-2: SUMMARY for call __CS_cs(); srcloc: null [2025-02-05 16:52:44,982 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L992-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);pop_#res#1 := 0; [2025-02-05 16:52:44,982 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L992-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-02-05 16:52:44,982 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L992-2: SUMMARY for call __CS_cs(); srcloc: null [2025-02-05 16:52:44,991 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L930-1: SUMMARY for call __CS_cs(); srcloc: null [2025-02-05 16:52:44,992 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L928: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296); [2025-02-05 16:52:44,992 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L928: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-02-05 16:52:44,992 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L928-1: SUMMARY for call __CS_cs(); srcloc: null [2025-02-05 16:52:44,992 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L934: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296); [2025-02-05 16:52:44,992 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L934: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-02-05 16:52:44,992 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L934-1: SUMMARY for call __CS_cs(); srcloc: null [2025-02-05 16:52:44,992 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L932: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296); [2025-02-05 16:52:44,992 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L932: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-02-05 16:52:44,992 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L932-1: SUMMARY for call __CS_cs(); srcloc: null [2025-02-05 16:52:44,992 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L930: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296); [2025-02-05 16:52:44,992 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L930: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-02-05 16:52:45,323 INFO L? ?]: Removed 92 outVars from TransFormulas that were not future-live. [2025-02-05 16:52:45,324 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 16:52:45,334 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 16:52:45,334 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 16:52:45,335 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:52:45 BoogieIcfgContainer [2025-02-05 16:52:45,335 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 16:52:45,337 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 16:52:45,337 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 16:52:45,340 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 16:52:45,340 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 04:52:43" (1/3) ... [2025-02-05 16:52:45,341 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b71c1c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:52:45, skipping insertion in model container [2025-02-05 16:52:45,341 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:52:44" (2/3) ... [2025-02-05 16:52:45,341 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b71c1c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:52:45, skipping insertion in model container [2025-02-05 16:52:45,341 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:52:45" (3/3) ... [2025-02-05 16:52:45,342 INFO L128 eAbstractionObserver]: Analyzing ICFG cs_stack-2.i [2025-02-05 16:52:45,351 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 16:52:45,352 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG cs_stack-2.i that has 10 procedures, 217 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-02-05 16:52:45,400 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 16:52:45,409 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;@3ebac888, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 16:52:45,409 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 16:52:45,414 INFO L276 IsEmpty]: Start isEmpty. Operand has 217 states, 131 states have (on average 1.5114503816793894) internal successors, (198), 134 states have internal predecessors, (198), 75 states have call successors, (75), 9 states have call predecessors, (75), 9 states have return successors, (75), 75 states have call predecessors, (75), 75 states have call successors, (75) [2025-02-05 16:52:45,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-02-05 16:52:45,452 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:52:45,453 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:52:45,453 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:52:45,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:52:45,466 INFO L85 PathProgramCache]: Analyzing trace with hash 793594019, now seen corresponding path program 1 times [2025-02-05 16:52:45,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:52:45,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729481667] [2025-02-05 16:52:45,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:52:45,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:52:45,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-05 16:52:45,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-05 16:52:45,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:52:45,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:52:45,860 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2025-02-05 16:52:45,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:52:45,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729481667] [2025-02-05 16:52:45,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729481667] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:52:45,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [433310985] [2025-02-05 16:52:45,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:52:45,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:52:45,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:52:45,865 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 16:52:45,867 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 16:52:46,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-05 16:52:46,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-05 16:52:46,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:52:46,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:52:46,155 INFO L256 TraceCheckSpWp]: Trace formula consists of 729 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 16:52:46,171 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:52:46,187 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2025-02-05 16:52:46,187 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 16:52:46,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [433310985] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:52:46,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 16:52:46,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-05 16:52:46,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004540120] [2025-02-05 16:52:46,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:52:46,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 16:52:46,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:52:46,205 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 16:52:46,205 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 16:52:46,207 INFO L87 Difference]: Start difference. First operand has 217 states, 131 states have (on average 1.5114503816793894) internal successors, (198), 134 states have internal predecessors, (198), 75 states have call successors, (75), 9 states have call predecessors, (75), 9 states have return successors, (75), 75 states have call predecessors, (75), 75 states have call successors, (75) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 16:52:46,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:52:46,237 INFO L93 Difference]: Finished difference Result 430 states and 759 transitions. [2025-02-05 16:52:46,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 16:52:46,239 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 94 [2025-02-05 16:52:46,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:52:46,245 INFO L225 Difference]: With dead ends: 430 [2025-02-05 16:52:46,245 INFO L226 Difference]: Without dead ends: 213 [2025-02-05 16:52:46,249 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 16:52:46,251 INFO L435 NwaCegarLoop]: 346 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:52:46,251 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:52:46,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2025-02-05 16:52:46,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 213. [2025-02-05 16:52:46,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 128 states have (on average 1.5) internal successors, (192), 130 states have internal predecessors, (192), 75 states have call successors, (75), 9 states have call predecessors, (75), 9 states have return successors, (75), 75 states have call predecessors, (75), 75 states have call successors, (75) [2025-02-05 16:52:46,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 342 transitions. [2025-02-05 16:52:46,310 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 342 transitions. Word has length 94 [2025-02-05 16:52:46,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:52:46,310 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 342 transitions. [2025-02-05 16:52:46,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 16:52:46,310 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 342 transitions. [2025-02-05 16:52:46,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-02-05 16:52:46,315 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:52:46,315 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:52:46,324 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-05 16:52:46,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-05 16:52:46,516 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:52:46,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:52:46,517 INFO L85 PathProgramCache]: Analyzing trace with hash 486353301, now seen corresponding path program 1 times [2025-02-05 16:52:46,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:52:46,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139269766] [2025-02-05 16:52:46,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:52:46,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:52:46,566 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-05 16:52:46,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-05 16:52:46,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:52:46,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:52:47,142 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-02-05 16:52:47,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:52:47,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139269766] [2025-02-05 16:52:47,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139269766] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:52:47,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:52:47,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:52:47,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890838471] [2025-02-05 16:52:47,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:52:47,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 16:52:47,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:52:47,147 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 16:52:47,147 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:52:47,147 INFO L87 Difference]: Start difference. First operand 213 states and 342 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-05 16:52:47,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:52:47,229 INFO L93 Difference]: Finished difference Result 422 states and 687 transitions. [2025-02-05 16:52:47,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 16:52:47,230 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 94 [2025-02-05 16:52:47,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:52:47,238 INFO L225 Difference]: With dead ends: 422 [2025-02-05 16:52:47,241 INFO L226 Difference]: Without dead ends: 388 [2025-02-05 16:52:47,242 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:52:47,242 INFO L435 NwaCegarLoop]: 366 mSDtfsCounter, 301 mSDsluCounter, 698 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 301 SdHoareTripleChecker+Valid, 1064 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:52:47,244 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [301 Valid, 1064 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:52:47,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2025-02-05 16:52:47,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 387. [2025-02-05 16:52:47,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 387 states, 233 states have (on average 1.536480686695279) internal successors, (358), 237 states have internal predecessors, (358), 135 states have call successors, (135), 18 states have call predecessors, (135), 18 states have return successors, (143), 135 states have call predecessors, (143), 135 states have call successors, (143) [2025-02-05 16:52:47,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 636 transitions. [2025-02-05 16:52:47,282 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 636 transitions. Word has length 94 [2025-02-05 16:52:47,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:52:47,282 INFO L471 AbstractCegarLoop]: Abstraction has 387 states and 636 transitions. [2025-02-05 16:52:47,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-05 16:52:47,283 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 636 transitions. [2025-02-05 16:52:47,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-02-05 16:52:47,290 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:52:47,290 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 5, 5, 5, 5, 5, 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] [2025-02-05 16:52:47,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 16:52:47,290 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:52:47,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:52:47,291 INFO L85 PathProgramCache]: Analyzing trace with hash -78222098, now seen corresponding path program 1 times [2025-02-05 16:52:47,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:52:47,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975989950] [2025-02-05 16:52:47,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:52:47,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:52:47,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-02-05 16:52:47,373 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-02-05 16:52:47,373 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:52:47,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:52:47,965 INFO L134 CoverageAnalysis]: Checked inductivity of 738 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 738 trivial. 0 not checked. [2025-02-05 16:52:47,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:52:47,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975989950] [2025-02-05 16:52:47,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975989950] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:52:47,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:52:47,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 16:52:47,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872264026] [2025-02-05 16:52:47,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:52:47,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:52:47,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:52:47,966 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:52:47,966 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:52:47,966 INFO L87 Difference]: Start difference. First operand 387 states and 636 transitions. Second operand has 5 states, 4 states have (on average 13.0) internal successors, (52), 5 states have internal predecessors, (52), 4 states have call successors, (24), 1 states have call predecessors, (24), 2 states have return successors, (24), 3 states have call predecessors, (24), 4 states have call successors, (24) [2025-02-05 16:52:52,077 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-05 16:52:56,087 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-05 16:52:56,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:52:56,417 INFO L93 Difference]: Finished difference Result 820 states and 1347 transitions. [2025-02-05 16:52:56,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 16:52:56,418 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 13.0) internal successors, (52), 5 states have internal predecessors, (52), 4 states have call successors, (24), 1 states have call predecessors, (24), 2 states have return successors, (24), 3 states have call predecessors, (24), 4 states have call successors, (24) Word has length 177 [2025-02-05 16:52:56,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:52:56,429 INFO L225 Difference]: With dead ends: 820 [2025-02-05 16:52:56,430 INFO L226 Difference]: Without dead ends: 782 [2025-02-05 16:52:56,431 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:52:56,432 INFO L435 NwaCegarLoop]: 391 mSDtfsCounter, 409 mSDsluCounter, 1021 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 57 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 432 SdHoareTripleChecker+Valid, 1412 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.4s IncrementalHoareTripleChecker+Time [2025-02-05 16:52:56,432 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [432 Valid, 1412 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 104 Invalid, 2 Unknown, 0 Unchecked, 8.4s Time] [2025-02-05 16:52:56,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 782 states. [2025-02-05 16:52:56,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 782 to 775. [2025-02-05 16:52:56,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 775 states, 466 states have (on average 1.5343347639484979) internal successors, (715), 477 states have internal predecessors, (715), 269 states have call successors, (269), 36 states have call predecessors, (269), 39 states have return successors, (301), 269 states have call predecessors, (301), 269 states have call successors, (301) [2025-02-05 16:52:56,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 1285 transitions. [2025-02-05 16:52:56,514 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 1285 transitions. Word has length 177 [2025-02-05 16:52:56,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:52:56,514 INFO L471 AbstractCegarLoop]: Abstraction has 775 states and 1285 transitions. [2025-02-05 16:52:56,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 13.0) internal successors, (52), 5 states have internal predecessors, (52), 4 states have call successors, (24), 1 states have call predecessors, (24), 2 states have return successors, (24), 3 states have call predecessors, (24), 4 states have call successors, (24) [2025-02-05 16:52:56,515 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 1285 transitions. [2025-02-05 16:52:56,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-02-05 16:52:56,523 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:52:56,524 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:52:56,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 16:52:56,524 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:52:56,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:52:56,525 INFO L85 PathProgramCache]: Analyzing trace with hash 1041561355, now seen corresponding path program 1 times [2025-02-05 16:52:56,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:52:56,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186518714] [2025-02-05 16:52:56,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:52:56,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:52:56,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-02-05 16:52:56,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-02-05 16:52:56,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:52:56,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:52:56,969 INFO L134 CoverageAnalysis]: Checked inductivity of 734 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 734 trivial. 0 not checked. [2025-02-05 16:52:56,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:52:56,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186518714] [2025-02-05 16:52:56,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186518714] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:52:56,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:52:56,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 16:52:56,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283231359] [2025-02-05 16:52:56,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:52:56,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:52:56,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:52:56,971 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:52:56,971 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:52:56,971 INFO L87 Difference]: Start difference. First operand 775 states and 1285 transitions. Second operand has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 states have internal predecessors, (53), 4 states have call successors, (23), 1 states have call predecessors, (23), 2 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2025-02-05 16:53:00,977 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-05 16:53:02,748 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-05 16:53:03,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:53:03,126 INFO L93 Difference]: Finished difference Result 1533 states and 2525 transitions. [2025-02-05 16:53:03,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 16:53:03,127 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 states have internal predecessors, (53), 4 states have call successors, (23), 1 states have call predecessors, (23), 2 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) Word has length 173 [2025-02-05 16:53:03,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:53:03,133 INFO L225 Difference]: With dead ends: 1533 [2025-02-05 16:53:03,133 INFO L226 Difference]: Without dead ends: 762 [2025-02-05 16:53:03,137 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:53:03,138 INFO L435 NwaCegarLoop]: 391 mSDtfsCounter, 406 mSDsluCounter, 1024 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 54 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 430 SdHoareTripleChecker+Valid, 1415 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:53:03,138 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [430 Valid, 1415 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 101 Invalid, 1 Unknown, 0 Unchecked, 6.1s Time] [2025-02-05 16:53:03,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 762 states. [2025-02-05 16:53:03,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 762 to 758. [2025-02-05 16:53:03,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 758 states, 457 states have (on average 1.5273522975929978) internal successors, (698), 468 states have internal predecessors, (698), 261 states have call successors, (261), 35 states have call predecessors, (261), 39 states have return successors, (287), 262 states have call predecessors, (287), 261 states have call successors, (287) [2025-02-05 16:53:03,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 758 states to 758 states and 1246 transitions. [2025-02-05 16:53:03,205 INFO L78 Accepts]: Start accepts. Automaton has 758 states and 1246 transitions. Word has length 173 [2025-02-05 16:53:03,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:53:03,205 INFO L471 AbstractCegarLoop]: Abstraction has 758 states and 1246 transitions. [2025-02-05 16:53:03,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 states have internal predecessors, (53), 4 states have call successors, (23), 1 states have call predecessors, (23), 2 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2025-02-05 16:53:03,206 INFO L276 IsEmpty]: Start isEmpty. Operand 758 states and 1246 transitions. [2025-02-05 16:53:03,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-02-05 16:53:03,212 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:53:03,212 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:53:03,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 16:53:03,212 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:53:03,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:53:03,213 INFO L85 PathProgramCache]: Analyzing trace with hash -192546968, now seen corresponding path program 1 times [2025-02-05 16:53:03,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:53:03,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789327717] [2025-02-05 16:53:03,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:53:03,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:53:03,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-02-05 16:53:03,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-02-05 16:53:03,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:53:03,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:53:03,770 INFO L134 CoverageAnalysis]: Checked inductivity of 734 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 734 trivial. 0 not checked. [2025-02-05 16:53:03,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:53:03,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789327717] [2025-02-05 16:53:03,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789327717] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:53:03,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:53:03,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 16:53:03,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770943332] [2025-02-05 16:53:03,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:53:03,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:53:03,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:53:03,775 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:53:03,775 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:53:03,775 INFO L87 Difference]: Start difference. First operand 758 states and 1246 transitions. Second operand has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 states have internal predecessors, (53), 4 states have call successors, (23), 1 states have call predecessors, (23), 2 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2025-02-05 16:53:07,975 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-05 16:53:08,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:53:08,550 INFO L93 Difference]: Finished difference Result 1213 states and 1956 transitions. [2025-02-05 16:53:08,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 16:53:08,551 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 states have internal predecessors, (53), 4 states have call successors, (23), 1 states have call predecessors, (23), 2 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) Word has length 173 [2025-02-05 16:53:08,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:53:08,558 INFO L225 Difference]: With dead ends: 1213 [2025-02-05 16:53:08,558 INFO L226 Difference]: Without dead ends: 674 [2025-02-05 16:53:08,561 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:53:08,562 INFO L435 NwaCegarLoop]: 375 mSDtfsCounter, 464 mSDsluCounter, 784 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 86 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 501 SdHoareTripleChecker+Valid, 1159 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2025-02-05 16:53:08,562 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [501 Valid, 1159 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 328 Invalid, 1 Unknown, 0 Unchecked, 4.6s Time] [2025-02-05 16:53:08,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states. [2025-02-05 16:53:08,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 664. [2025-02-05 16:53:08,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 664 states, 404 states have (on average 1.4975247524752475) internal successors, (605), 413 states have internal predecessors, (605), 220 states have call successors, (220), 35 states have call predecessors, (220), 39 states have return successors, (242), 221 states have call predecessors, (242), 220 states have call successors, (242) [2025-02-05 16:53:08,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 664 states to 664 states and 1067 transitions. [2025-02-05 16:53:08,613 INFO L78 Accepts]: Start accepts. Automaton has 664 states and 1067 transitions. Word has length 173 [2025-02-05 16:53:08,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:53:08,614 INFO L471 AbstractCegarLoop]: Abstraction has 664 states and 1067 transitions. [2025-02-05 16:53:08,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 states have internal predecessors, (53), 4 states have call successors, (23), 1 states have call predecessors, (23), 2 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2025-02-05 16:53:08,614 INFO L276 IsEmpty]: Start isEmpty. Operand 664 states and 1067 transitions. [2025-02-05 16:53:08,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-02-05 16:53:08,618 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:53:08,618 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 5, 5, 5, 5, 5, 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] [2025-02-05 16:53:08,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 16:53:08,618 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:53:08,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:53:08,619 INFO L85 PathProgramCache]: Analyzing trace with hash 1841060617, now seen corresponding path program 1 times [2025-02-05 16:53:08,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:53:08,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335050825] [2025-02-05 16:53:08,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:53:08,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:53:08,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-02-05 16:53:08,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-02-05 16:53:08,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:53:08,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:53:08,981 INFO L134 CoverageAnalysis]: Checked inductivity of 738 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 734 trivial. 0 not checked. [2025-02-05 16:53:08,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:53:08,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335050825] [2025-02-05 16:53:08,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335050825] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:53:08,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1663596065] [2025-02-05 16:53:08,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:53:08,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:53:08,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:53:08,985 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 16:53:08,986 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-05 16:53:09,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-02-05 16:53:09,344 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-02-05 16:53:09,344 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:53:09,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:53:09,354 INFO L256 TraceCheckSpWp]: Trace formula consists of 1257 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-05 16:53:09,361 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:53:09,476 INFO L134 CoverageAnalysis]: Checked inductivity of 738 backedges. 280 proven. 4 refuted. 0 times theorem prover too weak. 454 trivial. 0 not checked. [2025-02-05 16:53:09,476 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:53:09,872 INFO L134 CoverageAnalysis]: Checked inductivity of 738 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 734 trivial. 0 not checked. [2025-02-05 16:53:09,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1663596065] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 16:53:09,873 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 16:53:09,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 5] total 11 [2025-02-05 16:53:09,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081241809] [2025-02-05 16:53:09,873 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 16:53:09,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-05 16:53:09,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:53:09,875 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-05 16:53:09,875 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2025-02-05 16:53:09,875 INFO L87 Difference]: Start difference. First operand 664 states and 1067 transitions. Second operand has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 states have internal predecessors, (80), 9 states have call successors, (48), 5 states have call predecessors, (48), 6 states have return successors, (49), 7 states have call predecessors, (49), 9 states have call successors, (49) [2025-02-05 16:53:13,888 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-05 16:53:16,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:53:16,050 INFO L93 Difference]: Finished difference Result 1709 states and 2755 transitions. [2025-02-05 16:53:16,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 16:53:16,051 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 states have internal predecessors, (80), 9 states have call successors, (48), 5 states have call predecessors, (48), 6 states have return successors, (49), 7 states have call predecessors, (49), 9 states have call successors, (49) Word has length 177 [2025-02-05 16:53:16,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:53:16,058 INFO L225 Difference]: With dead ends: 1709 [2025-02-05 16:53:16,058 INFO L226 Difference]: Without dead ends: 1049 [2025-02-05 16:53:16,062 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 364 GetRequests, 353 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2025-02-05 16:53:16,063 INFO L435 NwaCegarLoop]: 384 mSDtfsCounter, 1101 mSDsluCounter, 1093 mSDsCounter, 0 mSdLazyCounter, 1392 mSolverCounterSat, 719 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1186 SdHoareTripleChecker+Valid, 1477 SdHoareTripleChecker+Invalid, 2112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 719 IncrementalHoareTripleChecker+Valid, 1392 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:53:16,063 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1186 Valid, 1477 Invalid, 2112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [719 Valid, 1392 Invalid, 1 Unknown, 0 Unchecked, 6.0s Time] [2025-02-05 16:53:16,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1049 states. [2025-02-05 16:53:16,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1049 to 1028. [2025-02-05 16:53:16,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1028 states, 622 states have (on average 1.4903536977491962) internal successors, (927), 637 states have internal predecessors, (927), 344 states have call successors, (344), 57 states have call predecessors, (344), 61 states have return successors, (380), 343 states have call predecessors, (380), 344 states have call successors, (380) [2025-02-05 16:53:16,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1028 states to 1028 states and 1651 transitions. [2025-02-05 16:53:16,176 INFO L78 Accepts]: Start accepts. Automaton has 1028 states and 1651 transitions. Word has length 177 [2025-02-05 16:53:16,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:53:16,176 INFO L471 AbstractCegarLoop]: Abstraction has 1028 states and 1651 transitions. [2025-02-05 16:53:16,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 states have internal predecessors, (80), 9 states have call successors, (48), 5 states have call predecessors, (48), 6 states have return successors, (49), 7 states have call predecessors, (49), 9 states have call successors, (49) [2025-02-05 16:53:16,176 INFO L276 IsEmpty]: Start isEmpty. Operand 1028 states and 1651 transitions. [2025-02-05 16:53:16,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-02-05 16:53:16,182 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:53:16,182 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 5, 5, 5, 5, 5, 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] [2025-02-05 16:53:16,191 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-05 16:53:16,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:53:16,387 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:53:16,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:53:16,388 INFO L85 PathProgramCache]: Analyzing trace with hash -430170295, now seen corresponding path program 1 times [2025-02-05 16:53:16,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:53:16,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652242759] [2025-02-05 16:53:16,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:53:16,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:53:16,439 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-02-05 16:53:16,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-02-05 16:53:16,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:53:16,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:53:17,609 INFO L134 CoverageAnalysis]: Checked inductivity of 738 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 734 trivial. 0 not checked. [2025-02-05 16:53:17,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:53:17,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652242759] [2025-02-05 16:53:17,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652242759] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:53:17,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1745794404] [2025-02-05 16:53:17,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:53:17,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:53:17,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:53:17,613 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 16:53:17,614 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-05 16:53:17,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-02-05 16:53:17,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-02-05 16:53:17,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:53:17,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:53:17,971 INFO L256 TraceCheckSpWp]: Trace formula consists of 1355 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-02-05 16:53:17,979 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:53:18,221 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-02-05 16:53:21,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 16:53:21,295 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 16:53:21,296 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 15 [2025-02-05 16:53:22,036 INFO L349 Elim1Store]: treesize reduction 33, result has 25.0 percent of original size [2025-02-05 16:53:22,036 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2025-02-05 16:53:53,166 INFO L134 CoverageAnalysis]: Checked inductivity of 738 backedges. 352 proven. 4 refuted. 0 times theorem prover too weak. 382 trivial. 0 not checked. [2025-02-05 16:53:53,166 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:53:53,378 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 23 [2025-02-05 16:53:53,383 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 31 [2025-02-05 16:53:53,769 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2025-02-05 16:53:53,773 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2025-02-05 16:53:53,834 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2025-02-05 16:53:53,838 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2025-02-05 16:53:53,938 INFO L134 CoverageAnalysis]: Checked inductivity of 738 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 734 trivial. 0 not checked. [2025-02-05 16:53:53,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1745794404] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 16:53:53,938 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 16:53:53,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 9] total 38 [2025-02-05 16:53:53,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651742344] [2025-02-05 16:53:53,939 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 16:53:53,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-02-05 16:53:53,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:53:53,940 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-02-05 16:53:53,941 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=1260, Unknown=3, NotChecked=0, Total=1406 [2025-02-05 16:53:53,941 INFO L87 Difference]: Start difference. First operand 1028 states and 1651 transitions. Second operand has 38 states, 35 states have (on average 3.857142857142857) internal successors, (135), 36 states have internal predecessors, (135), 18 states have call successors, (59), 12 states have call predecessors, (59), 14 states have return successors, (59), 16 states have call predecessors, (59), 18 states have call successors, (59) [2025-02-05 16:53:57,969 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-05 16:53:59,675 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-05 16:54:04,162 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-05 16:54:08,172 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-05 16:54:12,321 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-05 16:54:16,526 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.20s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-05 16:54:20,554 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers []