./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-pthread/cs_stateful-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 48c9605d 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_stateful-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 c1d6cba599289c2637bd3d8da41e464d318a32e6ae6e6e0e391ff437e6ce1fcc --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-07 21:25:32,624 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-07 21:25:32,664 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-07 21:25:32,667 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-07 21:25:32,668 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-07 21:25:32,682 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-07 21:25:32,683 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-07 21:25:32,683 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-07 21:25:32,683 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-07 21:25:32,684 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-07 21:25:32,684 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-07 21:25:32,684 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-07 21:25:32,684 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-07 21:25:32,684 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-07 21:25:32,684 INFO L153 SettingsManager]: * Use SBE=true [2025-02-07 21:25:32,684 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-07 21:25:32,684 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-07 21:25:32,684 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-07 21:25:32,685 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-07 21:25:32,685 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-07 21:25:32,685 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-07 21:25:32,685 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-07 21:25:32,685 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-07 21:25:32,685 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-07 21:25:32,685 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-07 21:25:32,685 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-07 21:25:32,685 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-07 21:25:32,685 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-07 21:25:32,685 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-07 21:25:32,686 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-07 21:25:32,686 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-07 21:25:32,686 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-07 21:25:32,686 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 21:25:32,686 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-07 21:25:32,686 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-07 21:25:32,686 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-07 21:25:32,686 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-07 21:25:32,686 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-07 21:25:32,686 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-07 21:25:32,687 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-07 21:25:32,687 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-07 21:25:32,687 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-07 21:25:32,687 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-07 21:25:32,687 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 -> c1d6cba599289c2637bd3d8da41e464d318a32e6ae6e6e0e391ff437e6ce1fcc [2025-02-07 21:25:32,915 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-07 21:25:32,924 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-07 21:25:32,926 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-07 21:25:32,928 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-07 21:25:32,928 INFO L274 PluginConnector]: CDTParser initialized [2025-02-07 21:25:32,930 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-pthread/cs_stateful-2.i [2025-02-07 21:25:34,162 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/860406543/5c09e6bbf88449988de01294385b59e6/FLAG9441170fa [2025-02-07 21:25:34,436 INFO L384 CDTParser]: Found 1 translation units. [2025-02-07 21:25:34,437 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_stateful-2.i [2025-02-07 21:25:34,457 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/860406543/5c09e6bbf88449988de01294385b59e6/FLAG9441170fa [2025-02-07 21:25:34,726 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/860406543/5c09e6bbf88449988de01294385b59e6 [2025-02-07 21:25:34,728 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-07 21:25:34,729 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-07 21:25:34,730 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-07 21:25:34,730 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-07 21:25:34,734 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-07 21:25:34,735 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 09:25:34" (1/1) ... [2025-02-07 21:25:34,736 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2cf2b30e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:25:34, skipping insertion in model container [2025-02-07 21:25:34,736 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 09:25:34" (1/1) ... [2025-02-07 21:25:34,766 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-07 21:25:34,946 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_stateful-2.i[23607,23620] [2025-02-07 21:25:34,995 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 21:25:35,003 INFO L200 MainTranslator]: Completed pre-run [2025-02-07 21:25:35,028 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_stateful-2.i[23607,23620] [2025-02-07 21:25:35,054 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 21:25:35,075 INFO L204 MainTranslator]: Completed translation [2025-02-07 21:25:35,075 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:25:35 WrapperNode [2025-02-07 21:25:35,076 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-07 21:25:35,076 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-07 21:25:35,076 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-07 21:25:35,076 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-07 21:25:35,080 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:25:35" (1/1) ... [2025-02-07 21:25:35,093 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:25:35" (1/1) ... [2025-02-07 21:25:35,120 INFO L138 Inliner]: procedures = 145, calls = 254, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 548 [2025-02-07 21:25:35,120 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-07 21:25:35,121 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-07 21:25:35,121 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-07 21:25:35,121 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-07 21:25:35,129 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:25:35" (1/1) ... [2025-02-07 21:25:35,130 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:25:35" (1/1) ... [2025-02-07 21:25:35,137 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:25:35" (1/1) ... [2025-02-07 21:25:35,157 INFO L175 MemorySlicer]: Split 122 memory accesses to 17 slices as follows [2, 0, 8, 8, 3, 8, 20, 12, 12, 3, 10, 10, 7, 3, 7, 3, 6]. 16 percent of accesses are in the largest equivalence class. The 33 initializations are split as follows [2, 0, 3, 3, 0, 3, 6, 6, 4, 0, 2, 2, 0, 0, 0, 0, 2]. The 37 writes are split as follows [0, 0, 2, 2, 1, 2, 8, 3, 4, 1, 4, 4, 1, 1, 1, 1, 2]. [2025-02-07 21:25:35,157 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:25:35" (1/1) ... [2025-02-07 21:25:35,158 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:25:35" (1/1) ... [2025-02-07 21:25:35,176 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:25:35" (1/1) ... [2025-02-07 21:25:35,186 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:25:35" (1/1) ... [2025-02-07 21:25:35,190 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:25:35" (1/1) ... [2025-02-07 21:25:35,192 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:25:35" (1/1) ... [2025-02-07 21:25:35,198 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-07 21:25:35,199 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-07 21:25:35,199 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-07 21:25:35,199 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-07 21:25:35,201 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:25:35" (1/1) ... [2025-02-07 21:25:35,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 21:25:35,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 21:25:35,234 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-07 21:25:35,241 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-07 21:25:35,257 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-07 21:25:35,258 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-07 21:25:35,258 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-07 21:25:35,258 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-07 21:25:35,258 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-02-07 21:25:35,258 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-02-07 21:25:35,258 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-02-07 21:25:35,258 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-02-07 21:25:35,258 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-02-07 21:25:35,258 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-02-07 21:25:35,259 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-02-07 21:25:35,259 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-02-07 21:25:35,259 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-02-07 21:25:35,259 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-02-07 21:25:35,259 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-02-07 21:25:35,259 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2025-02-07 21:25:35,259 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2025-02-07 21:25:35,259 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-07 21:25:35,259 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-07 21:25:35,259 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-07 21:25:35,259 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-07 21:25:35,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-02-07 21:25:35,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-02-07 21:25:35,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-02-07 21:25:35,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-02-07 21:25:35,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-02-07 21:25:35,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-02-07 21:25:35,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-02-07 21:25:35,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-02-07 21:25:35,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-02-07 21:25:35,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-02-07 21:25:35,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-02-07 21:25:35,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2025-02-07 21:25:35,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2025-02-07 21:25:35,261 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-07 21:25:35,261 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-07 21:25:35,261 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-07 21:25:35,261 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-07 21:25:35,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-07 21:25:35,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-07 21:25:35,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-07 21:25:35,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-02-07 21:25:35,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-02-07 21:25:35,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-02-07 21:25:35,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-02-07 21:25:35,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-02-07 21:25:35,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-02-07 21:25:35,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-02-07 21:25:35,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-02-07 21:25:35,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-02-07 21:25:35,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-02-07 21:25:35,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-02-07 21:25:35,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2025-02-07 21:25:35,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#15 [2025-02-07 21:25:35,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#16 [2025-02-07 21:25:35,261 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_init [2025-02-07 21:25:35,261 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_init [2025-02-07 21:25:35,261 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_lock [2025-02-07 21:25:35,261 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_lock [2025-02-07 21:25:35,261 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_create [2025-02-07 21:25:35,263 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_create [2025-02-07 21:25:35,263 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-07 21:25:35,264 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-07 21:25:35,264 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-07 21:25:35,264 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-02-07 21:25:35,264 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-02-07 21:25:35,264 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-02-07 21:25:35,264 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-02-07 21:25:35,264 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-02-07 21:25:35,264 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-02-07 21:25:35,264 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-02-07 21:25:35,264 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-02-07 21:25:35,264 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-02-07 21:25:35,264 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-02-07 21:25:35,264 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-02-07 21:25:35,264 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2025-02-07 21:25:35,265 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#15 [2025-02-07 21:25:35,265 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#16 [2025-02-07 21:25:35,265 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_join [2025-02-07 21:25:35,265 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_join [2025-02-07 21:25:35,265 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~$Pointer$ [2025-02-07 21:25:35,265 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~$Pointer$ [2025-02-07 21:25:35,265 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-07 21:25:35,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-02-07 21:25:35,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-02-07 21:25:35,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-02-07 21:25:35,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-02-07 21:25:35,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-02-07 21:25:35,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-02-07 21:25:35,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-02-07 21:25:35,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2025-02-07 21:25:35,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2025-02-07 21:25:35,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2025-02-07 21:25:35,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2025-02-07 21:25:35,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2025-02-07 21:25:35,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2025-02-07 21:25:35,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2025-02-07 21:25:35,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#14 [2025-02-07 21:25:35,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#15 [2025-02-07 21:25:35,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#16 [2025-02-07 21:25:35,265 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_cs [2025-02-07 21:25:35,265 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_cs [2025-02-07 21:25:35,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-07 21:25:35,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-07 21:25:35,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-07 21:25:35,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-07 21:25:35,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-07 21:25:35,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-02-07 21:25:35,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-02-07 21:25:35,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-02-07 21:25:35,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-02-07 21:25:35,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-02-07 21:25:35,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-02-07 21:25:35,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-02-07 21:25:35,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-02-07 21:25:35,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-02-07 21:25:35,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-02-07 21:25:35,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-02-07 21:25:35,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-02-07 21:25:35,266 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_unlock [2025-02-07 21:25:35,266 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_unlock [2025-02-07 21:25:35,266 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-07 21:25:35,266 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-07 21:25:35,495 INFO L257 CfgBuilder]: Building ICFG [2025-02-07 21:25:35,497 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-07 21:25:35,882 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L746-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);main_thread_#res#1.base, main_thread_#res#1.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset);havoc main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset);havoc main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset; [2025-02-07 21:25:35,882 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L746-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-07 21:25:35,882 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L746-2: SUMMARY for call __CS_cs(); srcloc: null [2025-02-07 21:25:35,883 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L748-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);main_thread_#res#1.base, main_thread_#res#1.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset);havoc main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset);havoc main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset; [2025-02-07 21:25:35,883 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L748-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-07 21:25:35,883 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L748-2: SUMMARY for call __CS_cs(); srcloc: null [2025-02-07 21:25:35,883 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L750-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);main_thread_#res#1.base, main_thread_#res#1.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset);havoc main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset);havoc main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset; [2025-02-07 21:25:35,883 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L750-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-07 21:25:35,883 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L750-2: SUMMARY for call __CS_cs(); srcloc: null [2025-02-07 21:25:36,148 INFO L? ?]: Removed 130 outVars from TransFormulas that were not future-live. [2025-02-07 21:25:36,148 INFO L308 CfgBuilder]: Performing block encoding [2025-02-07 21:25:36,158 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-07 21:25:36,158 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-07 21:25:36,158 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 09:25:36 BoogieIcfgContainer [2025-02-07 21:25:36,159 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-07 21:25:36,160 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-07 21:25:36,160 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-07 21:25:36,164 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-07 21:25:36,165 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 09:25:34" (1/3) ... [2025-02-07 21:25:36,165 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7caf4546 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 09:25:36, skipping insertion in model container [2025-02-07 21:25:36,165 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:25:35" (2/3) ... [2025-02-07 21:25:36,166 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7caf4546 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 09:25:36, skipping insertion in model container [2025-02-07 21:25:36,168 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 09:25:36" (3/3) ... [2025-02-07 21:25:36,168 INFO L128 eAbstractionObserver]: Analyzing ICFG cs_stateful-2.i [2025-02-07 21:25:36,177 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-07 21:25:36,179 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG cs_stateful-2.i that has 9 procedures, 166 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-02-07 21:25:36,222 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-07 21:25:36,229 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;@64076b6b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-07 21:25:36,230 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-07 21:25:36,233 INFO L276 IsEmpty]: Start isEmpty. Operand has 166 states, 99 states have (on average 1.4747474747474747) internal successors, (146), 103 states have internal predecessors, (146), 54 states have call successors, (54), 8 states have call predecessors, (54), 8 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2025-02-07 21:25:36,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-02-07 21:25:36,246 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:25:36,246 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 21:25:36,247 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:25:36,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:25:36,250 INFO L85 PathProgramCache]: Analyzing trace with hash -505555416, now seen corresponding path program 1 times [2025-02-07 21:25:36,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:25:36,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860430808] [2025-02-07 21:25:36,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:25:36,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:25:36,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-02-07 21:25:36,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-02-07 21:25:36,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:25:36,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:25:36,724 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-02-07 21:25:36,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:25:36,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860430808] [2025-02-07 21:25:36,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860430808] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:25:36,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:25:36,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 21:25:36,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226318928] [2025-02-07 21:25:36,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:25:36,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-07 21:25:36,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:25:36,745 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-07 21:25:36,745 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 21:25:36,747 INFO L87 Difference]: Start difference. First operand has 166 states, 99 states have (on average 1.4747474747474747) internal successors, (146), 103 states have internal predecessors, (146), 54 states have call successors, (54), 8 states have call predecessors, (54), 8 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-02-07 21:25:36,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:25:36,882 INFO L93 Difference]: Finished difference Result 331 states and 549 transitions. [2025-02-07 21:25:36,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-07 21:25:36,885 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 70 [2025-02-07 21:25:36,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:25:36,892 INFO L225 Difference]: With dead ends: 331 [2025-02-07 21:25:36,892 INFO L226 Difference]: Without dead ends: 160 [2025-02-07 21:25:36,896 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 21:25:36,897 INFO L435 NwaCegarLoop]: 249 mSDtfsCounter, 2 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 495 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.1s IncrementalHoareTripleChecker+Time [2025-02-07 21:25:36,898 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 495 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 21:25:36,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2025-02-07 21:25:36,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 159. [2025-02-07 21:25:36,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 97 states have (on average 1.1855670103092784) internal successors, (115), 97 states have internal predecessors, (115), 53 states have call successors, (53), 8 states have call predecessors, (53), 8 states have return successors, (53), 53 states have call predecessors, (53), 53 states have call successors, (53) [2025-02-07 21:25:36,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 221 transitions. [2025-02-07 21:25:36,948 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 221 transitions. Word has length 70 [2025-02-07 21:25:36,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:25:36,948 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 221 transitions. [2025-02-07 21:25:36,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-02-07 21:25:36,953 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 221 transitions. [2025-02-07 21:25:36,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-02-07 21:25:36,959 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:25:36,960 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 21:25:36,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-07 21:25:36,960 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:25:36,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:25:36,961 INFO L85 PathProgramCache]: Analyzing trace with hash -698875104, now seen corresponding path program 1 times [2025-02-07 21:25:36,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:25:36,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119513421] [2025-02-07 21:25:36,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:25:36,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:25:37,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-02-07 21:25:37,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-02-07 21:25:37,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:25:37,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:25:37,215 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-02-07 21:25:37,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:25:37,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119513421] [2025-02-07 21:25:37,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119513421] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:25:37,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:25:37,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 21:25:37,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425973408] [2025-02-07 21:25:37,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:25:37,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-07 21:25:37,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:25:37,218 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-07 21:25:37,218 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 21:25:37,219 INFO L87 Difference]: Start difference. First operand 159 states and 221 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-02-07 21:25:37,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:25:37,262 INFO L93 Difference]: Finished difference Result 317 states and 442 transitions. [2025-02-07 21:25:37,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-07 21:25:37,263 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 72 [2025-02-07 21:25:37,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:25:37,265 INFO L225 Difference]: With dead ends: 317 [2025-02-07 21:25:37,265 INFO L226 Difference]: Without dead ends: 160 [2025-02-07 21:25:37,266 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 21:25:37,268 INFO L435 NwaCegarLoop]: 219 mSDtfsCounter, 0 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 21:25:37,268 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 435 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 21:25:37,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2025-02-07 21:25:37,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2025-02-07 21:25:37,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 98 states have (on average 1.183673469387755) internal successors, (116), 98 states have internal predecessors, (116), 53 states have call successors, (53), 8 states have call predecessors, (53), 8 states have return successors, (53), 53 states have call predecessors, (53), 53 states have call successors, (53) [2025-02-07 21:25:37,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 222 transitions. [2025-02-07 21:25:37,288 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 222 transitions. Word has length 72 [2025-02-07 21:25:37,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:25:37,288 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 222 transitions. [2025-02-07 21:25:37,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-02-07 21:25:37,288 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 222 transitions. [2025-02-07 21:25:37,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-02-07 21:25:37,293 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:25:37,293 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 21:25:37,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-07 21:25:37,293 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:25:37,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:25:37,294 INFO L85 PathProgramCache]: Analyzing trace with hash -1777347791, now seen corresponding path program 1 times [2025-02-07 21:25:37,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:25:37,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645775399] [2025-02-07 21:25:37,294 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:25:37,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:25:37,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-02-07 21:25:37,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-02-07 21:25:37,386 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:25:37,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:25:37,486 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-02-07 21:25:37,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:25:37,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645775399] [2025-02-07 21:25:37,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645775399] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 21:25:37,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [319546750] [2025-02-07 21:25:37,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:25:37,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 21:25:37,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 21:25:37,488 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-07 21:25:37,492 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-07 21:25:37,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-02-07 21:25:37,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-02-07 21:25:37,778 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:25:37,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:25:37,783 INFO L256 TraceCheckSpWp]: Trace formula consists of 670 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-07 21:25:37,787 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 21:25:37,817 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-02-07 21:25:37,817 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 21:25:37,881 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-02-07 21:25:37,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [319546750] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 21:25:37,881 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 21:25:37,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2025-02-07 21:25:37,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378866676] [2025-02-07 21:25:37,882 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 21:25:37,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 21:25:37,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:25:37,883 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 21:25:37,883 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:25:37,883 INFO L87 Difference]: Start difference. First operand 160 states and 222 transitions. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 1 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-02-07 21:25:37,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:25:37,926 INFO L93 Difference]: Finished difference Result 320 states and 446 transitions. [2025-02-07 21:25:37,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 21:25:37,926 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 1 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 73 [2025-02-07 21:25:37,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:25:37,928 INFO L225 Difference]: With dead ends: 320 [2025-02-07 21:25:37,928 INFO L226 Difference]: Without dead ends: 162 [2025-02-07 21:25:37,929 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 143 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:25:37,929 INFO L435 NwaCegarLoop]: 219 mSDtfsCounter, 0 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 651 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 21:25:37,930 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 651 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 21:25:37,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2025-02-07 21:25:37,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2025-02-07 21:25:37,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 100 states have (on average 1.18) internal successors, (118), 100 states have internal predecessors, (118), 53 states have call successors, (53), 8 states have call predecessors, (53), 8 states have return successors, (53), 53 states have call predecessors, (53), 53 states have call successors, (53) [2025-02-07 21:25:37,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 224 transitions. [2025-02-07 21:25:37,939 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 224 transitions. Word has length 73 [2025-02-07 21:25:37,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:25:37,940 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 224 transitions. [2025-02-07 21:25:37,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 1 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-02-07 21:25:37,940 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 224 transitions. [2025-02-07 21:25:37,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-02-07 21:25:37,941 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:25:37,941 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:25:37,949 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-07 21:25:38,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 21:25:38,142 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:25:38,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:25:38,143 INFO L85 PathProgramCache]: Analyzing trace with hash 2119570705, now seen corresponding path program 2 times [2025-02-07 21:25:38,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:25:38,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990202567] [2025-02-07 21:25:38,143 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 21:25:38,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:25:38,193 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 75 statements into 2 equivalence classes. [2025-02-07 21:25:38,208 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 16 of 75 statements. [2025-02-07 21:25:38,209 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-07 21:25:38,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:25:38,331 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2025-02-07 21:25:38,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:25:38,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990202567] [2025-02-07 21:25:38,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990202567] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:25:38,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:25:38,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 21:25:38,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896760422] [2025-02-07 21:25:38,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:25:38,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 21:25:38,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:25:38,333 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 21:25:38,334 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 21:25:38,334 INFO L87 Difference]: Start difference. First operand 162 states and 224 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-02-07 21:25:38,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:25:38,383 INFO L93 Difference]: Finished difference Result 315 states and 444 transitions. [2025-02-07 21:25:38,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 21:25:38,384 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 75 [2025-02-07 21:25:38,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:25:38,390 INFO L225 Difference]: With dead ends: 315 [2025-02-07 21:25:38,390 INFO L226 Difference]: Without dead ends: 289 [2025-02-07 21:25:38,391 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-07 21:25:38,391 INFO L435 NwaCegarLoop]: 295 mSDtfsCounter, 185 mSDsluCounter, 505 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 800 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 21:25:38,393 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 800 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 21:25:38,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2025-02-07 21:25:38,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 289. [2025-02-07 21:25:38,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 177 states have (on average 1.1751412429378532) internal successors, (208), 177 states have internal predecessors, (208), 95 states have call successors, (95), 16 states have call predecessors, (95), 16 states have return successors, (103), 95 states have call predecessors, (103), 95 states have call successors, (103) [2025-02-07 21:25:38,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 406 transitions. [2025-02-07 21:25:38,428 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 406 transitions. Word has length 75 [2025-02-07 21:25:38,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:25:38,428 INFO L471 AbstractCegarLoop]: Abstraction has 289 states and 406 transitions. [2025-02-07 21:25:38,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-02-07 21:25:38,429 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 406 transitions. [2025-02-07 21:25:38,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2025-02-07 21:25:38,431 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:25:38,432 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 7, 7, 7, 7, 7, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:25:38,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-07 21:25:38,432 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:25:38,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:25:38,432 INFO L85 PathProgramCache]: Analyzing trace with hash -2034764710, now seen corresponding path program 1 times [2025-02-07 21:25:38,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:25:38,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661820138] [2025-02-07 21:25:38,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:25:38,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:25:38,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-02-07 21:25:38,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-02-07 21:25:38,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:25:38,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:25:38,658 INFO L134 CoverageAnalysis]: Checked inductivity of 664 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 663 trivial. 0 not checked. [2025-02-07 21:25:38,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:25:38,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661820138] [2025-02-07 21:25:38,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661820138] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 21:25:38,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1412971172] [2025-02-07 21:25:38,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:25:38,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 21:25:38,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 21:25:38,661 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-07 21:25:38,664 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-07 21:25:38,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-02-07 21:25:38,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-02-07 21:25:38,993 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:25:38,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:25:38,998 INFO L256 TraceCheckSpWp]: Trace formula consists of 1222 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-07 21:25:39,003 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 21:25:39,022 INFO L134 CoverageAnalysis]: Checked inductivity of 664 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 663 trivial. 0 not checked. [2025-02-07 21:25:39,022 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 21:25:39,183 INFO L134 CoverageAnalysis]: Checked inductivity of 664 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 663 trivial. 0 not checked. [2025-02-07 21:25:39,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1412971172] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 21:25:39,184 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 21:25:39,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 4] total 5 [2025-02-07 21:25:39,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065306653] [2025-02-07 21:25:39,184 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 21:25:39,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 21:25:39,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:25:39,185 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 21:25:39,185 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-07 21:25:39,185 INFO L87 Difference]: Start difference. First operand 289 states and 406 transitions. Second operand has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 2 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 2 states have call predecessors, (46), 2 states have call successors, (46) [2025-02-07 21:25:39,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:25:39,256 INFO L93 Difference]: Finished difference Result 576 states and 810 transitions. [2025-02-07 21:25:39,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 21:25:39,265 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 2 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 2 states have call predecessors, (46), 2 states have call successors, (46) Word has length 185 [2025-02-07 21:25:39,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:25:39,270 INFO L225 Difference]: With dead ends: 576 [2025-02-07 21:25:39,270 INFO L226 Difference]: Without dead ends: 294 [2025-02-07 21:25:39,271 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 367 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-07 21:25:39,272 INFO L435 NwaCegarLoop]: 217 mSDtfsCounter, 2 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 21:25:39,272 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 432 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 21:25:39,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2025-02-07 21:25:39,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 294. [2025-02-07 21:25:39,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 182 states have (on average 1.1758241758241759) internal successors, (214), 182 states have internal predecessors, (214), 95 states have call successors, (95), 16 states have call predecessors, (95), 16 states have return successors, (103), 95 states have call predecessors, (103), 95 states have call successors, (103) [2025-02-07 21:25:39,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 412 transitions. [2025-02-07 21:25:39,300 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 412 transitions. Word has length 185 [2025-02-07 21:25:39,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:25:39,300 INFO L471 AbstractCegarLoop]: Abstraction has 294 states and 412 transitions. [2025-02-07 21:25:39,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 2 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 2 states have call predecessors, (46), 2 states have call successors, (46) [2025-02-07 21:25:39,300 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 412 transitions. [2025-02-07 21:25:39,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-02-07 21:25:39,305 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:25:39,305 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 7, 7, 7, 7, 7, 6, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:25:39,313 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-07 21:25:39,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 21:25:39,506 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:25:39,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:25:39,506 INFO L85 PathProgramCache]: Analyzing trace with hash -2037970297, now seen corresponding path program 2 times [2025-02-07 21:25:39,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:25:39,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355457668] [2025-02-07 21:25:39,507 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 21:25:39,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:25:39,577 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 190 statements into 2 equivalence classes. [2025-02-07 21:25:39,588 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 21 of 190 statements. [2025-02-07 21:25:39,588 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-07 21:25:39,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:25:39,777 INFO L134 CoverageAnalysis]: Checked inductivity of 688 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 688 trivial. 0 not checked. [2025-02-07 21:25:39,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:25:39,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355457668] [2025-02-07 21:25:39,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355457668] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:25:39,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:25:39,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 21:25:39,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37227122] [2025-02-07 21:25:39,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:25:39,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 21:25:39,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:25:39,778 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 21:25:39,778 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 21:25:39,778 INFO L87 Difference]: Start difference. First operand 294 states and 412 transitions. Second operand has 5 states, 4 states have (on average 13.5) internal successors, (54), 5 states have internal predecessors, (54), 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-07 21:25:41,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:25:41,153 INFO L93 Difference]: Finished difference Result 616 states and 874 transitions. [2025-02-07 21:25:41,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 21:25:41,153 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 13.5) internal successors, (54), 5 states have internal predecessors, (54), 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 190 [2025-02-07 21:25:41,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:25:41,157 INFO L225 Difference]: With dead ends: 616 [2025-02-07 21:25:41,158 INFO L226 Difference]: Without dead ends: 586 [2025-02-07 21:25:41,159 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-07 21:25:41,159 INFO L435 NwaCegarLoop]: 228 mSDtfsCounter, 209 mSDsluCounter, 569 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 797 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-07 21:25:41,159 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 797 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-07 21:25:41,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2025-02-07 21:25:41,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 579. [2025-02-07 21:25:41,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 579 states, 354 states have (on average 1.1694915254237288) internal successors, (414), 357 states have internal predecessors, (414), 189 states have call successors, (189), 32 states have call predecessors, (189), 35 states have return successors, (221), 189 states have call predecessors, (221), 189 states have call successors, (221) [2025-02-07 21:25:41,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 824 transitions. [2025-02-07 21:25:41,221 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 824 transitions. Word has length 190 [2025-02-07 21:25:41,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:25:41,222 INFO L471 AbstractCegarLoop]: Abstraction has 579 states and 824 transitions. [2025-02-07 21:25:41,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 13.5) internal successors, (54), 5 states have internal predecessors, (54), 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-07 21:25:41,222 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 824 transitions. [2025-02-07 21:25:41,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-02-07 21:25:41,225 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:25:41,225 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 7, 7, 7, 7, 7, 6, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:25:41,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-07 21:25:41,226 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:25:41,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:25:41,226 INFO L85 PathProgramCache]: Analyzing trace with hash 440437255, now seen corresponding path program 1 times [2025-02-07 21:25:41,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:25:41,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400948671] [2025-02-07 21:25:41,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:25:41,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:25:41,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-02-07 21:25:41,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-02-07 21:25:41,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:25:41,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:25:41,745 INFO L134 CoverageAnalysis]: Checked inductivity of 688 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 688 trivial. 0 not checked. [2025-02-07 21:25:41,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:25:41,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400948671] [2025-02-07 21:25:41,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400948671] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:25:41,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:25:41,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 21:25:41,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191850498] [2025-02-07 21:25:41,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:25:41,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 21:25:41,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:25:41,746 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 21:25:41,746 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 21:25:41,747 INFO L87 Difference]: Start difference. First operand 579 states and 824 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-02-07 21:25:44,879 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-07 21:25:44,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:25:44,995 INFO L93 Difference]: Finished difference Result 932 states and 1302 transitions. [2025-02-07 21:25:44,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 21:25:44,996 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 190 [2025-02-07 21:25:44,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:25:45,001 INFO L225 Difference]: With dead ends: 932 [2025-02-07 21:25:45,001 INFO L226 Difference]: Without dead ends: 575 [2025-02-07 21:25:45,003 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-07 21:25:45,004 INFO L435 NwaCegarLoop]: 254 mSDtfsCounter, 205 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 712 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2025-02-07 21:25:45,004 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 712 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2025-02-07 21:25:45,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2025-02-07 21:25:45,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 568. [2025-02-07 21:25:45,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 568 states, 346 states have (on average 1.1618497109826589) internal successors, (402), 348 states have internal predecessors, (402), 187 states have call successors, (187), 32 states have call predecessors, (187), 34 states have return successors, (215), 187 states have call predecessors, (215), 187 states have call successors, (215) [2025-02-07 21:25:45,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 804 transitions. [2025-02-07 21:25:45,057 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 804 transitions. Word has length 190 [2025-02-07 21:25:45,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:25:45,057 INFO L471 AbstractCegarLoop]: Abstraction has 568 states and 804 transitions. [2025-02-07 21:25:45,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-02-07 21:25:45,058 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 804 transitions. [2025-02-07 21:25:45,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-02-07 21:25:45,061 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:25:45,062 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 7, 7, 7, 7, 7, 6, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:25:45,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-07 21:25:45,062 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:25:45,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:25:45,063 INFO L85 PathProgramCache]: Analyzing trace with hash 1486347751, now seen corresponding path program 1 times [2025-02-07 21:25:45,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:25:45,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165210479] [2025-02-07 21:25:45,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:25:45,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:25:45,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-02-07 21:25:45,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-02-07 21:25:45,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:25:45,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:25:45,479 INFO L134 CoverageAnalysis]: Checked inductivity of 688 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 688 trivial. 0 not checked. [2025-02-07 21:25:45,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:25:45,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165210479] [2025-02-07 21:25:45,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165210479] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:25:45,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:25:45,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 21:25:45,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732987086] [2025-02-07 21:25:45,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:25:45,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 21:25:45,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:25:45,481 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 21:25:45,481 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 21:25:45,481 INFO L87 Difference]: Start difference. First operand 568 states and 804 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-02-07 21:25:45,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:25:45,701 INFO L93 Difference]: Finished difference Result 1053 states and 1472 transitions. [2025-02-07 21:25:45,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 21:25:45,701 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 190 [2025-02-07 21:25:45,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:25:45,705 INFO L225 Difference]: With dead ends: 1053 [2025-02-07 21:25:45,705 INFO L226 Difference]: Without dead ends: 497 [2025-02-07 21:25:45,707 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-07 21:25:45,707 INFO L435 NwaCegarLoop]: 254 mSDtfsCounter, 201 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 713 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 21:25:45,707 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 713 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 21:25:45,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2025-02-07 21:25:45,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 493. [2025-02-07 21:25:45,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 493 states, 302 states have (on average 1.1589403973509933) internal successors, (350), 304 states have internal predecessors, (350), 159 states have call successors, (159), 29 states have call predecessors, (159), 31 states have return successors, (178), 159 states have call predecessors, (178), 159 states have call successors, (178) [2025-02-07 21:25:45,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 687 transitions. [2025-02-07 21:25:45,735 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 687 transitions. Word has length 190 [2025-02-07 21:25:45,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:25:45,735 INFO L471 AbstractCegarLoop]: Abstraction has 493 states and 687 transitions. [2025-02-07 21:25:45,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-02-07 21:25:45,736 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 687 transitions. [2025-02-07 21:25:45,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-02-07 21:25:45,738 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:25:45,738 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 7, 7, 7, 7, 7, 6, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:25:45,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-07 21:25:45,739 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:25:45,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:25:45,739 INFO L85 PathProgramCache]: Analyzing trace with hash 162961863, now seen corresponding path program 1 times [2025-02-07 21:25:45,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:25:45,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421044380] [2025-02-07 21:25:45,739 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:25:45,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:25:45,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-02-07 21:25:45,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-02-07 21:25:45,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:25:45,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:25:46,324 INFO L134 CoverageAnalysis]: Checked inductivity of 688 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 688 trivial. 0 not checked. [2025-02-07 21:25:46,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:25:46,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421044380] [2025-02-07 21:25:46,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421044380] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:25:46,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:25:46,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 21:25:46,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218904850] [2025-02-07 21:25:46,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:25:46,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 21:25:46,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:25:46,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 21:25:46,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 21:25:46,326 INFO L87 Difference]: Start difference. First operand 493 states and 687 transitions. Second operand has 5 states, 4 states have (on average 13.5) internal successors, (54), 5 states have internal predecessors, (54), 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-07 21:25:46,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:25:46,719 INFO L93 Difference]: Finished difference Result 540 states and 745 transitions. [2025-02-07 21:25:46,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-07 21:25:46,720 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 13.5) internal successors, (54), 5 states have internal predecessors, (54), 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 190 [2025-02-07 21:25:46,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:25:46,723 INFO L225 Difference]: With dead ends: 540 [2025-02-07 21:25:46,723 INFO L226 Difference]: Without dead ends: 422 [2025-02-07 21:25:46,724 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-07 21:25:46,724 INFO L435 NwaCegarLoop]: 268 mSDtfsCounter, 204 mSDsluCounter, 590 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 858 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-07 21:25:46,724 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 858 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-07 21:25:46,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2025-02-07 21:25:46,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 412. [2025-02-07 21:25:46,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 257 states have (on average 1.1634241245136188) internal successors, (299), 259 states have internal predecessors, (299), 127 states have call successors, (127), 25 states have call predecessors, (127), 27 states have return successors, (144), 127 states have call predecessors, (144), 127 states have call successors, (144) [2025-02-07 21:25:46,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 570 transitions. [2025-02-07 21:25:46,750 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 570 transitions. Word has length 190 [2025-02-07 21:25:46,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:25:46,750 INFO L471 AbstractCegarLoop]: Abstraction has 412 states and 570 transitions. [2025-02-07 21:25:46,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 13.5) internal successors, (54), 5 states have internal predecessors, (54), 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-07 21:25:46,750 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 570 transitions. [2025-02-07 21:25:46,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2025-02-07 21:25:46,753 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:25:46,753 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 10, 10, 10, 10, 10, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:25:46,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-07 21:25:46,753 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:25:46,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:25:46,754 INFO L85 PathProgramCache]: Analyzing trace with hash -918620638, now seen corresponding path program 1 times [2025-02-07 21:25:46,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:25:46,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861695517] [2025-02-07 21:25:46,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:25:46,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:25:46,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 236 statements into 1 equivalence classes. [2025-02-07 21:25:46,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 236 of 236 statements. [2025-02-07 21:25:46,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:25:46,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:25:47,165 INFO L134 CoverageAnalysis]: Checked inductivity of 1027 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1023 trivial. 0 not checked. [2025-02-07 21:25:47,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:25:47,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861695517] [2025-02-07 21:25:47,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861695517] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 21:25:47,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [605184446] [2025-02-07 21:25:47,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:25:47,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 21:25:47,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 21:25:47,170 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-07 21:25:47,172 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-07 21:25:47,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 236 statements into 1 equivalence classes. [2025-02-07 21:25:47,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 236 of 236 statements. [2025-02-07 21:25:47,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:25:47,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:25:47,575 INFO L256 TraceCheckSpWp]: Trace formula consists of 1638 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-02-07 21:25:47,581 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 21:25:47,818 INFO L134 CoverageAnalysis]: Checked inductivity of 1027 backedges. 503 proven. 0 refuted. 0 times theorem prover too weak. 524 trivial. 0 not checked. [2025-02-07 21:25:47,818 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-07 21:25:47,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [605184446] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:25:47,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-07 21:25:47,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 12 [2025-02-07 21:25:47,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669555097] [2025-02-07 21:25:47,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:25:47,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-07 21:25:47,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:25:47,819 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-07 21:25:47,819 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2025-02-07 21:25:47,819 INFO L87 Difference]: Start difference. First operand 412 states and 570 transitions. Second operand has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 6 states have internal predecessors, (75), 4 states have call successors, (30), 3 states have call predecessors, (30), 4 states have return successors, (30), 4 states have call predecessors, (30), 4 states have call successors, (30) [2025-02-07 21:25:48,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:25:48,688 INFO L93 Difference]: Finished difference Result 936 states and 1288 transitions. [2025-02-07 21:25:48,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-07 21:25:48,689 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 6 states have internal predecessors, (75), 4 states have call successors, (30), 3 states have call predecessors, (30), 4 states have return successors, (30), 4 states have call predecessors, (30), 4 states have call successors, (30) Word has length 236 [2025-02-07 21:25:48,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:25:48,692 INFO L225 Difference]: With dead ends: 936 [2025-02-07 21:25:48,692 INFO L226 Difference]: Without dead ends: 499 [2025-02-07 21:25:48,694 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 233 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2025-02-07 21:25:48,694 INFO L435 NwaCegarLoop]: 207 mSDtfsCounter, 201 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 758 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 906 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 758 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-07 21:25:48,695 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 503 Invalid, 906 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 758 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-07 21:25:48,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2025-02-07 21:25:48,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 493. [2025-02-07 21:25:48,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 493 states, 308 states have (on average 1.1331168831168832) internal successors, (349), 311 states have internal predecessors, (349), 147 states have call successors, (147), 34 states have call predecessors, (147), 37 states have return successors, (176), 147 states have call predecessors, (176), 147 states have call successors, (176) [2025-02-07 21:25:48,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 672 transitions. [2025-02-07 21:25:48,728 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 672 transitions. Word has length 236 [2025-02-07 21:25:48,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:25:48,729 INFO L471 AbstractCegarLoop]: Abstraction has 493 states and 672 transitions. [2025-02-07 21:25:48,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 6 states have internal predecessors, (75), 4 states have call successors, (30), 3 states have call predecessors, (30), 4 states have return successors, (30), 4 states have call predecessors, (30), 4 states have call successors, (30) [2025-02-07 21:25:48,729 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 672 transitions. [2025-02-07 21:25:48,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2025-02-07 21:25:48,732 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:25:48,732 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 10, 10, 10, 10, 10, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:25:48,743 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-07 21:25:48,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 21:25:48,937 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:25:48,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:25:48,937 INFO L85 PathProgramCache]: Analyzing trace with hash 1294791587, now seen corresponding path program 1 times [2025-02-07 21:25:48,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:25:48,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720484803] [2025-02-07 21:25:48,941 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:25:48,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:25:48,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 234 statements into 1 equivalence classes. [2025-02-07 21:25:49,028 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 234 of 234 statements. [2025-02-07 21:25:49,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:25:49,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:25:49,318 INFO L134 CoverageAnalysis]: Checked inductivity of 1027 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1023 trivial. 0 not checked. [2025-02-07 21:25:49,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:25:49,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720484803] [2025-02-07 21:25:49,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720484803] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 21:25:49,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [539250691] [2025-02-07 21:25:49,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:25:49,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 21:25:49,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 21:25:49,328 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 21:25:49,329 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-07 21:25:49,609 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 234 statements into 1 equivalence classes. [2025-02-07 21:25:49,764 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 234 of 234 statements. [2025-02-07 21:25:49,764 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:25:49,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:25:49,774 INFO L256 TraceCheckSpWp]: Trace formula consists of 1635 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-02-07 21:25:49,781 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 21:25:49,833 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2025-02-07 21:25:49,865 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 21:25:49,865 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 21 treesize of output 13 [2025-02-07 21:25:50,011 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-07 21:25:50,208 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-07 21:25:50,306 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-07 21:25:50,460 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-07 21:25:50,568 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-07 21:25:50,721 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-07 21:25:50,825 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-07 21:25:50,959 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-07 21:25:51,033 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-07 21:25:51,368 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-07 21:25:52,153 INFO L349 Elim1Store]: treesize reduction 24, result has 48.9 percent of original size [2025-02-07 21:25:52,154 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 44 [2025-02-07 21:25:56,662 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 68 treesize of output 50 [2025-02-07 21:25:56,769 INFO L349 Elim1Store]: treesize reduction 77, result has 52.2 percent of original size [2025-02-07 21:25:56,769 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 90 treesize of output 123 [2025-02-07 21:25:57,094 INFO L134 CoverageAnalysis]: Checked inductivity of 1027 backedges. 600 proven. 105 refuted. 0 times theorem prover too weak. 322 trivial. 0 not checked. [2025-02-07 21:25:57,094 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 21:25:57,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [539250691] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 21:25:57,740 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-07 21:25:57,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 23] total 28 [2025-02-07 21:25:57,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559724896] [2025-02-07 21:25:57,741 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-07 21:25:57,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-02-07 21:25:57,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:25:57,743 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-02-07 21:25:57,743 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=867, Unknown=0, NotChecked=0, Total=992 [2025-02-07 21:25:57,744 INFO L87 Difference]: Start difference. First operand 493 states and 672 transitions. Second operand has 28 states, 26 states have (on average 5.461538461538462) internal successors, (142), 27 states have internal predecessors, (142), 15 states have call successors, (58), 9 states have call predecessors, (58), 11 states have return successors, (58), 13 states have call predecessors, (58), 15 states have call successors, (58) [2025-02-07 21:26:00,880 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.98s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-07 21:26:04,959 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 [0] [2025-02-07 21:26:09,061 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-07 21:26:10,625 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-07 21:26:14,166 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.54s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-07 21:26:16,872 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.71s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-07 21:26:20,936 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 [0] [2025-02-07 21:26:24,943 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-07 21:26:27,433 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.49s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-07 21:26:30,636 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.20s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-07 21:26:32,875 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.24s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-07 21:26:49,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:26:49,850 INFO L93 Difference]: Finished difference Result 1800 states and 2495 transitions. [2025-02-07 21:26:49,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2025-02-07 21:26:49,851 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 26 states have (on average 5.461538461538462) internal successors, (142), 27 states have internal predecessors, (142), 15 states have call successors, (58), 9 states have call predecessors, (58), 11 states have return successors, (58), 13 states have call predecessors, (58), 15 states have call successors, (58) Word has length 234 [2025-02-07 21:26:49,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:26:49,872 INFO L225 Difference]: With dead ends: 1800 [2025-02-07 21:26:49,872 INFO L226 Difference]: Without dead ends: 1325 [2025-02-07 21:26:49,877 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 394 GetRequests, 271 SyntacticMatches, 25 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3246 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=1451, Invalid=8449, Unknown=0, NotChecked=0, Total=9900 [2025-02-07 21:26:49,881 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 1004 mSDsluCounter, 1519 mSDsCounter, 0 mSdLazyCounter, 3301 mSolverCounterSat, 1218 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 46.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1029 SdHoareTripleChecker+Valid, 1688 SdHoareTripleChecker+Invalid, 4523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1218 IncrementalHoareTripleChecker+Valid, 3301 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 47.0s IncrementalHoareTripleChecker+Time [2025-02-07 21:26:49,881 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1029 Valid, 1688 Invalid, 4523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1218 Valid, 3301 Invalid, 4 Unknown, 0 Unchecked, 47.0s Time] [2025-02-07 21:26:49,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1325 states. [2025-02-07 21:26:50,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1325 to 1183. [2025-02-07 21:26:50,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1183 states, 718 states have (on average 1.1114206128133706) internal successors, (798), 746 states have internal predecessors, (798), 365 states have call successors, (365), 94 states have call predecessors, (365), 99 states have return successors, (482), 342 states have call predecessors, (482), 365 states have call successors, (482) [2025-02-07 21:26:50,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1183 states to 1183 states and 1645 transitions. [2025-02-07 21:26:50,057 INFO L78 Accepts]: Start accepts. Automaton has 1183 states and 1645 transitions. Word has length 234 [2025-02-07 21:26:50,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:26:50,058 INFO L471 AbstractCegarLoop]: Abstraction has 1183 states and 1645 transitions. [2025-02-07 21:26:50,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 26 states have (on average 5.461538461538462) internal successors, (142), 27 states have internal predecessors, (142), 15 states have call successors, (58), 9 states have call predecessors, (58), 11 states have return successors, (58), 13 states have call predecessors, (58), 15 states have call successors, (58) [2025-02-07 21:26:50,059 INFO L276 IsEmpty]: Start isEmpty. Operand 1183 states and 1645 transitions. [2025-02-07 21:26:50,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2025-02-07 21:26:50,062 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:26:50,063 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 10, 10, 10, 10, 10, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:26:50,075 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-07 21:26:50,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-02-07 21:26:50,264 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:26:50,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:26:50,269 INFO L85 PathProgramCache]: Analyzing trace with hash 1532130214, now seen corresponding path program 1 times [2025-02-07 21:26:50,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:26:50,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832250167] [2025-02-07 21:26:50,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:26:50,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:26:50,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 234 statements into 1 equivalence classes. [2025-02-07 21:26:50,356 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 234 of 234 statements. [2025-02-07 21:26:50,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:26:50,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:26:50,861 INFO L134 CoverageAnalysis]: Checked inductivity of 1027 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1023 trivial. 0 not checked. [2025-02-07 21:26:50,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:26:50,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832250167] [2025-02-07 21:26:50,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832250167] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:26:50,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:26:50,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-07 21:26:50,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714035043] [2025-02-07 21:26:50,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:26:50,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-07 21:26:50,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:26:50,865 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-07 21:26:50,865 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-02-07 21:26:50,865 INFO L87 Difference]: Start difference. First operand 1183 states and 1645 transitions. Second operand has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 6 states have call successors, (28), 3 states have call predecessors, (28), 4 states have return successors, (28), 5 states have call predecessors, (28), 6 states have call successors, (28) [2025-02-07 21:26:51,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:26:51,586 INFO L93 Difference]: Finished difference Result 2420 states and 3438 transitions. [2025-02-07 21:26:51,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-07 21:26:51,587 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 6 states have call successors, (28), 3 states have call predecessors, (28), 4 states have return successors, (28), 5 states have call predecessors, (28), 6 states have call successors, (28) Word has length 234 [2025-02-07 21:26:51,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:26:51,616 INFO L225 Difference]: With dead ends: 2420 [2025-02-07 21:26:51,616 INFO L226 Difference]: Without dead ends: 1291 [2025-02-07 21:26:51,620 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-02-07 21:26:51,622 INFO L435 NwaCegarLoop]: 182 mSDtfsCounter, 158 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 477 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 600 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 477 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-07 21:26:51,622 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 521 Invalid, 600 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 477 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-07 21:26:51,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1291 states. [2025-02-07 21:26:51,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1291 to 1183. [2025-02-07 21:26:51,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1183 states, 718 states have (on average 1.1114206128133706) internal successors, (798), 746 states have internal predecessors, (798), 365 states have call successors, (365), 94 states have call predecessors, (365), 99 states have return successors, (482), 342 states have call predecessors, (482), 365 states have call successors, (482) [2025-02-07 21:26:51,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1183 states to 1183 states and 1645 transitions. [2025-02-07 21:26:51,772 INFO L78 Accepts]: Start accepts. Automaton has 1183 states and 1645 transitions. Word has length 234 [2025-02-07 21:26:51,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:26:51,772 INFO L471 AbstractCegarLoop]: Abstraction has 1183 states and 1645 transitions. [2025-02-07 21:26:51,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 6 states have call successors, (28), 3 states have call predecessors, (28), 4 states have return successors, (28), 5 states have call predecessors, (28), 6 states have call successors, (28) [2025-02-07 21:26:51,773 INFO L276 IsEmpty]: Start isEmpty. Operand 1183 states and 1645 transitions. [2025-02-07 21:26:51,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2025-02-07 21:26:51,776 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:26:51,776 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 10, 10, 10, 10, 10, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:26:51,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-07 21:26:51,776 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:26:51,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:26:51,777 INFO L85 PathProgramCache]: Analyzing trace with hash -85310236, now seen corresponding path program 1 times [2025-02-07 21:26:51,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:26:51,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627561984] [2025-02-07 21:26:51,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:26:51,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:26:51,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 234 statements into 1 equivalence classes. [2025-02-07 21:26:51,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 234 of 234 statements. [2025-02-07 21:26:51,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:26:51,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:26:53,002 INFO L134 CoverageAnalysis]: Checked inductivity of 1027 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 1020 trivial. 0 not checked. [2025-02-07 21:26:53,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:26:53,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627561984] [2025-02-07 21:26:53,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627561984] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 21:26:53,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1970446043] [2025-02-07 21:26:53,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:26:53,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 21:26:53,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 21:26:53,005 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 21:26:53,007 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-07 21:26:53,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 234 statements into 1 equivalence classes. [2025-02-07 21:26:53,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 234 of 234 statements. [2025-02-07 21:26:53,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:26:53,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:26:53,501 INFO L256 TraceCheckSpWp]: Trace formula consists of 1730 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-02-07 21:26:53,506 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 21:26:53,669 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-07 21:26:55,492 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 21:26:55,504 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 21:26:55,504 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 48 [2025-02-07 21:26:56,329 INFO L349 Elim1Store]: treesize reduction 64, result has 54.9 percent of original size [2025-02-07 21:26:56,330 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 49 treesize of output 104